Niko Brümmer
Published 2014-01-24Version 1
The Laplace approximation calls for the computation of second derivatives at the likelihood maximum. When the maximum is found by the EM-algorithm, there is a convenient way to compute these derivatives. The likelihood gradient can be obtained from the EM-auxiliary, while the Hessian can be obtained from this gradient with the Pearlmutter trick.
Transformers versus the EM Algorithm in Multi-class Clustering
Relaxation of the EM Algorithm via Quantum Annealing for Gaussian Mixture Models
Global Convergence of EM Algorithm for Mixtures of Two Component Linear Regression
![QR code for arXiv:1401.6276 [stat.ML]](http://oss.arxitics.com/images/favicon.svg)