• Corpus ID: 238408425

Revisiting consistency of a recursive estimator of mixing distributions

  title={Revisiting consistency of a recursive estimator of mixing distributions},
  author={Vaidehi Dixit and Ryan Martin},
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… 

Figures from this paper


Mixture models have received considerable attention recently and Newton [Sankhyā Ser. A 64 (2002) 306-322] proposed a fast recursive algorithm for estimating a mixing distribution. We prove almost
Estimating a mixing distribution on the sphere using predictive recursion
Mixture models are commonly used when data show signs of heterogeneity and, often, it is important to estimate the distribution of the latent variable responsible for that heterogeneity. This is a
Asymptotic properties of predictive recursion: Robustness and rate of convergence
Here we explore general asymptotic properties of Predictive Recursion (PR) for nonparametric estimation of mixing distributions. We prove that, when the mixture model is mis-specified, the estimated
Concentration rate and consistency of the posterior distribution for selected priors under monotonicity constraints
In this paper, we consider the well known problem of estimating a density function under qualitative assumptions. More precisely, we estimate monotone non-increasing densities in a Bayesian setting
Semiparametric inference in mixture models with predictive recursion marginal likelihood
Predictive recursion is an accurate and computationally efficient algorithm for nonparametric estimation of mixing densities in mixture models. In semiparametric mixture models, however, the
Stochastic Approximation and Newton’s Estimate of a Mixing Distribution
Many statistical problems involve mixture models and the need for computationally efficient methods to estimate the mixing distribution has increased dramatically in recent years. Newton [Sankhya
Permutation-based uncertainty quantification about a mixing distribution
Nonparametric estimation of a mixing distribution based on data coming from a mixture model is a challenging problem. Beyond estimation, there is interest in uncertainty quantification, e.g.,
On empirical estimation of mode based on weakly dependent samples
A non-parametric estimate of thedensity is proposed based on a sequence of mixtures of Beta densities which allows for the estimation of the mode even when the mode is possibly located on the boundary of the support of the density.
EM Estimation for Finite Mixture Models with Known Mixture Component Size
This work considers the use of an EM algorithm for fitting finite mixture models when mixture component size is known and shows robustness to the choice of starting values and exhibits numerically stable convergence properties.
Empirical Priors and Posterior Concentration Rates for a Monotone Density
In a Bayesian context, prior specification for inference on monotone densities is conceptually straightforward, but proving posterior convergence theorems is complicated by the fact that desirable