Divergence-Minimization for Latent-Structure Models: Monotone Operators, Contraction Guarantees, and Robust Inference
Lei Li, Anand N. Vidyashankar

TL;DR
This paper introduces a divergence-minimization framework for robust inference in latent-mixture models, unifying EM and offering enhanced robustness, consistency, and practical component number selection.
Contribution
It develops a divergence-minimization approach that generalizes EM, provides theoretical guarantees, robustness analysis, and a method for component number determination.
Findings
DM algorithms decrease the objective monotonically
Estimators are consistent and asymptotically normal
DM methods outperform EM under contamination
Abstract
We develop a divergence-minimization (DM) framework for robust and efficient inference in latent-mixture models. By optimizing a residual-adjusted divergence, the DM approach recovers EM as a special case and yields robust alternatives through different divergence choices. We establish that the sample objective decreases monotonically along the iterates, leading the DM sequence to stationary points under standard conditions, and that at the population level the operator exhibits local contractivity near the minimizer. Additionally, we verify consistency and -asymptotic normality of minimum-divergence estimators and of finitely many DM iterations, showing that under correct specification their limiting covariance matches the Fisher information. Robustness is analyzed via the residual-adjustment function, yielding bounded influence functions and a strictly positive breakdown…
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 · Generative Adversarial Networks and Image Synthesis · Statistical Mechanics and Entropy
