Severing Spurious Correlations with Data Pruning

Varun Mulchandani, Jung-Eun Kim
2/12/2026

No official code found. Best implementation: JEKimLab/ICLR2025_SpuriousDataPruning (4 stars, last commit 2025-05-17).

Abstract

Deep neural networks have been shown to learn and rely on spurious correlations present in the data that they are trained on. Reliance on such correlations can cause these networks to malfunction when deployed in the real world, where these correlations may no longer hold. To overcome the learning of and reliance on such correlations, recent studies propose approaches that yield promising results. These works, however, study settings where the strength of the spurious signal is significantly greater than that of the core, invariant signal, making it easier to detect the presence of spurious features in individual training samples and allow for further processing. In this paper, we identify new settings where the strength of the spurious signal is relatively weaker, making it difficult to detect any spurious information while continuing to have catastrophic consequences. We also discover that spurious correlations are learned primarily due to only a handful of all the samples containing the spurious feature and develop a novel data pruning technique that identifies and prunes small subsets of the training data that contain these samples. Our proposed technique does not require inferred domain knowledge, information regarding the sample-wise presence or nature of spurious information, or human intervention. Finally, we show that such data pruning attains state-of-the-art performance on previously studied settings where spurious information is identifiable.

View on arXivView PDF

Code Implementations(1)

Official implementation of "Severing Spurious Correlations with Data Pruning", published in the International Conference on Learning Representations, 2025.

40Shell, PythonFeb 19, 20251 years ago

Similar Papers

Cite this paper

@article{mulchandani2026severing,
  title  = {Severing Spurious Correlations with Data Pruning},
  author = {Varun Mulchandani and Jung-Eun Kim},
  year   = {2026},
  eprint = {2503.18258},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2503.18258},
  journal = {ICLR 2025 2025}
}

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/2503.18258.svg)](https://codeofpaper.com/paper/2503.18258)

Discussion