Stochastic optimization over proximally smooth sets
Damek Davis, Dmitriy Drusvyatskiy, Zhan Shi
TL;DR
The paper develops a comprehensive framework for stochastic optimization of weakly convex functions over proximally smooth constraint sets, extending model-based stochastic methods beyond convex feasibility. By combining stochastic models, locally defined set approximations, and retractions back to the original set, it obtains finite-time guarantees via the Moreau envelope and a proximal-stationarity measure. The authors provide two concrete instantiations—tangent-space (Riemannian) approximations for manifolds and inner approximations for functional constraints—along with rigorous proofs of convergence under suitable regularity and error-bound conditions. This work bridges nonsmooth stochastic optimization with nonconvex constraint geometry, enabling tractable, provably efficient algorithms for optimization over manifolds and nonconvex constraint sets with weakly convex objectives.
Abstract
We introduce a class of stochastic algorithms for minimizing weakly convex functions over proximally smooth sets. As their main building blocks, the algorithms use simplified models of the objective function and the constraint set, along with a retraction operation to restore feasibility. All the proposed methods come equipped with a finite time efficiency guarantee in terms of a natural stationarity measure. We discuss consequences for nonsmooth optimization over smooth manifolds and over sets cut out by weakly-convex inequalities.
