The knee-jerk mapping
classification
🧮 math.PR
math.STstat.TH
keywords
knee-jerkmappingalgorithmalgorithmsbasisbaumcallclaim
read the original abstract
We claim to give the definitive theory of what we call the `knee-jerk mapping', which is the basis for a class of optimization algorithms introduced by Baum, and promoted by Dempster, Laird, and Rubin under the name `EM algorithm'.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.