RCAP: Robust, Class-Aware, Probabilistic Dynamic Dataset Pruning
Not on the map. Why?
Abstract (arXiv)
Dynamic data pruning techniques aim to reduce computational cost while minimizing information loss by periodically selecting representative subsets of input data during model training. However, existing methods often struggle to maintain strong worst-group accuracy, particularly at high pruning rates, across balanced and imbalanced datasets. To address this challenge, we propose RCAP, a Robust, Class-Aware, Probabilistic dynamic dataset pruning algorithm for classification tasks. RCAP applies a closed-form solution to estimate the fraction of samples to be included in the training subset for each individual class. This fraction is adaptively adjusted in every epoch using class-wise aggregated loss. Thereafter, it employs an adaptive sampling strategy that prioritizes samples having high loss for populating the class-wise subsets. We evaluate RCAP on six diverse datasets ranging from class-balanced to highly imbalanced using five distinct models across three training paradigms: training from scratch, transfer learning, and fine-tuning. Our approach consistently outperforms state-of-the-art dataset pruning methods, achieving superior worst-group accuracy at all pruning rates. Remarkably, with only 10% data, RCAP delivers >1% improvement in performance on class-imbalanced datasets compared to full data training while providing an average 8.69× speedup. The code can be accessed at https://github.com/atif-hassan/RCAP-dynamic-dataset-pruning
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 38 of its 51 references that are in the map. First posted on arXiv 10 Jun 2026.
Builds on
38 of 51 references.
References · 38
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2023GPT-4 Technical Reportcited by 18,396
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
- 2020wav2vec 2.0: A Framework for Self-Supervised Learning of Speech Representationscited by 3,905
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2015Prioritized Experience Replaycited by 1,099
- 2020Designing Network Design Spacescited by 960
26 more
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2022Dataset Distillation by Matching Training Trajectoriescited by 442
- 2021Dataset Condensation with Distribution Matchingcited by 365
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 236
- 2021TrivialAugment: Tuning-free Yet State-of-the-Art Data Augmentationcited by 227
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
- 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 158
- 2021Active Learning by Acquiring Contrastive Examplescited by 156
- 2017Active Bias: Training More Accurate Neural Networks by Emphasizing High Variance Samplescited by 147
- 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 133
- 2015Online Batch Selection for Faster Training of Neural Networkscited by 122
- 2022Rethinking Vision Transformers for MobileNet Size and Speedcited by 121
- 2019Accelerating Deep Learning by Focusing on the Biggest Loserscited by 94
- 2023InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruningcited by 90
- 2020Submodular Combinatorial Information Measures with Applications in Machine Learningcited by 88
- 2021RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learningcited by 74
- 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
- 2021Accelerating Deep Learning with Dynamic Data Pruningcited by 43
- 2023Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruningcited by 38
- 2023Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learningcited by 26
- 2021SVP-CF: Selection via Proxy for Collaborative Filtering Datacited by 14
- 2023Refined Coreset Selection: Towards Minimal Coreset Size under Model Performance Constraintscited by 13
- 2023Data pruning and neural scaling laws: fundamental limitations of score-based algorithmscited by 11
Built on by
Not cited yet.