A dual-anchor stochastic root-finding algorithm achieves O(epsilon^{-3}) oracle complexity with constant mini-batching and no variance reduction for cocoercive operators.
Bot ¸ and Enis Chenchene
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization
A dual-anchor stochastic root-finding algorithm achieves O(epsilon^{-3}) oracle complexity with constant mini-batching and no variance reduction for cocoercive operators.