arXiv · 2507.21840
Alternating Bregman projections and convergence of the EM algorithm
Abstract
We investigate convergence of alternating Bregman projections between non-convex sets and prove convergence to a point in the intersection, or to points realizing a gap between the two sets. The speed of convergence is generally sub-linear, but may be linear under transversality. We apply our analysis to prove convergence of versions of the expectation maximization algorithm for non-convex parameter sets.
Explore related subjects
Keep this discovery
Dominikus Noll. 2025-07-29. Alternating Bregman projections and convergence of the EM algorithm. https://arxiv.org/abs/2507.21840
Cite the original work for its findings. Save a collection to share your selection of sources.