A monotonic MM-type algorithm for estimation of nonparametric finite mixture models with dependent marginals
Michael Levine

TL;DR
This paper introduces a new monotonic MM algorithm for estimating components of nonparametric finite mixture models with dependent marginals, ensuring convergence and comparable performance to existing methods.
Contribution
It presents the first monotonic MM algorithm for nonparametric mixture models with dependent marginals, improving convergence guarantees over previous approaches.
Findings
Algorithm converges to a local maximum of the penalized likelihood.
Performance is comparable to existing non-monotonic algorithms.
Demonstrated effectiveness on simulated and real datasets.
Abstract
In this manuscript, we consider a finite nonparametric mixture model with non-independent marginal density functions. Dependence between the marginal densities is modeled using a copula device. Until recently, no deterministic algorithms capable of estimating components of such a model have been available. A deterministic algorithm that is capable of this has been proposed in \citet*{levine2024smoothed}. That algorithm seeks to maximize a smoothed nonparametric penalized log-likelihood; it seems to perform well in practice but does not possess the monotonicity property. In this manuscript, we introduce a deterministic MM (Minorization-Maximization) algorithm for estimation of components of this model that is also maximizing a smoothed penalized nonparametric log-likelihood but that is monotonic with respect to this objective functional. Besides the convergence of the objective…
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.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Methods and Inference · Machine Learning and Algorithms
