Prioritized training on points that are learnable, worth learning, and not yet learned (workshop version)
S\"oren Mindermann, Muhammed Razzak, Winnie Xu, Andreas Kirsch,, Mrinank Sharma, Adrien Morisot, Aidan N. Gomez, Sebastian Farquhar, Jan, Brauner, Yarin Gal

TL;DR
Goldilocks Selection is a novel training point selection method that uses an information-theoretic approach to identify data points that are optimally informative for model training, leading to faster and more effective learning.
Contribution
The paper introduces Goldilocks Selection, an efficient, transferable data selection technique based on reducible validation loss for improved model training.
Findings
Outperforms traditional hard and easy point selection methods
Selects data points that are most informative for validation set
Transferable sequence of training points across architectures
Abstract
We introduce Goldilocks Selection, a technique for faster model training which selects a sequence of training points that are "just right". We propose an information-theoretic acquisition function -- the reducible validation loss -- and compute it with a small proxy model -- GoldiProx -- to efficiently choose training points that maximize information about a validation set. We show that the "hard" (e.g. high loss) points usually selected in the optimization literature are typically noisy, while the "easy" (e.g. low noise) samples often prioritized for curriculum learning confer less information. Further, points with uncertain labels, typically targeted by active learning, tend to be less relevant to the task. In contrast, Goldilocks Selection chooses points that are "just right" and empirically outperforms the above approaches. Moreover, the selected sequence can transfer to other…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Machine Learning and Data Classification · Adversarial Robustness in Machine Learning
