Estimating a mixing distribution on the sphere using predictive recursion

Abstract

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 common problem for data taking values in a Euclidean space, but the work on mixing distribution estimation based on directional data taking values on the unit sphere is limited. In this paper, we propose using the predictive recursion (PR) algorithm to solve for a mixture on a sphere. One key feature of PR is its computational efficiency. Moreover, compared to likelihood-based methods that only support finite mixing distribution estimates, PR is able to estimate a smooth mixing density. PR's asymptotic consistency in spherical mixture models is established, and simulation results showcase its benefits compared to existing likelihood-based methods. We also show two real-data examples to illustrate how PR can be used for goodness-of-fit testing and clustering.

arXiv comment26 pages, 8 figures, 2 tables

References in corpus (9)

• Hypothesis test for normal mixture models: The EM approach
• A nonparametric empirical Bayes framework for large-scale multiple testing
• Consistency of a recursive estimate of mixing distributions
• Stochastic Approximation and Newton's Estimate of a Mixing Distribution
• Semiparametric inference in mixture models with predictive recursion marginal likelihood
• Bayesian test of normality versus a Dirichlet process mixture alternative
• A semiparametric scale-mixture regression model and predictive recursion maximum likelihood
• An approximate Bayesian marginal likelihood approach for estimating finite mixtures
• Permutation-based uncertainty quantification about a mixing distribution

Cited by in corpus (2)

• Revisiting consistency of a recursive estimator of mixing distributions
• A PRticle filter algorithm for nonparametric estimation of multivariate mixing distributions