mlsanityData to 7 Oct 2026

Exponential convergence of testing error for stochastic gradient methods

arXiv 1712.04755 ↗First posted 13 Dec 2017cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

We consider binary classification problems with positive definite kernels and square loss, and study the convergence rates of stochastic gradient methods. We show that while the excess testing loss (squared loss) converges slowly to zero as the number of observations (and thus iterations) goes to infinity, the testing error (classification error) converges exponentially fast if low-noise conditions are assumed.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Dec 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 6; 2023: 3; 2024: 1; 2025: 1; 2026: 1.

13 papers.

Sort: