Global implicit function theorems and the online expectation–maximisation algorithm
From MaRDI portal
Publication:6051671
Recommendations
- scientific article; zbMATH DE number 96167
- Riemannian online algorithms for estimating mixture model parameters
- On-line expectation-maximization algorithm for latent data models
- On EM algorithms and their proximal generalizations
- Online expectation maximization based algorithms for inference in hidden Markov models
- Convergence of a particle-based approximation of the block online expectation maximization algorithm
- Online learning of single- and multivalued functions with an infinite mixture of linear experts
- On-line maximum likelihood prediction with respect to general loss functions
- scientific article; zbMATH DE number 1569102
Cites work
- A concise text on advanced linear algebra
- A global implicit function theorem without initial point and its applications to control of non-affine systems of high dimensions
- A new class of stochastic EM algorithms. Escaping local maxima and handling intractable sampling
- A new family of multivariate heavy-tailed distributions with variable marginal amounts of tailweight: application to robust clustering
- A note on global implicit function theorems
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- Application of methods of ordinary differential equations to global inverse function theorems
- Consistency of Pseudolikelihood Estimation of Fully Visible Boltzmann Machines
- Family of mean-mixtures of multivariate normal distributions: properties, inference and assessment of multivariate skewness
- Finite mixture models
- Folklore theorems, implicit maps, and indirect inference
- Global implicit function theorems
- scientific article; zbMATH DE number 45785 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 2246242 (Why is no real title available?)
- Identifiability of Finite Mixtures
- Identifiability of Finite Mixtures of Elliptical Distributions
- Indirect inference with a non-smooth criterion function
- Information and exponential families in statistical theory
- Mini-batch learning of exponential family finite mixture models
- MM optimization algorithms
- NIST handbook of mathematical functions
- On a global implicit function theorem and some applications to integro-differential initial value problems
- On global implicit function theorem
- On the Conditional Distribution of the Multivariate t Distribution
- On the curvature of the trigamma function
- On the theory of elliptically contoured distributions
- On-line expectation-maximization algorithm for latent data models
- Online EM for functional data
- Online expectation maximization based algorithms for inference in hidden Markov models
- Properties of the stochastic approximation EM algorithm with mini-batch sampling
- Remarks on the non-identifiability of mixtures of distributions
- Sharp inequalities for polygamma functions
- Statistical modelling by exponential families
- The EM Algorithm and Extensions, 2E
- The implicit function theorem. History, theory, and applications
Cited in
(4)- Summary statistics and discrepancy measures for approximate Bayesian computation via surrogate posteriors
- Convergence of a particle-based approximation of the block online expectation maximization algorithm
- A Festschrift for Geoff McLachlan
- Scalable magnetic resonance fingerprinting: incremental inference of high-dimensional elliptical mixtures from large data volumes
This page was built for publication: Global implicit function theorems and the online expectation–maximisation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051671)
