REDUCR: Robust Data Downsampling Using Class Priority Reweighting
Not on the map. Why?
Abstract (arXiv)
Modern machine learning models are becoming increasingly expensive to train for real-world image and text classification tasks, where massive web-scale data is collected in a streaming fashion. To reduce the training cost, online batch selection techniques have been developed to choose the most informative datapoints. However, these techniques can suffer from poor worst-class generalization performance due to class imbalance and distributional shifts. This work introduces REDUCR, a robust and efficient data downsampling method that uses class priority reweighting. REDUCR reduces the training data while preserving worst-class generalization performance. REDUCR assigns priority weights to datapoints in a class-aware manner using an online learning algorithm. We demonstrate the data efficiency and robust performance of REDUCR on vision and text classification tasks. On web-scraped datasets with imbalanced class distributions, REDUCR significantly improves worst-class test accuracy (and average accuracy), surpassing state-of-the-art methods by around 15%.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 40 of its 60 references that are in the map. First posted on arXiv 1 Dec 2023.
Builds on
40 of 60 references.
References · 40
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2022A ConvNet for the 2020scited by 3,579
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,245
- 2023PaLM 2 Technical Reportcited by 1,162
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
28 more
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 675
- 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 610
- 2021Carbon Emissions and Large Neural Network Trainingcited by 567
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 523
- 2017A systematic study of the class imbalance problem in convolutional neural networkscited by 513
- 2022Dataset Distillation by Matching Training Trajectoriescited by 442
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
- 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 399
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
- 2019Don't Take the Easy Way Out: Ensemble Based Methods for Avoiding Known Dataset Biasescited by 280
- 2023Challenges and Applications of Large Language Modelscited by 254
- 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 236
- 2021Dataset Distillation with Infinitely Wide Convolutional Networkscited by 218
- 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 192
- 2019Distributionally Robust Language Modelingcited by 143
- 2015Online Batch Selection for Faster Training of Neural Networkscited by 122
- 2022Plex: Towards Reliability using Pretrained Large Model Extensionscited by 102
- 2019Accelerating Deep Learning by Focusing on the Biggest Loserscited by 94
- 2017Practical Coreset Constructions for Machine Learningcited by 78
- 2019Ordered SGD: A New Stochastic Optimization Framework for Empirical Risk Minimizationcited by 51
- 2020Heteroskedastic and Imbalanced Deep Learning with Adaptive Regularizationcited by 49
- 2021Robust Long-Tailed Learning under Label Noisecited by 36
- 2017Robust Optimization for Non-Convex Objectivescited by 35
- 2017Biased Importance Sampling for Deep Neural Network Trainingcited by 31
- 2022Prioritizing Samples in Reinforcement Learning with Reducible Losscited by 22
- 2019No-Regret Learning in Unknown Games with Correlated Payoffscited by 18
- 2021Adaptive Inducing Points Selection For Gaussian Processescited by 8
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.