Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps
The lower bound holds against any randomized algorithm that succeeds with constant probability and extends to settings with ``sparse''noise, ruling out the possibility of improving oracle complexity as a function of $\varepsilon$ by measuring variance in a non-matching $\ell_p$ norm.
Jelena Diakonikolas, Cristóbal Guzmán, David Martínez-Rubio
· 0 citations