Less is More: Data Pruning for Faster Adversarial Training

Yize Li, Pu Zhao, Xue Lin, Bhavya Kailkhura, Ryan Goldhahn
2/23/2023
cs.LGcs.CV

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Deep neural networks (DNNs) are sensitive to adversarial examples, resulting in fragile and unreliable performance in the real world. Although adversarial training (AT) is currently one of the most effective methodologies to robustify DNNs, it is computationally very expensive (e.g., 5-10X costlier than standard training). To address this challenge, existing approaches focus on single-step AT, referred to as Fast AT, reducing the overhead of adversarial example generation. Unfortunately, these approaches are known to fail against stronger adversaries. To make AT computationally efficient without compromising robustness, this paper takes a different view of the efficient AT problem. Specifically, we propose to minimize redundancies at the data level by leveraging data pruning. Extensive experiments demonstrate that the data pruning based AT can achieve similar or superior robust (and clean) accuracy as its unpruned counterparts while being significantly faster. For instance, proposed strategies accelerate CIFAR-10 training up to 3.44X and CIFAR-100 training to 2.02X. Additionally, the data pruning methods can readily be reconciled with existing adversarial acceleration tricks to obtain the striking speed-ups of 5.66X and 5.12X on CIFAR-10, 3.67X and 3.07X on CIFAR-100 with TRADES and MART, respectively.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2023less,
  title  = {Less is More: Data Pruning for Faster Adversarial Training},
  author = {Yize Li and Pu Zhao and Xue Lin and Bhavya Kailkhura and Ryan Goldhahn},
  year   = {2023},
  eprint = {2302.12366},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.12366v2}
}

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

Discussion