Fast convergence of the Expectation Maximization algorithm under a logarithmic Sobolev inequality

Documenti analoghi

• Error bounds for particle gradient descent, and extensions of the log-Sobolev and Talagrand inequalities
  di: Caprio, Rocco, et al.
  Pubblicazione: (2024)
• A calculus for Markov chain Monte Carlo: studying approximations in algorithms
  di: Caprio, Rocco, et al.
  Pubblicazione: (2023)
• Fast Spawn\&Prune (FS\&P): Global convergence of stochastic conic particle gradient descent via birth/death process
  di: De Castro, Yohann, et al.
  Pubblicazione: (2026)
• Convergence rate of random scan Coordinate Ascent Variational Inference under log-concavity
  di: Lavenant, Hugo, et al.
  Pubblicazione: (2024)
• Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity
  di: Bravo, Mario, et al.
  Pubblicazione: (2025)