Properties of the stochastic approximation EM algorithm with mini-batch sampling
From MaRDI portal
Abstract: To deal with very large datasets a mini-batch version of the Monte Carlo Markov Chain Stochastic Approximation Expectation-Maximization algorithm for general latent variable models is proposed. For exponential models the algorithm is shown to be convergent under classicalconditions as the number of iterations increases. Numerical experiments illustrate the performance of the mini-batch algorithm in various models.In particular, we highlight that mini-batch sampling results in an important speed-up of the convergence of the sequence of estimators generated by the algorithm. Moreover, insights on the effect of the mini-batch size on the limit distribution are presented. Finally, we illustrate how to use mini-batch sampling in practice to improve results when a constraint on the computing time is given.
Recommendations
- On stochastic versions of the EM algorithm
- scientific article; zbMATH DE number 849934
- The stochastic EM algorithm: Estimation and asymptotic results
- Convergence of a stochastic approximation version of the EM algorithm
- Stochastic versions of the em algorithm: an experimental study in the mixture case
- A new class of stochastic EM algorithms. Escaping local maxima and handling intractable sampling
Cites work
- Construction of Bayesian deformable models via a stochastic approximation algorithm: a convergence study
- Convergence of a stochastic approximation version of the EM algorithm
- Convergence of the Wang-Landau algorithm
- Coupling a stochastic approximation version of EM with an MCMC procedure
- scientific article; zbMATH DE number 3886919 (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 739537 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- Maximum likelihood estimation in nonlinear mixed effects models
- Mini-batch learning of exponential family finite mixture models
- Modeling heterogeneity in random graphs through latent space models: a selective review
- On the geometric ergodicity of hybrid samplers
- On-line expectation-maximization algorithm for latent data models
- Stability of Stochastic Approximation under Verifiable Conditions
- The frailty model.
- Towards a Coherent Statistical Framework for Dense Deformable Template Estimation
Cited in
(10)- On the convergence of stochastic approximations under a subgeometric ergodic Markov dynamic
- Fast incremental expectation maximization for finite-sum optimization: nonasymptotic convergence
- Mini-batch learning of exponential family finite mixture models
- On the curved exponential family in the stochastic approximation expectation maximization algorithm
- Mini-Batch Metropolis–Hastings With Reversible SGLD Proposal
- Global implicit function theorems and the online expectation–maximisation algorithm
- Scalable magnetic resonance fingerprinting: incremental inference of high-dimensional elliptical mixtures from large data volumes
- Disentangling the structure of ecological bipartite networks from observation processes
- Distributed online expectation-maximization algorithm for Poisson mixture model
- Convergent stochastic algorithm for estimation in general multivariate correlated frailty models using integrated partial likelihood
This page was built for publication: Properties of the stochastic approximation EM algorithm with mini-batch sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2209731)
