*Result*: A Cornucopia of Maximum Likelihood Algorithms.
*Further Information*
*Classroom expositions of maximum likelihood estimation (MLE) rely on traditional calculus methods to construct analytic solutions. This creates in students a false sense of the ease with which MLE problems can be attacked. In a nod to reality, some teachers mention and apply Newton's method, Fisher scoring, and the expectation-maximization (EM) algorithm. Although preferable to leaving students in a state of ignorance, such brief expositions ultimately fail to expose the full body of relevant techniques. Some of these techniques extend more readily to high-dimensional data problems than Newton's method and scoring. The current paper emphasizes block ascent and descent, profile likelihoods, the minorization-maximization (MM) principle, and their creative combination. These themes are put to work in readable Julia code to solve several MLE problems. [ABSTRACT FROM AUTHOR]
Copyright of American Statistician is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)*