AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Fast Equilibrium of SGD in Generic Situations

Zhiyuan Li, Yi Wang, Zhiren Wang

ICLR 2024 · Learning theory and algorithms › Sample complexity · approach: Robust and surrogate-loss learning bounds

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies the Fast Equilibrium conjecture for SGD on scale-invariant normalized networks, proving that equilibrium is reached in roughly O~(1/(eta*lambda)) steps under generic conditions.

Problem

Normalization layers make networks scale-invariant, and training with SGD, learning rate eta and weight decay lambda, has unexpected dynamics; the Fast Equilibrium conjecture (Li et al., 2020) claims mixing to equilibrium in about O~(1/(eta*lambda)) steps.

Approach

Analyzes the mixing time of SGD with weight decay on scale-invariant normalized networks in generic situations, providing support for the Fast Equilibrium conjecture rather than relying on the specific setting studied earlier. Details beyond the abstract are not confirmed here.

Experimental setup

Builds on: Fast Equilibrium conjecture (Li et al., 2020)

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