atlas

Research map / Optimization / Implicit bias and generalization

Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization

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

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 stochastic mirror descent with a step size making ψ(w) − ηLᵢ(w) convexStochastic mirror descent · General nonlinear models and loss functions, minimax problemoptimal minimax value: 1Helped
Use SGD with step size 0 < η ≤ minᵢ 1/||xᵢ||²SGD · Linear models with square loss, minimax problemoptimal minimax value: 1Helped
Choose the mirror potential ψ to encode a desired regularizerStochastic mirror descent · Over-parameterized linear modelsdistance to the selected regularized solutionHelped
Use ψ(w) = ||w||₁.₁ as the mirror potentialStochastic mirror descent · Compressed sensing (n=50, m=100, sparsity k=10)iterations to recover the sparse solution: around 10,000 iterationsHelped

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