The Easy Path to Robustness: Coreset Selection using Sample Hardness
Not on the map. Why?
Abstract (arXiv)
Designing adversarially robust models from a data-centric perspective requires understanding which input samples are most crucial for learning resilient features. While coreset selection provides a mechanism for efficient training on data subsets, current algorithms are designed for clean accuracy and fall short in preserving robustness. To address this, we propose a framework linking a sample's adversarial vulnerability to its textithardness, which we quantify using the average input gradient norm (AIGN) over training. We demonstrate that textiteasy samples (with low AIGN) are less vulnerable and occupy regions further from the decision boundary. Leveraging this insight, we present EasyCore, a coreset selection algorithm that retains only the samples with low AIGN for training. We empirically show that models trained on EasyCore-selected data achieve significantly higher adversarial accuracy than those trained with competing coreset methods under both standard and adversarial training. As AIGN is a model-agnostic dataset property, EasyCore is an efficient and widely applicable data-centric method for improving adversarial robustness. We show that EasyCore achieves up to 7% and 5% improvement in adversarial accuracy under standard training and TRADES adversarial training, respectively, compared to existing coreset methods.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 31 references that are in the map. First posted on arXiv 13 Oct 2025.
Builds on
16 of 31 references.
References · 16
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 953
- 2020Fast is better than free: Revisiting adversarial trainingcited by 727
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
- 2019Adversarial Training for Free!cited by 643
- 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 497
- 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 460
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2018Robustness via curvature regularization, and vice versacited by 175
4 more
- 2020The Heavy-Tail Phenomenon in SGDcited by 124
- 2019Distribution Density, Tails, and Outliers in Machine Learning: Metrics and Applicationscited by 43
- 2024Unveiling Privacy, Memorization, and Input Curvature Linkscited by 10
- 2022Understanding Deep Learning via Decision Boundarycited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.