A PAC-Bayes Analysis of Adversarial Robustness - Advancing Rigorous Software and System Engineering Access content directly
Conference Papers Year : 2021

A PAC-Bayes Analysis of Adversarial Robustness

Paul Viallard
Amaury Habrard
Emilie Morvant


We propose the first general PAC-Bayesian generalization bounds for adversarial robustness, that estimate, at test time, how much a model will be invariant to imperceptible perturbations in the input. Instead of deriving a worst-case analysis of the risk of a hypothesis over all the possible perturbations, we leverage the PAC-Bayesian framework to bound the averaged risk on the perturbations for majority votes (over the whole class of hypotheses). Our theoretically founded analysis has the advantage to provide general bounds (i) that are valid for any kind of attacks (i.e., the adversarial attacks), (ii) that are tight thanks to the PAC-Bayesian framework, (iii) that can be directly minimized during the learning phase to obtain a robust model on different attacks at test time.
Fichier principal
Vignette du fichier
main.pdf (656.71 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03145332 , version 1 (18-02-2021)
hal-03145332 , version 2 (26-10-2021)



Paul Viallard, Guillaume Vidot, Amaury Habrard, Emilie Morvant. A PAC-Bayes Analysis of Adversarial Robustness. Thirty-fifth Conference on Neural Information Processing Systems (NeurIPS 2021), NIPS: Neural Information Processing Systems Foundation, Dec 2021, Virtual-only Conference, Australia. ⟨hal-03145332v2⟩
374 View
201 Download



Gmail Mastodon Facebook X LinkedIn More