QOP achieves (ε, δ)-differential privacy for ERM in the interpolation regime under weaker assumptions than linear objective perturbation by using random quadratic curvature to enforce stability and control sensitivity.
Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We investigate the Stochastic Krasnoselskii-Mann iterations for expected nonexpansive fixed-point problems in a real Hilbert space. We establish convergence guarantees under significantly weaker assumptions on the variance than those typically used in the literature. In particular, instead of a uniform bound on the variance of the stochastic oracle, we only assume finite variance at a single fixed point. Under this assumption, we prove almost sure weak convergence of the iterates, derive convergence rates for the expected residual, and obtain almost sure convergence rates for the running minimum residual. Notably, we recover the best-known stochastic oracle complexity without imposing uniformly bounded variance. We illustrate the applicability of our results to Stochastic Gradient Descent, where we recover known guarantees, and to Stochastic Three-Operator Splitting, for which we obtain the first results that avoid uniform variance bounds.
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quadratic Objective Perturbation: Curvature-Based Differential Privacy
QOP achieves (ε, δ)-differential privacy for ERM in the interpolation regime under weaker assumptions than linear objective perturbation by using random quadratic curvature to enforce stability and control sensitivity.