mlsanityData to 14 Oct 2026

DRoP: Distributionally Robust Data Pruning

arXiv 2404.05579 ↗First posted 8 Apr 2024cs.LG cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

In the era of exceptionally data-hungry models, careful selection of the training data is essential to mitigate the extensive costs of deep learning. Data pruning offers a solution by removing redundant or uninformative samples from the dataset, which yields faster convergence and improved neural scaling laws. However, little is known about its impact on classification bias of the trained models. We conduct the first systematic study of this effect and reveal that existing data pruning algorithms can produce highly biased classifiers. We present theoretical analysis of the classification risk in a mixture of Gaussians to argue that choosing appropriate class pruning ratios, coupled with random pruning within classes has potential to improve worst-class performance. We thus propose DRoP, a distributionally robust approach to pruning and empirically demonstrate its performance on standard computer vision benchmarks. In sharp contrast to existing algorithms, our proposed method continues improving distributional robustness at a tolerable drop of average performance as we prune more from the datasets.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 56 of its 80 references that are in the map. First posted on arXiv 8 Apr 2024.

Builds on

56 of 80 references.

References · 56

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  4. 2020Scaling Laws for Neural Language Modelscited by 6,586
  5. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  6. 2016Wide Residual Networkscited by 3,070
  7. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  8. 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,245
  9. 2019Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inferencecited by 876
  10. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
  11. 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
  12. 2020A Survey of Deep Active Learningcited by 554
38 more
  1. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  2. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
  3. 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 523
  4. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  5. 2022Dataset Distillation by Matching Training Trajectoriescited by 442
  6. 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
  7. 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 381
  8. 2020Fairness in Machine Learning: A Surveycited by 370
  9. 2021Dataset Condensation with Distribution Matchingcited by 365
  10. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 364
  11. 2020Equalization Loss for Long-Tailed Object Recognitioncited by 285
  12. 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 236
  13. 2021Dataset Distillation with Infinitely Wide Convolutional Networkscited by 218
  14. 2019A Constructive Prediction of the Generalization Error Across Scalescited by 210
  15. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
  16. 2021Simple data balancing achieves competitive worst-group-accuracycited by 178
  17. 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 147
  18. 2020Contextual Diversity for Active Learningcited by 139
  19. 2020To be Robust or to be Fair: Towards Fairness in Adversarial Trainingcited by 137
  20. 2020Learning from Failure: Training Debiased Classifier from Biased Classifiercited by 133
  21. 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 117
  22. 2019Soft-Label Dataset Distillation and Text Dataset Distillationcited by 107
  23. 2019Generative Teaching Networks: Accelerating Neural Architecture Search by Learning to Generate Synthetic Training Datacited by 104
  24. 2021The Evolution of Out-of-Distribution Robustness Throughout Fine-Tuningcited by 75
  25. 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
  26. 2020Fairness Through Robustness: Investigating Robustness Disparity in Deep Learningcited by 56
  27. 2019Ordered SGD: A New Stochastic Optimization Framework for Empirical Risk Minimizationcited by 51
  28. 2020Robustness May Be at Odds with Fairness: An Empirical Study on Class-wise Accuracycited by 45
  29. 2022Pruning has a disparate impact on model accuracycited by 44
  30. 2017Robust Optimization for Non-Convex Objectivescited by 35
  31. 2023WAT: Improve the Worst-class Robustness in Adversarial Trainingcited by 27
  32. 2023Towards a statistical theory of data selection under weak supervisioncited by 27
  33. 2023Discovering environments with XRMcited by 26
  34. 2022Class-Difficulty Based Methods for Long-Tailed Visual Recognitioncited by 23
  35. 2022Why does Throwing Away Data Improve Worst-Group Error?cited by 22
  36. 2021Teacher's pet: understanding and mitigating biases in distillationcited by 21
  37. 2022Deep Learning on a Healthy Data Diet: Finding Important Examples for Fairnesscited by 21
  38. 2022Learning to Split for Automatic Bias Detectioncited by 16

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 2; 2026: 3.

7 papers.