The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
A Tutorial on MM Algorithms
Abstract
Most problems in frequentist statistics involve optimization of a function such as a likelihood or a sum of squares. EM algorithms are among the most effective algorithms for maximum likelihood estimation because they consistently drive the likelihood uphill by maximizing a simple surrogate function for the log-likelihood. Iterative optimization of a surrogate function as exemplified by an EM algorithm does not necessarily require missing data. Indeed, every EM algorithm is a special case of the more general class of MM optimization algorithms, which typically exploit convexity rather than missing data in majorizing or minorizing an objective function. In our opinion, MM algorithms deserve to be part of the standard toolkit of professional statisticians. This article explains the principle behind MM algorithms, suggests some methods for constructing them, and discusses some of their attractive features. We include numerous examples throughout the article to illustrate the concepts described. In addition to surveying previous work on MM algorithms, this article introduces some new material on constrained optimization and standard error estimation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(1990) · Choice Reviews Online · doi:10.5860/choice.27-3338 · Cited by 35,305
Koenker, R., & Bassett, G. (1978) · Econometrica · doi:10.2307/1913643 · Cited by 13,316
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
Inequalities: Theory of Majorization and its Applications.
Arnold, B. C., Marshall, A. W., & Olkin, I. (1981) · Journal of the American Statistical Association · doi:10.2307/2287859 · Cited by 4,870
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Maximum likelihood estimation via the ECM algorithm: A general framework
MENG, X.-L., & RUBIN, D. B. (1993) · Biometrika · doi:10.1093/biomet/80.2.267 · Cited by 1,861
Iterative solution of nonlinear equations
Murphy, R. D. (1994) · Journal of Computers in Mathematics and Science Teaching · Cited by 1,192
Optimization Transfer Using Surrogate Objective Functions
Lange, K., Hunter, D. R., & Yang, I. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474858 · Cited by 808
Self-citationUsing EM to Obtain Asymptotic Variance-Covariance Matrices: The SEM Algorithm
Meng, X.-L., & Rubin, D. B. (1991) · Journal of the American Statistical Association · doi:10.1080/01621459.1991.10475130 · Cited by 559
Numerical Analysis for Statisticians
Lange, K. (2010) · Statistics and Computing · doi:10.1007/978-1-4419-5945-4 · Cited by 517
Self-citationDe Pierro, A. R. (1995) · IEEE Transactions on Medical Imaging · doi:10.1109/42.370409 · Cited by 475
MM algorithms for generalized Bradley-Terry models
Hunter, D. R. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120141 · Cited by 467
Self-citationA Gradient Algorithm Locally Equivalent to the Em Algorithm
Lange, K. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02037.x · Cited by 376
Self-citationModelling association football scores
Maher, M. J. (1982) · Statistica Neerlandica · doi:10.1111/j.1467-9574.1982.tb00782.x · Cited by 373
Quantile Regression via an MM Algorithm
Hunter, D. R., & Lange, K. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474866 · Cited by 353
Self-citationNormal/Independent Distributions and Their Applications in Robust Regression
Lange, K., & Sinsheimer, J. S. (1993) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1993.10474606 · Cited by 322
Self-citationGlobally convergent algorithms for maximum a posteriori transmission tomography
Lange, K., & Fessler, J. A. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.465107 · Cited by 313
Self-citationProximal minimization algorithm withD-functions
Censor, Y., & Zenios, S. A. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940051 · Cited by 268
Block-relaxation Algorithms in Statistics
de Leeuw, J. (1994) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/978-3-642-46808-7_28 · Cited by 216
Acceleration of the EM Algorithm by using Quasi-Newton Methods
Jamshidian, M., & Jennrich, R. I. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00083 · Cited by 203
Monotonicity of quadratic-approximation algorithms
Böhning, D., & Lindsay, B. G. (1988) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf00049423 · Cited by 170
Normal/Independent Distributions and Their Applications in Robust Regression
Lange, K. L., & Sinsheimer, J. S. (1993) · Journal of Computational and Graphical Statistics · doi:10.2307/1390698 · Cited by 109
Self-citationEM algorithms without missing data
Becker, M. P., Yang, I., & Lange, K. L. (1997) · Statistical Methods in Medical Research · doi:10.1177/096228029700600104 · Cited by 97
Self-citation
Cited by
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Trust region policy optimization
Schulman, J., Levine, S., Moritz, P., Jordan, M. I., & Abbeel, P. (2015) · arXiv · doi:10.48550/arxiv.1502.05477 · Cited by 4,578
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
Huang, C., Zappone, A., Alexandropoulos, G. C., Debbah, M., & Yuen, C. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2922609 · Cited by 3,761
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Metadata
- Authors
- Hunter, D. R., & Lange, K.
- Venue
- The American Statistician
- Publisher
- Informa UK Limited
- Published
- 2004-02
- Volume
- 58
- Issue
- 1
- Pages
- 30-37
- ISSN
- 0003-1305 (ISSN-L)
- 1537-2731
- OpenAlex
- W2149414429
- Cited by
- 1,783
- References
- 26
- FWCI
- 23.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.