curriculum learning
In plain wordsTeaching a model the way schools teach people: starting with easy examples and gradually moving to harder ones, instead of presenting everything in random order.
A training strategy that controls what the learner sees when, starting with easy examples and moving to harder ones or gradually shifting the data mixture toward the target task, instead of sampling uniformly at random. Difficulty can be defined by hand (shorter sentences, cleaner images, simpler math problems), by a teacher model's loss, or by the learner itself (self-paced learning admits examples as its own loss on them falls); automatic curricula adapt the mixture online, for example by sampling tasks where learning progress is fastest. Its namers, Yoshua Bengio and colleagues, expected faster convergence and, on non-convex problems, better optima, as with continuation methods that solve a smoothed problem first. Evidence is mixed: careful studies of standard supervised benchmarks often find little gain over random ordering, but curricula matter in reinforcement learningreinforcement learning, n.: A way of teaching a computer program by trial and error: it tries actions, earns points for good results and penalties for bad ones, and gradually learns which choices pay off over time., where agents may never see a reward on hard tasks (sparse rewardssparse reward, n.: A situation in which an AI agent gets feedback only rarely — say, only when it finally wins — so it has almost nothing to learn from until it stumbles on success.), and in language-model training, where late shifts toward higher-quality or harder data (annealingannealing, n.: The last stretch of training, when the model's learning is slowed to a stop — often while it is fed a small helping of the best data — so it settles into its final, sharpest version., mid-trainingmid-training, n.: A middle stage in building a language model, between its broad initial training and its tuning into an assistant: it keeps learning the same way, but from a smaller, carefully chosen diet of math, code, reasoning or long documents.) and difficulty-filtered problem sets in RL post-training act as curricula.
Origin
Jeffrey Elman's 'Learning and development in neural networks: the importance of starting small' (Cognition, 1993) argued for incremental training of recurrent networks. Yoshua Bengio, Jérôme Louradour, Ronan Collobert and Jason Weston named and formalized curriculum learning at ICML 2009, citing shaping in animal training; M. Pawan Kumar and colleagues introduced self-paced learning in 2010.
Related
- data mixturedata mixture, n.: The recipe of different kinds of data a model is trained on — how much web text, code, books, math, science and other languages — which strongly shapes what the finished model is good at.
- annealingannealing, n.: The last stretch of training, when the model's learning is slowed to a stop — often while it is fed a small helping of the best data — so it settles into its final, sharpest version.
- mid-trainingmid-training, n.: A middle stage in building a language model, between its broad initial training and its tuning into an assistant: it keeps learning the same way, but from a smaller, carefully chosen diet of math, code, reasoning or long documents.
- reward shapingreward shaping, n.: Adding extra hints to an AI agent's scoring — small rewards for steps in the right direction — so it learns faster than it would from the final outcome alone.
- sparse rewardsparse reward, n.: A situation in which an AI agent gets feedback only rarely — say, only when it finally wins — so it has almost nothing to learn from until it stumbles on success.
- active learningactive learning, n.: A way to train a model with fewer labeled examples by letting it choose which unlabeled examples a person should label next, usually the ones it is most unsure about.
Sources
- Bengio, Y., Louradour, J., Collobert, R. & Weston, J. (2009). Curriculum Learning. ICML 2009.
- Elman, J. L. (1993). Learning and development in neural networks: the importance of starting small. Cognition 48(1), 71–99.
- Wu, X., Dyer, E. & Neyshabur, B. (2021). When Do Curricula Work? ICLR 2021.
Mentioned in
self-playself-play, n.: Training an AI by having it play against copies of itself, so it always has an opponent at its own level and can keep improving without human examples., sparse rewardsparse reward, n.: A situation in which an AI agent gets feedback only rarely — say, only when it finally wins — so it has almost nothing to learn from until it stumbles on success., reward shapingreward shaping, n.: Adding extra hints to an AI agent's scoring — small rewards for steps in the right direction — so it learns faster than it would from the final outcome alone.