EPISODE · May 16, 2013 · 1H 6M
Learning with the Online EM Algorithm (Olivier Cappé)
from StatLearn 2013 - Workshop on "Challenging problems in Statistical Learning" · host UP1 Service TICE
The Online Expectation-Maximization (EM) is a generic algorithm that can be used to estimate the parameters of latent data models incrementally from large volumes of data. The general principle of the approach is to use a stochastic approximation scheme, in the domain of sufficient statistics, as a proxy for a limiting, deterministic, population version of the EM recursion. In this talk, I will briefly review the convergence properties of the method and discuss some applications and extensions of the basic approach.
Embed this episode
Ready to play
Learning with the Online EM Algorithm (Olivier Cappé)
No transcript for this episode yet
Similar Episodes
No similar episodes found.