Convergence rate for predictive recursion estimation of finite mixtures

From MaRDI portal
Publication:419247

DOI10.1016/J.SPL.2011.10.023zbMATH Open1237.62044arXiv1106.4223OpenAlexW2063061677MaRDI QIDQ419247FDOQ419247


Authors: Ryan Martin Edit this on Wikidata


Publication date: 18 May 2012

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Abstract: Predictive recursion (PR) is a fast stochastic algorithm for nonparametric estimation of mixing distributions in mixture models. It is known that the PR estimates of both the mixing and mixture densities are consistent under fairly mild conditions, but currently very little is known about the rate of convergence. Here I first investigate asymptotic convergence properties of the PR estimate under model misspecification in the special case of finite mixtures with known support. Tools from stochastic approximation theory are used to prove that the PR estimates converge, to the best Kullback--Leibler approximation, at a nearly root-n rate. When the support is unknown, PR can be used to construct an objective function which, when optimized, yields an estimate the support. I apply the known-support results to derive a rate of convergence for this modified PR estimate in the unknown support case, which compares favorably to known optimal rates.


Full work available at URL: https://arxiv.org/abs/1106.4223




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Convergence rate for predictive recursion estimation of finite mixtures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419247)