Sharp Minima Can Generalize: A Loss Landscape Perspective On Data

Raymond Fan, Bryce Sandlund, Lin Myat Ko
11/6/2025
cs.LG

No confident code implementation found for this paper.

Abstract

The volume hypothesis suggests deep learning is effective because it is likely to find flat minima due to their large volumes, and flat minima generalize well. This picture does not explain the role of large datasets in generalization. Measuring minima volumes under varying amounts of training data reveals sharp minima which generalize well exist, but are unlikely to be found due to their small volumes. Increasing data changes the loss landscape, such that previously small generalizing minima become (relatively) large.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{fan2025sharp,
  title  = {Sharp Minima Can Generalize: A Loss Landscape Perspective On Data},
  author = {Raymond Fan and Bryce Sandlund and Lin Myat Ko},
  year   = {2025},
  eprint = {2511.04808},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.04808v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.04808.svg)](https://codeofpaper.com/paper/2511.04808)

Discussion