REVIEW 2 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
Signed reviews
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 2 Pith papers
-
BEARD: Benchmarking the Adversarial Robustness for Dataset Distillation
BEARD is a benchmark and leaderboard evaluating adversarial robustness of dataset distillation methods with new normalized metrics across multiple datasets and images-per-class settings.
-
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). Continue with ORCID to comment.