Fast sampling and model selection for Bayesian mixture models
Not on the map. Why?
Abstract (arXiv)
We study Bayesian estimation of mixture models and argue in favor of fitting the marginal posterior distribution over component assignments directly, rather than Gibbs sampling from the joint posterior on components and parameters as is commonly done. Some previous authors have found the former approach to have slow mixing, but we show that, implemented correctly, it can achieve excellent performance. In particular, we describe a new Monte Carlo algorithm for sampling from the marginal posterior of a general integrable mixture that makes use of rejection-free sampling from the prior over component assignments to achieve excellent mixing times in typical applications, outperforming standard Gibbs sampling, in some cases by a wide margin. We demonstrate the approach with a selection of applications to Gaussian, Poisson, and categorical models.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 67 references that are in the map. First posted on arXiv 13 Jan 2025.
Builds on
7 of 67 references.
References · 7
- 2015Mixture models with a prior on the number of componentscited by 20
- 2016Estimating the number of communities in a networkcited by 9
- 2015Overfitting Bayesian Mixture Models with an Unknown Number of Componentscited by 6
- 2019Consistency of community structure in complex networkscited by 4
- 2021Representative community divisions of networkscited by 4
- 2023Distributed Collapsed Gibbs Sampler for Dirichlet Process Mixture Models in Federated Learningcited by 2
- 2024Exploring Network Structure with the Density of Statescited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.