1. A unified construction for series representations and finite approximations of completely random measures
- Author
-
Lee, J, Miscouridou, X, and Caron, F
- Subjects
FOS: Computer and information sciences ,Statistics and Probability ,Computer Science - Machine Learning ,Statistics - Machine Learning ,FOS: Mathematics ,Mathematics - Statistics Theory ,Machine Learning (stat.ML) ,Statistics Theory (math.ST) ,Machine Learning (cs.LG) - Abstract
Infinite-activity completely random measures (CRMs) have become important building blocks of complex Bayesian nonparametric models. They have been successfully used in various applications such as clustering, density estimation, latent feature models, survival analysis or network science. Popular infinite-activity CRMs include the (generalised) gamma process and the (stable) beta process. However, except in some specific cases, exact simulation or scalable inference with these models is challenging and finite-dimensional approximations are often considered. In this work, we propose a general and unified framework to derive both series representations and finite-dimensional approximations of CRMs. Our framework can be seen as a generalisation of constructions based on size-biased sampling of Poisson point process (Probab. Theory Related Fields 92 (1992) 21–39). It includes as special cases several known series representations and finite approximations as well as novel ones. In particular, we show that one can get novel series representations for the generalised gamma process and the stable beta process. We show how these constructions can be used to derive novel algorithms for posterior inference, including a generalisation of the slice sampler for normalised CRMs mixture models introduced by (J. Comput. Graph. Statist. 20 (2011) 241–259). We also provide some analysis of the truncation error.
- Published
- 2023