A unified recursion framework for stochastic variance-reduced estimation yields high-probability bounds and the first Õ(ε^{-3}) oracle complexity for stochastic optimization with expectation constraints.
A single-loop spider-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
MoSSP is a new single-loop stochastic penalty method with Polyak or recursive momentum that achieves O(ε^{-4}) or O(ε^{-3}) oracle complexity for stochastic ε-KKT points in nonconvex constrained DC-regularized problems.
Develops a smoothing extension of ESQM for DC optimization over convex composite inequality constraints, proving O(ε^{-3}) iteration complexity to (ε,ε)-KKT points plus convergence in the convex case.
citing papers explorer
-
Unified High-Probability Analysis of Stochastic Variance-Reduced Estimation
A unified recursion framework for stochastic variance-reduced estimation yields high-probability bounds and the first Õ(ε^{-3}) oracle complexity for stochastic optimization with expectation constraints.