The Lebesgue measure of ε-forging sets decays as O(ε) or ε^d for linear models and as ε^{(d-r)/2} under mild regularity assumptions, with vanishing probability of random sampling.
Stochastic subgradient method converges at the rate $O(k^{-1/4})$ on weakly convex functions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We prove that the proximal stochastic subgradient method, applied to a weakly convex problem, drives the gradient of the Moreau envelope to zero at the rate $O(k^{-1/4})$. As a consequence, we resolve an open question on the convergence rate of the proximal stochastic gradient method for minimizing the sum of a smooth nonconvex function and a convex proximable function.
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Measure of Deception: An Analysis of Data Forging in Machine Unlearning
The Lebesgue measure of ε-forging sets decays as O(ε) or ε^d for linear models and as ε^{(d-r)/2} under mild regularity assumptions, with vanishing probability of random sampling.