Level Up: Defining and Exploiting Transitional Problems for Curriculum Learning
Zhenwei Tang, Amogh Inamdar, Ashton Anderson, Richard Zemel

TL;DR
This paper introduces a new method for curriculum learning that measures problem difficulty relative to a model's ability, enabling more effective, interpretable, and learner-specific training sequences, demonstrated on chess and mathematics tasks.
Contribution
A novel difficulty measurement approach that identifies transitional problems for curriculum learning, improving training efficiency and model competence progression.
Findings
Curriculum from easier to harder transitional problems enhances learning efficiency.
The method produces interpretable and learner-specific curricula.
Outperforms existing static and dynamic difficulty strategies.
Abstract
Curriculum learning--ordering training examples in a sequence to aid machine learning--takes inspiration from human learning, but has not gained widespread acceptance. Static strategies for scoring item difficulty rely on indirect proxy scores of varying quality and produce curricula that are not specific to the learner at hand. Dynamic approaches base difficulty estimates on gradient information, requiring considerable extra computation during training. We introduce a novel method for measuring the difficulty of individual problem instances directly relative to the ability of a given model, and identify transitional problems that are consistently easier as model ability increases. Applying this method to chess and mathematics, we find that training on a curriculum that "levels up" from easier to harder transitional problems most efficiently improves a model to the next tier of…
Peer Reviews
Decision·Submitted to ICLR 2026
- Novel approach to define sample difficulty, motivated by concepts from developmental psychology - The experiments designed to test the "leveling up" hypothesis for a single $i$ -> $i+1$ step are compelling.
- The paper proves efficiency for single-step transitions but fails to provide any evidence that chaining these steps leads to a globally optimal or more efficient training process for achieving the best possible final model. - The evaluation framework is self-referential. Showing that training on "level $k$ problems" makes a model better at "level $k$ problems" is an expected result and not a convincing demonstration of improved general task competence. - The method requires an existing pre-tra
1. The idea of “leveling up” through transitional problems is intuitively compelling and well-motivated. The introduction of transitional problems as a means to measure difficulty relative to model competence is novel. It reframes curriculum learning around model-centric difficulty rather than human intuition. 2. The diagrams (especially Figure 1 and Figure 2) clearly convey the central idea and experimental setup, which help intuitively understand how transitional problems are defined and appl
1. While the paper’s model-centric notion of difficulty is novel, it remains empirically motivated. It would strengthen the contribution to show why this definition is theoretically advantageous over other model-based measures (e.g., gradient norm, loss change, or C-score). Currently, the argument for why this formulation is superior is mostly intuitive rather than analytical or empirical. 2. Constructing a model series satisfying Definition 1 (monotonic increasing strength) is non-trivial in g
1. The paper proposes a clear and original way to define task difficulty based on the model’s actual capability, instead of relying on human judgment or handcrafted heuristics. This directly addresses a long-standing issue in curriculum learning. 2. The approach is validated in two very different domains, chess and math reasoning, and shows consistent improvements in both. 3. The experimental setup is well controlled. The comparison between ascending curriculum, i.i.d training, and reverse curri
1. Practical constraints in defining transitional problems * The approach relies on the existence of a strictly stronger model in order to identify transitional problems. This requirement limits its practicality, as it introduces a non-trivial upfront cost. In effect, the method assumes that one must first perform a less efficient stage of training in order to later enable more efficient learning, which creates an inherent paradox. 2. Limited scale and stability in the math experiments * While t
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Intelligent Tutoring Systems and Adaptive Learning · Machine Learning and Data Classification
