AI Paper Atlas

Research map / Optimization / Implicit bias and generalization

Implicit Regularization of Accelerated Methods in Hilbert Spaces

Nicolò Pagliana, Lorenzo Rosasco

NeurIPS 2019 · Optimization › Implicit bias and generalization · approach: Implicit regularization of SGD · 7 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use acceleration instead of gradient descentLinear least-squares Hilbert-space learning, attainable case · Attainable caseexcess risk upper bound: 1/t + t/n -> 1/t^2 + t^2/nMixed
Use accelerated methods with the stopping rule t^{acc}=O(n^{1/4}) instead of gradient descent with t^{GD}=O(n^{1/2})Linear least-squares Hilbert-space learning, attainable case · Attainable caselearning rate: both algorithms have learning rate of order 1/√nImproved
Use acceleration instead of gradient descentLinear least-squares Hilbert-space learning, general regularity · General regularity with source exponent r and effective-dimension exponent γexcess risk upper bound: 1/t^{2r} + t^{1/γ}/n -> 1/t^{4r} + t^{2/γ}/nMixed
Use gradient descent rather than accelerationEasy problems with large source regularity · Easy problems (large r)learning accuracyNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy