The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Self-Paced Curriculum Learning
Open accessAbstract
Curriculum learning (CL) or self-paced learning (SPL) represents a recently proposed learning regime inspired by the learning process of humans and animals that gradually proceeds from easy to more complex samples in training. The two methods share a similar conceptual learning paradigm, but differ in specific learning schemes. In CL, the curriculum is predetermined by prior knowledge, and remain fixed thereafter. Therefore, this type of method heavily relies on the quality of prior knowledge while ignoring feedback about the learner. In SPL, the curriculum is dynamically determined to adjust to the learning pace of the leaner. However, SPL is unable to deal with prior knowledge, rendering it prone to overfitting. In this paper, we discover the missing link between CL and SPL, and propose a unified framework named self-paced curriculum leaning (SPCL). SPCL is formulated as a concise optimization problem that takes into account both prior knowledge known before training and the learning progress during training. In comparison to human education, SPCL is analogous to "instructor-student-collaborative" learning mode, as opposed to "instructor-driven" in CL or "student-driven" in SPL. Empirically, we show that the advantage of SPCL on two tasks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
Bengio, Y., Louradour, J., Collobert, R., & Weston, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553380 · Cited by 5,366
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
Zhu, C., Byrd, R. H., Lu, P., & Nocedal, J. (1997) · ACM Transactions on Mathematical Software · doi:10.1145/279232.279236 · Cited by 3,462
Shape and motion from image streams under orthography: a factorization method
Tomasi, C., & Kanade, T. (1992) · International Journal of Computer Vision · doi:10.1007/bf00129684 · Cited by 2,878
Self-Paced Learning for Latent Variable Models
Kumar, M., Packer, B., & Koller, D. (2010) · neural information processing systems · Cited by 1,204
Biconvex sets and optimization with biconvex functions: a survey and extensions
Gorski, J., Pfeuffer, F., & Klamroth, K. (2007) · Mathematical Methods of Operations Research · doi:10.1007/s00186-007-0161-1 · Cited by 690
Self-Paced Learning with Diversity
Jiang, L., Meng, D., Yu, S.-I., Lan, Z., Shan, S., & Hauptmann, A. G. (2014) · Cited by 326
Self-citationSelf-Paced Learning for Long-Term Tracking
Supancic III, J. S., & Ramanan, D. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.308 · Cited by 290
Easy Samples First: Self-paced Reranking for Zero-Example Multimedia Search
Jiang, L., Meng, D., Mitamura, T., & Hauptmann, A. G. (2014) · Proceedings of the 22nd ACM international conference on Multimedia · doi:10.1145/2647868.2654918 · Cited by 271
Self-citationUnifying Nuclear Norm and Bilinear Factorization Approaches for Low-Rank Matrix Decomposition
Cabral, R., De la Torre, F., Costeira, J. P., & Bernardino, A. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.309 · Cited by 204
Cited by
Learning to Reweight Examples for Robust Deep Learning
Ren, M., Zeng, W., Yang, B., & Urtasun, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.09050 · Cited by 740
A Survey on Curriculum Learning
Wang, X., Chen, Y., & Zhu, W. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3069908 · Cited by 692
Cost-Effective Active Learning for Deep Image Classification
Wang, K., Zhang, D., Li, Y., Zhang, R., & Lin, L. (2017) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2016.2589879 · Cited by 663
Liu, Y., Yu, H., Xie, S., & Zhang, Y. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2935450 · Cited by 570
MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labels
Jiang, L., Zhou, Z., Leung, T., Li, L.-J., & Fei-Fei, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.05055 · Cited by 503
Self-citation
Metadata
- Authors
- Jiang, L., Meng, D., Zhao, Q., Shan, S., & Hauptmann, A.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2015-02-21
- Volume
- 29
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2256388387
- Cited by
- 480
- References
- 32
- FWCI
- 20.45
- Type
- conference paper
- Language
- en
- Open access
- diamond
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Self-Paced Curriculum Learning. https://app.cochat.ai/papers/10.1609/aaai.v29i1.9608
- The paper
- Jiang, L., Meng, D., Zhao, Q., Shan, S., & Hauptmann, A. (2015). Self-Paced Curriculum Learning. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v29i1.9608
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.