atlas

Research map / Optimization / Implicit bias and generalization

Algorithmic Stability of Heavy-Tailed SGD with General Loss Functions

ICML 2023 · Optimization › Implicit bias and generalization · approach: SGD noise and flat minima · 2 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 a dissipativity-based pseudo-Lipschitz stability analysis of heavy-tailed SDEs to derive Wasserstein stability bounds for general (possibly non-convex) losses instead of only quadratic lossesheavy-tailed SGD SDE (alpha-stable Levy-driven) · theoretical generalization boundgeneralization bound orderNo clear effect
Increase tail heaviness (smaller alpha) in the stability bound constant g(alpha;d) for large dimension dWasserstein stability bound / generalization bound · theoretical analysis, dimension d >= d_0bound behavior in alphaMixed
Euler-Maruyama discretization with sufficiently small step-size applied to the heavy-tailed SDEdiscrete-time heavy-tailed SGD proxy · theoretical stability boundW1 discretization error orderNo 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