## Abstract

We consider a model of robust learning in an adversarial environment. The learner gets uncorrupted training data with access to possible corruptions that may be affected by the adversary during testing. The learner’s goal is to build a robust classifier, which will be tested on future adversarial examples. The adversary is limited to k possible corruptions for each input. We model the learner-adversary interaction as a zero-sum game. This model is closely related to the adversarial examples model of Schmidt et al. (2018); Madry et al. (2017). Our main results consist of generalization bounds for the binary and multiclass classification, as well as the real-valued case (regression). For the binary classification setting, we both tighten the generalization bound of Feige et al. (2015), and are also able to handle infinite hypothesis classes. The sample complexity is improved from *O*( ^{1/}_{4} log(^{|H|}_{δ} )) to *O*( ^{1/}_{2} (k VC(H) log ^{3/ 2 +α}(k VC(H)) + log(^{1/}_{δ} )) for any α > 0. Additionally, we extend the algorithm and generalization bound from the binary to the multiclass and real-valued cases. Along the way, we obtain results on fat-shattering dimension and Rademacher complexity of k-fold maxima over function classes; these may be of independent interest. For binary classification, the algorithm of Feige et al. (2015) uses a regret minimization algorithm and an ERM oracle as a black box; we adapt it for the multiclass and regression settings. The algorithm provides us with near-optimal policies for the players on a given training sample.

Original language | English |
---|---|

Pages (from-to) | 1-31 |

Journal | Journal of Machine Learning Research |

Volume | 23 |

State | Published - 1 Jun 2022 |

## Keywords

- Adversarial Robustness
- PAC Learning
- Sample Complexity
- Zero-Sum Game

## ASJC Scopus subject areas

- Software
- Artificial Intelligence
- Control and Systems Engineering
- Statistics and Probability