Overview

Flat-minima research studies how the shape of a model’s loss landscape relates to what it learns, including its ability to generalize, resist perturbations, and adapt across tasks. Methods such as sharpness-aware minimization (SAM), Hessian-based regularization, and geometry-aware perturbations try to steer training toward flatter solutions; theory also examines how SGD noise, learning rates, and batch size shape the minima it reaches. Work spans neural-network theory and practical settings such as federated learning, fine-tuning, and vision tasks. A central open question is whether flatness reliably predicts generalization: parameter symmetries and task differences can make common measures misleading, and flatter solutions do not always perform better.

Latest papers

CardsList

34 papers2 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.

  1. Sharpness of Minima in Deep Matrix Factorization

    Sep 30, 2025Anil Kamber, Rahul ParhiLoss Landscape SharpnessMatrix Factorization

  2. On the Escaping Efficiency of Distributed Adversarial Training Algorithms

    Sep 14, 2025Ying Cao, Kun Yuan, Ali H. SayedAdversarial TrainingAdversarial Robustness

  3. Bilateral Sharpness-Aware Minimization for Flatter Minima

    Sep 20, 2024Jiaxin Deng, Junbiao Pang, Baochang Zhang +1Sharpness-Aware MinimizationNeural Network Generalization