One Period to Rule Them All: Identifying Critical Learning Periods in Deep Networks
Not on the map. Why?
Abstract (arXiv)
Critical Learning Periods comprehend an important phenomenon involving deep learning, where early epochs play a decisive role in the success of many training recipes, such as data augmentation. Existing works confirm the existence of this phenomenon and provide useful insights. However, the literature lacks efforts to precisely identify when critical periods occur. In this work, we fill this gap by introducing a systematic approach for identifying critical periods during the training of deep neural networks, focusing on eliminating computationally intensive regularization techniques and effectively applying mechanisms for reducing computational costs, such as data pruning. Our method leverages generalization prediction mechanisms to pinpoint critical phases where training recipes yield maximum benefits to the predictive ability of models. By halting resource-intensive recipes beyond these periods, we significantly accelerate the learning phase and achieve reductions in training time, energy consumption, and CO2 emissions. Experiments on standard architectures and benchmarks confirm the effectiveness of our method. Specifically, we achieve significant milestones by reducing the training time of popular architectures by up to 59.67%, leading to a 59.47% decrease in CO2 emissions and a 60% reduction in financial costs, without compromising performance. Our work enhances understanding of training dynamics and paves the way for more sustainable and efficient deep learning practices, particularly in resource-constrained environments. In the era of the race for foundation models, we believe our method emerges as a valuable framework. The repository is available at https://github.com/baunilhamarga/critical-periods
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 28 of its 38 references that are in the map. First posted on arXiv 19 Jun 2025.
Builds on
28 of 38 references.
References · 28
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,269
- 2017Random Erasing Data Augmentationcited by 1,239
- 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 532
- 2019Quantifying the Carbon Emissions of Machine Learningcited by 521
- 2019Using Self-Supervised Learning Can Improve Model Robustness and Uncertaintycited by 514
- 2024DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Headscited by 288
- 2021PixMix: Dreamlike Pictures Comprehensively Improve Safety Measurescited by 131
- 2024DsDm: Model-Aware Dataset Selection with Datamodelscited by 105
16 more
- 2023InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruningcited by 90
- 2023LLMCarbon: Modeling the end-to-end Carbon Footprint of Large Language Modelscited by 72
- 2023Can Neural Network Memorization Be Localized?cited by 69
- 2019Time Matters in Regularizing Deep Networks: Weight Decay and Data Augmentation Affect Early Learning Dynamics, Matter Little Near Convergencecited by 54
- 2019The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descentcited by 46
- 2023Understanding In-Context Learning via Supportive Pretraining Datacited by 41
- 2020Non-convex Learning via Replica Exchange Stochastic Gradient MCMCcited by 34
- 2023Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learningcited by 26
- 2025Holistically Evaluating the Environmental Impact of Creating Language Modelscited by 26
- 2024IDArb: Intrinsic Decomposition for Arbitrary Number of Input Views and Illuminationscited by 22
- 2022Critical Learning Periods for Multisensory Integration in Deep Networkscited by 14
- 2023Critical Learning Periods Emerge Even in Deep Linear Networkscited by 13
- 2022Predicting the generalization gap in neural networks using topological data analysiscited by 9
- 2024BWS: Best Window Selection Based on Sample Scores for Data Pruning across Broad Rangescited by 8
- 2023Core-sets for Fair and Diverse Data Summarizationcited by 4
- 2025Simple, Good, Fast: Self-Supervised World Models Free of Baggagecited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.