On the rate of convergence of the ECM algorithm
From MaRDI portal
This paper studies algorithms to find maximum likelihood estimates given the observed data. The author proves a fundamental result on the rate of convergence of the EM algorithm and ECM algorithm. An example is shown that intuitions accurate for complete-data iterative algorithms may not be trust-worthy in the presence of missing data.
Recommendations
Cited in
(38)- On improved EM algorithm and confidence interval construction for incomplete r c tables
- Efficient methods for estimating constrained parameters with applications to regularized (Lasso) logistic regression
- Stochastic complexity and model selection from incomplete data
- On the global and componentwise rates of convergence of the EM algorithm
- A spectral approach to estimation and smoothing of continuous spatial processes
- Statistical inference and Monte Carlo algorithms. (With discussion)
- On the rate of convergence of the ECME algorithm
- A combined likelihood ratio/information ratio bootstrap technique for estimating the number of components in finite mixtures
- Likelihood-based risk estimation for variance-gamma models
- On spectral radii of matrices governing some numerical estimating algorithms with incomplete data
- Convergence of a stochastic approximation version of the EM algorithm
- Bayesian multi-way balanced nested MANOVA models with random effects and a large number of the main factor levels
- ECM algorithm for auto-regressive multivariate skewed variance gamma model with unbounded density
- Model-based feature selection and clustering of RNA-seq data for unsupervised subtype discovery
- Eigenvalues and constraints in mixture modeling: geometric and computational issues
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- Variable selection using MM algorithms
- Study of the properties of convergence of the EM-algorithm in a probabilistic latent semantic analysis
- JKL-ECM: an implementation of ECM using Hessian curves
- Maximum likelihood estimation via the ECM algorithm: A general framework
- An Asynchronous Distributed Expectation Maximization Algorithm for Massive Data: The DEM Algorithm
- On the convergence rate of random permutation sampler and ECR algorithm in missing data models
- scientific article; zbMATH DE number 4032799 (Why is no real title available?)
- Accelerating the quadratic lower-bound algorithm via optimizing the shrinkage parameter
- ECM algorithms that converge at the rate of EM
- Likelihood-based approaches for multivariate linear models under inequality constraints for incomplete data
- scientific article; zbMATH DE number 788230 (Why is no real title available?)
- On the curved exponential family in the stochastic approximation expectation maximization algorithm
- Asymptotic Convergence Properties of the EM Algorithm for Mixture of Experts
- Robust estimation using multivariate t innovations for vector autoregressive models via ECM algorithm
- The Monte Carlo EM method for estimating multinomial probit latent variable models
- Penalized least-squares estimation for regression coefficients in high-dimensional partially linear models
- Application of EM algorithms for seismic facices classification
- Mixtures of regressions with changepoints
- Cross-fertilizing strategies for better EM mountain climbing and DA field exploration: a graphical guide book
- Quantifying the fraction of missing information for hypothesis testing in statistical and genetic studies
- Discussion: One-step sparse estimates in nonconcave penalized likelihood models: Who cares if it is a white cat or a black cat?
- New global optimization algorithms for model-based clustering
This page was built for publication: On the rate of convergence of the ECM algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327844)