Unrestricted Adversarial Examples

By Tom B. Brown, Nicholas Carlini, Chiyuan Zhang, Catherine Olsson, Paul Christiano, Ian J. Goodfellow. 2018

108 citations recorded by the source corpus.

We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achieve high accuracy and coverage on non-adversarial data while making no confident mistakes on adversarial inputs. Attackers try to subvert defenses by finding arbitrary unambiguous inputs where the model assigns an incorrect label with high confidence. We propose a simple unambiguous dataset ("bird-or- bicycle") to use as part of this contest. We hope this contest will help to more comprehensively evaluate the worst-case adversarial risk of machine learning models.

Subfields: Artificial Intelligence, Safety, Robustness & Interpretability, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Matthias Hein
  3. Bernt Schiele
  4. Percy Liang
  5. Stefano Ermon
  6. Quoc V. Le
  7. Mohit Bansal
  8. Yoshua Bengio

In Safety, Robustness & Interpretability

  1. Matthias Hein
  2. Francesco Croce
  3. Maksym Andriushchenko
  4. Dawn Song
  5. Jacob Steinhardt
  6. Jörn-Henrik Jacobsen
  7. Bernt Schiele
  8. David Stutz

In Signal Processing

  1. Matthias Hein
  2. Stefano Ermon
  3. Yang Song
  4. Bernt Schiele
  5. Francesco Croce
  6. Maksym Andriushchenko
  7. Jörn-Henrik Jacobsen
  8. David Stutz

Citations in the corpus