Stochastic Majorization-Minimization Algorithms for Large-Scale Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Stochastic Majorization-Minimization Algorithms for Large-Scale Optimization


Majorization-minimization algorithms consist of iteratively minimizing a majorizing surrogate of an objective function. Because of its simplicity and its wide applicability, this principle has been very popular in statistics and in signal processing. In this paper, we intend to make this principle scalable. We introduce a stochastic majorization-minimization scheme which is able to deal with large-scale or possibly infinite data sets. When applied to convex optimization problems under suitable assumptions, we show that it achieves an expected convergence rate of $O(1/\sqrt{n})$ after $n$ iterations, and of $O(1/n)$ for strongly convex functions. Equally important, our scheme almost surely converges to stationary points for a large class of non-convex problems. We develop several efficient algorithms based on our framework. First, we propose a new stochastic proximal gradient method, which experimentally matches state-of-the-art solvers for large-scale $\ell_1$-logistic regression. Second, we develop an online DC programming algorithm for non-convex sparse estimation. Finally, we demonstrate the effectiveness of our approach for solving large-scale structured matrix factorization problems.
Fichier principal
Vignette du fichier
main_with_appendices.pdf (403.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00835840 , version 1 (19-06-2013)
hal-00835840 , version 2 (10-09-2013)



Julien Mairal. Stochastic Majorization-Minimization Algorithms for Large-Scale Optimization. NIPS 2013 - Advances in Neural Information Processing Systems, Dec 2013, South Lake Tahoe, United States. pp.2283-2291. ⟨hal-00835840v2⟩
664 View
2560 Download



Gmail Facebook X LinkedIn More