Pith. sign in

REVIEW 2 cited by

On The Power of Curriculum Learning in Training Deep Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.03626 v3 pith:BLVLC3M6 submitted 2019-04-07 cs.LG stat.ML

classification cs.LGstat.ML
keywords learningtrainingcurriculummini-batchesnetworksaddresschallengedata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Training neural networks is traditionally done by providing a sequence of random mini-batches sampled uniformly from the entire training data. In this work, we analyze the effect of curriculum learning, which involves the non-uniform sampling of mini-batches, on the training of deep networks, and specifically CNNs trained for image recognition. To employ curriculum learning, the training algorithm must resolve 2 problems: (i) sort the training examples by difficulty; (ii) compute a series of mini-batches that exhibit an increasing level of difficulty. We address challenge (i) using two methods: transfer learning from some competitive ``teacher" network, and bootstrapping. In our empirical evaluation, both methods show similar benefits in terms of increased learning speed and improved final performance on test data. We address challenge (ii) by investigating different pacing functions to guide the sampling. The empirical investigation includes a variety of network architectures, using images from CIFAR-10, CIFAR-100 and subsets of ImageNet. We conclude with a novel theoretical analysis of curriculum learning, where we show how it effectively modifies the optimization landscape. We then define the concept of an ideal curriculum, and show that under mild conditions it does not change the corresponding global minimum of the optimization function.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Influence-driven Curriculum Learning for Pre-training on Limited Data

    cs.CL 2025-08 unverdicted novelty 6.0 of 10

    Sorting pre-training examples by training-data influence instead of human-judged difficulty reportedly gives over 10 percentage point benchmark gains over random order in limited-data language model pre-training.

  2. Principled Curriculum Learning using Parameter Continuation Methods

    cs.LG 2025-07 reject novelty 3.0 of 10

    The paper applies pseudo-arclength continuation, a classical numerical method, to neural network optimization, claiming improved generalization over ADAM on small MNIST tasks.

Pith tools