On rates of convergence for sample average approximations without smoothness
Hien Duy Nguyen, Jacob Westerhout, Xin Guo

TL;DR
This paper develops a convergence rate theory for sample average approximation in stochastic optimization without requiring smoothness or continuity assumptions, applicable to various complex models.
Contribution
It extends SAA convergence analysis to non-smooth, discontinuous, and non-Lipschitz settings using a tame-topological framework, broadening applicability.
Findings
Uniform control of empirical processes yields convergence rates for optimal values.
Weak limits for empirical optimal values are established at the n^{-1/2} scale.
Framework applies to classification, neural networks, and non-Lipschitz objectives.
Abstract
Sample average approximation (SAA) replaces an intractable expected objective by an empirical average and is a basic device of modern stochastic optimization. We develop a rate theory for optimal values and empirical -minimizers that does not assume continuity, lower semicontinuity, or smooth perturbation structure of the sample objectives. Working on with the Hoffmann--J{\o}rgensen outer-probability formalism, we show that uniform control of the empirical objective process transfers deterministically to convergence rates for optimal values, excess risks of empirical -minimizers, and, under a sharp-growth condition, distances to the expected objective solution set. Combined with the directional differentiability of the infimum functional, this yields weak limits for empirical optimal values at the scale. Combined with LILs and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
