A Bayesian Bootstrap for Mixture Models
Preprint
Abstract
This paper proposes a new nonparametric Bayesian bootstrap for a mixture model, by developing the traditional Bayesian bootstrap. We first reinterpret the Bayesian bootstrap, which uses the Pólya-urn scheme, as a gradient ascent algorithm which associated one-step solver. The key then is to use the same basic mechanism as the Bayesian bootstrap with the switch from a point mass kernel to a continuous kernel. Just as the Bayesian bootstrap works solely from the empirical distribution function, so the new Bayesian bootstrap for mixture models works off the nonparametric maximum likelihood estimator for the mixing distribution. From a theoretical perspective, we prove the convergence and exchangeability of the sample sequences from the algorithm and also illustrate our results with different models and settings and some real data.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Quasi-Bayes Properties of a Procedure for Sequential Learning in Mixture ModelsJournal of the Royal Statistical Society Series B: Statistical Methodology, 2020
- Convergence of an iterative algorithm to the nonparametric MLE of a mixing distributionStatistics & Probability Letters, 2018
- On the number of components in a Gaussian mixture modelWIREs Data Mining and Knowledge Discovery, 2014
- Convex Optimization, Shape Constraints, Compound Decisions, and Empirical Bayes RulesJournal of the American Statistical Association, 2014
- A tutorial on Bayesian nonparametric modelsJournal of Mathematical Psychology, 2012
- Almost sure weak convergence of random probability measuresStochastics, 2006
- Limit theorems for a class of identically distributed random variablesThe Annals of Probability, 2004
- A recursive algorithm for nonparametric analysis with missing dataBiometrika, 1999
- Nonparametric Bayes methods using predictive updating1998
- P lya-like urns and the Ewens' sampling formulaJournal of Mathematical Biology, 1984