mlsanityData to 7 Oct 2026

The Implicit Bias of AdaGrad on Separable Data

arXiv 1906.03559 ↗First posted 9 Jun 2019stat.ML cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

We study the implicit bias of AdaGrad on separable linear classification problems. We show that AdaGrad converges to a direction that can be characterized as the solution of a quadratic optimization problem with the same feasible set as the hard SVM problem. We also give a discussion about how different choices of the hyperparameters of AdaGrad might impact this direction. This provides a deeper understanding of why adaptive methods do not seem to have the generalization ability as good as gradient descent does in practice.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Jun 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

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

15 papers.

Sort: