{"ID":2822650,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2601.02252","arxiv_id":"2601.02252","title":"Convergence of the EM algorithm via proximal techniques","abstract":"We investigate convergence of the expectation maximization algorithm by representing it as a generalized proximal method. Convergence of iterates and not just in value is investigated under natural hypotheses such as definability of the incomplete data log-likelihood in the sense of o-minimal structure theory.","short_abstract":"We investigate convergence of the expectation maximization algorithm by representing it as a generalized proximal method. Convergence of iterates and not just in value is investigated under natural hypotheses such as definability of the incomplete data log-likelihood in the sense of o-minimal structure theory.","url_abs":"https://arxiv.org/abs/2601.02252","url_pdf":"https://arxiv.org/pdf/2601.02252v1","authors":"[\"Dominikus Noll\"]","published":"2026-01-05T16:32:30Z","proceeding":"math.ST","tasks":"[\"math.ST\"]","methods":"[]","has_code":false}