Bayesian MISE convergence rates of Polya urn based density estimators: asymptotic comparisons and choice of prior parameters
Sabyasachi Mukhopadhyay, Sourabh Bhattacharya

TL;DR
This paper develops a Bayesian framework for selecting prior parameters in Polya urn-based mixture models, ensuring optimal convergence rates of the density estimator as sample size grows, and compares different mixture models asymptotically.
Contribution
It introduces a Bayesian asymptotic approach for choosing prior parameters in Polya urn mixture models to achieve desired convergence rates of density estimators.
Findings
Bayesian MISE convergence rates are established for Polya urn-based estimators.
Optimal prior parameters depend on sample size and desired convergence.
Comparative asymptotic performance analysis of different mixture models is provided.
Abstract
Mixture models are well-known for their versatility, and the Bayesian paradigm is a suitable platform for mixture analysis, particularly when the number of components is unknown. Bhattacharya (2008) introduced a mixture model based on the Dirichlet process, where an upper bound on the unknown number of components is to be specified. Here we consider a Bayesian asymptotic framework for objectively specifying the upper bound, which we assume to depend on the sample size. In particular, we define a Bayesian analogue of the mean integrated squared error (Bayesian MISE), and select that form of the upper bound, and also that form of the precision parameter of the underlying Dirichlet process, for which Bayesian MISE of a specific density estimator, which is a suitable modification of the Polya-urn based prior predictive model, converges at a desired rate. As a byproduct of our approach, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
