Α-EM Algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 518 bytes +518‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n+r)$? words (Stores current theta and Z guesses, which is updated each iteration. Also assumes description of alpha-log-likelihood takes O(n+r) auxiliary space.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 2003 == Reference == https://waseda.pure.elsevier.com/en/publications/the-%CE%B1-em-algorithm-surrogat..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Α-EM_Algorithm_(Maximum_Likelihood_Methods_in_Unknown_Latent_Variables_Maximum_Likelihood_Methods_in_Unknown_Latent_Variables)"