arrow
Return

Sequential Sample Average Majorization-Minimization

delete2025-12-01
delete0
PRE
AI
G
Gersende Fort *
F
Florence Forbes
H
Hien D. Nguyen
DOI:10.1007/s11222-025-10780-xdelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Many statistical inference and machine learning methods rely on the ability to optimize an expectation functional, whose explicit form is intractable. The typical method for conducting such optimization is to approximate the expected value problem by a size-N sample average, often referred to as Sample Average Approximation (SAA) or M-estimation. When the solution to the SAA problem cannot be obtained in closed form, the Majorization-Minimization (MM) algorithm framework constitutes a broad class of incremental optimization solutions, relying on the iterative construction of surrogates, known as majorizers, of the original problem. The ability to solve an SAA problem depends on the availability of all N observations, contemporaneously, which is difficult when N is large or data are observed as a stream. We propose a stochastic MM algorithm that solves the expected value problem via iterative SAA majorizer constructions using sequential subsets of data, which we call Sequential Sample Average Majorization-Minimization (SAM2). Compared to previous stochastic MM algorithm variants, our method permits an extended definition of majorizers, and does not rely on convexity assumptions, smoothness assumptions, or restrictions on functional classes for objectives and majorizers. We develop a theory of stochastic convergence for SAM2, made possible via the presentation of a novel double array uniform strong law of large numbers. Examples of SAM2 algorithms are given along with a numerical demonstration of SAM2 to quantile regression problems, in the regular and sparse parameter settings, including both convex and non-convex objective functions.
Keywords:
Majorization-Minimization Algorithms
Sample average approximation
Non-convex optimization
Stochastic optimization
Quantile regression

Journal

S
Statistics and Computing
IF:
1.6
Papers:
200
Citations:
0

Organization

C
centre national de la recherche scientifique (cnrs)
Scholars:
24.5W
Papers: 18.2W
Citations: 279
U
universite de toulouse
Scholars:
3.5W
Papers: 2.7W
Citations: 37
Cited Papers

Cited Papers

Iterative Optimization in Inverse Problems
err
IF0
err2014-02-12
err0
PREAI
errCharles Byrne
errShare
errSave
errShare
errSave
Weak Convergence and Empirical Processes
err2023-01-01
err0
errOAAI
errA. W. van der Vaart; Jon A. Wellner
errShare
errSave
An Online Minorization-Maximization Algorithm
err2023-01-01
err0
PREAI
errNguyen,Hien Duy; Forbes,Florence; Fort,Gersende; Cappé,Olivier
errShare
errSave
researcher View more