REVIEW 3 cited by
Towards Robust Dataset Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Towards Robust Dataset Learning
read the original abstract
Adversarial training has been actively studied in recent computer vision research to improve the robustness of models. However, due to the huge computational cost of generating adversarial samples, adversarial training methods are often slow. In this paper, we study the problem of learning a robust dataset such that any classifier naturally trained on the dataset is adversarially robust. Such a dataset benefits the downstream tasks as natural training is much faster than adversarial training, and demonstrates that the desired property of robustness is transferable between models and data. In this work, we propose a principled, tri-level optimization to formulate the robust dataset learning problem. We show that, under an abstraction model that characterizes robust vs. non-robust features, the proposed method provably learns a robust dataset. Extensive experiments on MNIST, CIFAR10, and TinyImageNet demostrate the effectiveness of our algorithm with different network initializations and architectures.
Forward citations
Cited by 3 Pith papers
-
Mind Your Margin and Boundary: Are Your Distilled Datasets Truly Robust?
C²R improves robust accuracy in distilled datasets by 2.8% on average by coupling an attack-aware margin-based curriculum with a class-balanced contrastive robustness objective.
-
Mind Your Margin and Boundary: Are Your Distilled Datasets Truly Robust?
C²R framework for robust dataset distillation prioritizes small-margin adversaries via a derived perturbation score and widens class boundaries with contrastive loss, yielding 2.8% average robust accuracy gains on CIF...
-
A Discrepancy-Based Perspective on Dataset Condensation
Dataset condensation is reframed as minimizing distribution discrepancies, and existing methods are sorted into a taxonomy; no new algorithm or experiments are provided.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.