{"ID":2889227,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.21840","arxiv_id":"2507.21840","title":"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.","short_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 converge...","url_abs":"https://arxiv.org/abs/2507.21840","url_pdf":"https://arxiv.org/pdf/2507.21840v1","authors":"[\"Dominikus Noll\"]","published":"2025-07-29T14:19:58Z","proceeding":"math.ST","tasks":"[\"math.ST\"]","methods":"[]","has_code":false}