RAAS delivers high-probability stopping-time complexity bounds for strongly convex and general convex optimization by using tunable momentum in adaptive search under bounded-moment stochastic oracles.
Convergence analysis of accelerated stochastic gradient descent under the growth condition.Mathematics of Operations Research, 49(4):2492–2526, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles
RAAS delivers high-probability stopping-time complexity bounds for strongly convex and general convex optimization by using tunable momentum in adaptive search under bounded-moment stochastic oracles.