Efficient preconditioned stochastic gradient descent for estimation in latent variable models
arXiv:2306.12841
Abstract
Latent variable models are powerful tools for modeling complex phenomena involving in particular partially observed data, unobserved variables or underlying complex unknown structures. Inference is often difficult due to the latent structure of the model. To deal with parameter estimation in the presence of latent variables, well-known efficient methods exist, such as gradient-based and EM-type algorithms, but with practical and theoretical limitations. In this paper, we propose as an alternative for parameter estimation an efficient preconditioned stochastic gradient algorithm. Our method includes a preconditioning step based on a positive definite Fisher information matrix estimate. We prove convergence results for the proposed algorithm under mild assumptions for very general latent variables models. We illustrate through relevant simulations the performance of the proposed methodology in a nonlinear mixed effects model and in a stochastic block model.
References in corpus (7)
- SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator
- Stochastic Variance Reduction for Nonconvex Optimization
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Preconditioned Stochastic Gradient Descent
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- On perturbed proximal gradient algorithms
- Parametrization Cookbook: A set of Bijective Parametrizations for using Machine Learning methods in Statistical Inference