Revisiting consistency of a recursive estimator of mixing distributions

Abstract

Estimation of the mixing distribution under a general mixture model is a very difficult problem, especially when the mixing distribution is assumed to have a density. Predictive recursion (PR) is a fast, recursive algorithm for nonparametric estimation of a mixing distribution/density in general mixture models. However, the existing PR consistency results make rather strong assumptions, some of which fail for a class of mixture models relevant for monotone density estimation, namely, scale mixtures of uniform kernels. In this paper, we develop new consistency results for PR under weaker conditions. Armed with this new theory, we prove that PR is consistent for the scale mixture of uniforms problem, and we show that the corresponding PR mixture density estimator has very good practical performance compared to several existing methods for monotone density estimation.

27 pages, 3 figures

References in corpus (8)

• Microarrays, Empirical Bayes and the Two-Groups Model
• Misspecification in infinite-dimensional Bayesian statistics
• Kullback Leibler property of kernel mixture priors in Bayesian density estimation
• A companion for the Kiefer--Wolfowitz--Blum stochastic approximation algorithm
• Consistency of a recursive estimate of mixing distributions
• Stochastic Approximation and Newton's Estimate of a Mixing Distribution
• Permutation-based uncertainty quantification about a mixing distribution
• Estimating a mixing distribution on the sphere using predictive recursion

Cited by in corpus (2)

• A Bayesian Bootstrap for Mixture Models
• Anytime valid and asymptotically optimal inference driven by predictive recursion