EM algorithm for two-component exponential mixtures converges at sub-exponential rate in O(log n) iterations under generalized separation assumptions.
Electronic Journal of Statistics14(1), 632–660 (2020)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A gradient method alternating short GD steps and long Polyak steps achieves local linear convergence for overparameterized GMMs under mixture-weight assumptions.
citing papers explorer
-
Global convergence analysis of mixtures of Exponential densities
EM algorithm for two-component exponential mixtures converges at sub-exponential rate in O(log n) iterations under generalized separation assumptions.
-
Local linear convergence of gradient methods for overparameterized Gaussian mixtures
A gradient method alternating short GD steps and long Polyak steps achieves local linear convergence for overparameterized GMMs under mixture-weight assumptions.