DRoP: Distributionally Robust Data Pruning

Artem Vysogorets, Kartik Ahuja, Julia Kempe
2/12/2026

No official code found. Best implementation: avysogorets/drop-data-pruning (4 stars, MIT, last commit 2025-01-28).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

MIT
40PythonMar 8, 20241 years agoMIT

Similar Papers

Cite this paper

@article{vysogorets2026drop,
  title  = {DRoP: Distributionally Robust Data Pruning},
  author = {Artem Vysogorets and Kartik Ahuja and Julia Kempe},
  year   = {2026},
  eprint = {2404.05579},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2404.05579},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.05579.svg)](https://codeofpaper.com/paper/2404.05579)

Discussion