The knee-jerk mapping

Simple item page
dc.creatorDoyle, Peter G.
dc.creatorReeds, Jim
dc.date2006-06-02
dc.date.accessioned2026-07-07T08:07:53Z
dc.date.available2026-07-07T08:07:53Z
dc.descriptionWe 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'.
dc.descriptionVersion dated 5 October 1998. Freely redistributable (GNU FDL)
dc.identifierhttps://arxiv.org/abs/math/0606068
dc.identifierhttp://arxiv.org/abs/math/0606068
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131080
dc.subjectProbability
dc.subjectStatistics Theory
dc.subject60J22; 65C40; 49M29
dc.titleThe knee-jerk mapping
dc.typetext

Files

Collections

arXiv