AI Paper Atlas

Research map / Optimization / Implicit bias and generalization

How to Escape Sharp Minima with Random Perturbations

ICML 2024 · Optimization › Implicit bias and generalization · approach: Sharpness-aware minimization theory · 0 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 Sharpness-Aware Perturbation instead of Randomly Smoothed Perturbationflat-minimum finding algorithms · Training lossiterations to find a flat minimum: d\epsilon^{-1} \min\{ 1, \epsilon d^3\} times larger than the decreaseHelped
use stochastic gradients for the outer perturbation instead of full-batch gradients (ablation)Sharpness-Aware Perturbation · Training losstrace of Hessian decrease: d times larger gradientHelped
use batch size 1 instead of batch size 64 or 128 (ablation)Sharpness-Aware Perturbation · CIFAR10escape from sharp minimaHelped
use Sharpness-Aware Perturbation instead of Randomly Smoothed PerturbationResNet-18 · CIFAR10escape from sharp minimaHelped

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