A mirror descent approach to maximum likelihood estimation in latent variable models
Not on the map. Why?
Abstract (arXiv)
We introduce an approach based on mirror descent and sequential Monte Carlo (SMC) to perform joint parameter inference and posterior estimation in latent variable models. This approach is based on minimisation of a functional over the parameter space and the space of probability distributions and, contrary to other popular approaches, can be implemented when the latent variable takes values in discrete spaces. We provide a detailed theoretical analysis of both the mirror descent algorithm and its approximation via SMC. We experimentally show that the proposed algorithm outperforms standard expectation maximisation algorithms and is competitive with other popular methods for real-valued latent variables.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). First posted on arXiv 27 Jan 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithmcited by 3
- 2025Learning Latent Energy-Based Models via Interacting Particle Langevin Dynamicscited by 3
- 2026Efficient Stochastic Optimisation via Sequential Monte Carlocited by 1
- 2026Efficient Agentic Reasoning Through Self-Regulated Simulative Planningcited by 1
- 2026Efficient Agentic Reasoning Through Self-Regulated Simulative Planning21 May 2026
- 2026Efficient Stochastic Optimisation via Sequential Monte Carlo29 Jan 2026
- 2025Learning Latent Energy-Based Models via Interacting Particle Langevin Dynamics14 Oct 2025
- 2025Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm23 May 2025