Timezone: »

 
Poster
On the Global Convergence of (Fast) Incremental Expectation Maximization Methods
Belhal Karimi · Hoi-To Wai · Eric Moulines · Marc Lavielle

Tue Dec 10 05:30 PM -- 07:30 PM (PST) @ East Exhibition Hall B + C #30
in Algorithms -- Large Scale Learning »

The EM algorithm is one of the most popular algorithm for inference in latent data models. The original formulation of the EM algorithm does not scale to large data set, because the whole data set is required at each iteration of the algorithm. To alleviate this problem, Neal and Hinton [1998] have proposed an incremental version of the EM (iEM) in which at each iteration the conditional expectation of the latent data (E-step) is updated only for a mini-batch of observations. Another approach has been proposed by Cappe and Moulines [2009] in which the E-step is replaced by a stochastic approximation step, closely related to stochastic gradient. In this paper, we analyze incremental and stochastic version of the EM algorithm as well as the variance reduced-version of [Chen et al., 2018] in a common unifying framework. We also introduce a new version incremental version, inspired by the SAGA algorithm by Defazio et al. [2014]. We establish non-asymptotic convergence bounds for global convergence. Numerical applications are presented in this article to illustrate our findings.

Keywords: Non-Convex Optimization · Optimization · Stochastic Optimization · Algorithms -> Large Scale Learning; Algorithms -> Missing Data; Optimization
[ Paper]  [ Slides] 

Author Information

Belhal Karimi (Ecole Polytechnique)
Hoi-To Wai (The Chinese University of Hong Kong)
Eric Moulines (Ecole Polytechnique)
Marc Lavielle (Inria & Ecole Polytechnique)

More from the Same Authors