Rethinking Curriculum Learning with Incremental Labels and Adaptive Compensation
Not on the map. Why?
Abstract (arXiv)
Like humans, deep networks have been shown to learn better when samples are organized and introduced in a meaningful order or curriculum. Conventional curriculum learning schemes introduce samples in their order of difficulty. This forces models to begin learning from a subset of the available data while adding the external overhead of evaluating the difficulty of samples. In this work, we propose Learning with Incremental Labels and Adaptive Compensation (LILAC), a two-phase method that incrementally increases the number of unique output labels rather than the difficulty of samples while consistently using the entire dataset throughout training. In the first phase, Incremental Label Introduction, we partition data into mutually exclusive subsets, one that contains a subset of the ground-truth labels and another that contains the remaining data attached to a pseudo-label. Throughout the training process, we recursively reveal unseen ground-truth labels in fixed increments until all the labels are known to the model. In the second phase, Adaptive Compensation, we optimize the loss function using altered target vectors of previously misclassified samples. The target vectors of such samples are modified to a smoother distribution to help models learn better. On evaluating across three standard image benchmarks, CIFAR-10, CIFAR-100, and STL-10, we show that LILAC outperforms all comparable baselines. Further, we detail the importance of pacing the introduction of new labels to a model as well as the impact of using a smooth target vector.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2.
4 papers.
- 2021Curriculum Learning: A Surveycited by 259
- 2021Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learningcited by 35
- 2022PCC: Paraphrasing with Bottom-k Sampling and Cyclic Learning for Curriculum Data Augmentationcited by 14
- 2022Q-TART: Quickly Training for Adversarial Robustness and in-Transferabilitycited by 0
- 2022PCC: Paraphrasing with Bottom-k Sampling and Cyclic Learning for Curriculum Data Augmentation17 Aug 2022
- 2022Q-TART: Quickly Training for Adversarial Robustness and in-Transferability14 Apr 2022
- 2021Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learning12 Mar 2021
- 2021Curriculum Learning: A Survey25 Jan 2021