Core ML Concepts · advanced · concept 47 of 311 · Updated Nov 4, 2026
Data Hardness and Example Difficulty
Data hardness is how difficult an example, or a whole dataset, is for a model to learn. It is scored from training dynamics: how often an example is forgotten, how confident and variable its predictions are across epochs (Data Maps), or how large its early error is (EL2N, GraNd). Hard examples carry most of the signal, yet the hardest are often mislabeled. Sorscher et al. showed that pruning easy examples can beat power-law scaling.
Top AI contributors on this
- Michael I. JordanInria Paris / UC Berkeley (emeritus)
- John HopfieldPrinceton University (emeritus)
- Cassie KozyrkovIndependent (formerly Google)
- Chelsea FinnStanford University / Physical Intelligence
- Daphne Kollerinsitro
- Sébastien BubeckOpenAI
Key terms
Learn these first
Where you meet it in the real world
Pruning training sets, finding mislabeled examples, ordering curricula, choosing which examples to label next, judging benchmark difficulty
Videos
Introduction to Data-Centric AI · YouTube
IVADO · YouTube
Introduction to Data-Centric AI · YouTube
Guides and articles
Courses, papers, and more