A Mirror Descent Approach to Maximum Likelihood Estimation in Latent Variable Models

DOI10.1080/10618600.2025.2587614MaRDI QIDQ7390267zbMATH OpenFDO

Authors Francesca R. Crucinio

Publication date 2026

Published in Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10618600.2025.2587614

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• 10.1162/jmlr.2003.3.4-5.993
• A multiple-imputation Metropolis version of the EM algorithm
• Acceleration of Stochastic Approximation by Averaging
• An introduction to sequential Monte Carlo
• Convergence of a stochastic approximation version of the EM algorithm
• Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation
• Error bounds for particle gradient descent, and extensions of the log-Sobolev and Talagrand inequalities
• scientific article; zbMATH DE number 3942813 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 1222290 (Why is no real title available?)
• scientific article; zbMATH DE number 2106098 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• Importance sampling: intrinsic dimension and computational cost
• Inference for Lévy-driven stochastic volatility models via adaptive sequential Monte Carlo
• Interacting particle Langevin algorithm for maximum marginal likelihood estimation
• Latent Space Approaches to Social Network Analysis
• Marginal maximum a posteriori estimation using Markov chain Monte Carlo
• Maximum likelihood estimation via the ECM algorithm: A general framework
• MCMC maximum likelihood for latent state models
• Negative association, ordering and convergence of resampling methods
• On the convergence of adaptive sequential Monte Carlo methods
• Particle approximations of the score and observed information matrix in state space models with application to parameter estimation
• Pattern recognition and machine learning.
• Properties of the stochastic approximation EM algorithm with mini-batch sampling
• Relatively smooth convex optimization by first-order methods, and applications
• Sequential Monte Carlo Samplers
• The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence
• Waste-Free Sequential Monte Carlo

This page was built for publication: A Mirror Descent Approach to Maximum Likelihood Estimation in Latent Variable Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390267)