The DOI matches its Crossref record; 204 of the 204 references it cites were found in a registry or an index.
Curriculum Learning: A Survey
Open accessAbstract
Training machine learning models in a meaningful order, from the easy samples to the hard ones, using curriculum learning can provide performance improvements over the standard training approach based on random data shuffling, without any additional computational costs. Curriculum learning strategies have been successfully employed in all areas of machine learning, in a wide range of tasks. However, the necessity of finding a way to rank the samples from easy to hard, as well as the right pacing function for introducing more difficult data can limit the usage of the curriculum approaches. In this survey, we show how these limits have been tackled in the literature, and we present different curriculum learning instantiations for various tasks in machine learning. We construct a multi-perspective taxonomy of curriculum learning approaches by hand, considering various classification criteria. We further build a hierarchical tree of curriculum learning methods using an agglomerative clustering algorithm, linking the discovered clusters with our taxonomy. At the end, we provide some interesting directions for future work.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Items 201–204 of 204
The Balanced Loss Curriculum Learning
Qin, W., Hu, Z., Liu, X., Fu, W., He, J., & Hong, R. (2020) · IEEE Access · doi:10.1109/access.2020.2970726 · Cited by 4
FSPMTL: Flexible Self-Paced Multi-Task Learning
Sun, L., & Zhou, Y. (2020) · IEEE Access · doi:10.1109/access.2020.3009988 · Cited by 4
Automatic Curriculum Generation by Hierarchical Reinforcement Learning
He, Z., Gu, C., Xu, R. X., & Wu, K. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-63833-7_17 · Cited by 3
Low-Budget Unsupervised Label Query through Domain Alignment Enforcement
Almeida, J., Saltori, C., Rota, P., & Sebe, N. (2020) · Cited by 1
Self-citation
Cited by
A Survey on Safety-Critical Driving Scenario Generation—A Methodological Perspective
Ding, W., Xu, C., Arief, M., Lin, H., Li, B., & Zhao, D. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3259322 · Cited by 264
Agentic Large Language Models, a Survey
Plaat, A., Van Duijn, M., Van Stein, N., Preuss, M., Van der Putten, P., & Batenburg, K. J. (2025) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.18675 · Cited by 75
Digital Twin-based Anomaly Detection with Curriculum Learning in Cyber-physical Systems
Xu, Q., Ali, S., & Yue, T. (2023) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3582571 · Cited by 49
Curriculum learning for language modeling
Campos, D. (2021) · arXiv · doi:10.48550/arxiv.2108.02170 · Cited by 15
(2023) · doi:10.18653/v1/2023.emnlp-main.824 · Cited by 4
Metadata
- Authors
- Soviany, P., Ionescu, R. T., Rota, P., & Sebe, N.
- Venue
- International Journal of Computer Vision
- Published
- 2022-04-19
- Volume
- 130
- Issue
- 6
- Pages
- 1526-1565
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W3123742938
- Cited by
- 431
- References
- 204
- FWCI
- 26.17
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.