Conditions for optimality of easy-to-hard curricula
Determine the conditions under which an easy-to-hard curriculum—i.e., training protocols that present examples in increasing order of difficulty—achieves optimal final generalization performance, and characterize alternative difficulty schedules that outperform the easy-to-hard ordering when those conditions are not met.
References
In particular, it remains unclear under what conditions an easy-to-hard curriculum is truly optimal and what alternative strategies might outperform it when it is not.
We intentionally constrain most of the study to from-scratch training and newly constructed tasks, reducing confounding from pretrained knowledge but leaving open how the results transfer to pretrained settings, natural data, and tasks whose difficulty structure interacts with prior knowledge.
Whether it had also stopped improving is not established here.