Adaptive Data Dropout: Towards Self-Regulated Learning in Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
Deep neural networks are typically trained by uniformly sampling large datasets across epochs, despite evidence that not all samples contribute equally throughout learning. Recent work shows that progressively reducing the amount of training data can improve efficiency and generalization, but existing methods rely on fixed schedules that do not adapt during training. In this work, we propose Adaptive Data Dropout, a simple framework that dynamically adjusts the subset of training data based on performance feedback. Inspired by self-regulated learning, our approach treats data selection as an adaptive process, increasing or decreasing data exposure in response to changes in training accuracy. We introduce a lightweight stochastic update mechanism that modulates the dropout schedule online, allowing the model to balance exploration and consolidation over time. Experiments on standard image classification benchmarks show that our method reduces effective training steps while maintaining competitive accuracy compared to static data dropout strategies. These results highlight adaptive data selection as a promising direction for efficient and robust training. Code will be released.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 39 references that are in the map. First posted on arXiv 14 Apr 2026.
Builds on
24 of 39 references.
References · 24
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2016Deep Networks with Stochastic Depthcited by 973
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
12 more
- 2016Training Region-based Object Detectors with Online Hard Example Miningcited by 577
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
- 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 337
- 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
- 2022EfficientFormer: Vision Transformers at MobileNet Speedcited by 240
- 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 233
- 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 132
- 2023InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruningcited by 90
- 2018Data Dropout: Optimizing Training Data for Convolutional Neural Networkscited by 23
- 2023Watt For What: Rethinking Deep Learning's Energy-Performance Relationshipcited by 16
- 2025Instance-dependent Early Stoppingcited by 10
Built on by
Citing papers per year: 2026: 1.
1 paper.