Near-Optimal Evasion of Convex-Inducing Classifiers

By Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Shing-Hon Lau, Steven J. Lee, Satish Rao, Anthony Tran, J. Doug Tygar. 2010

55 citations recorded by the source corpus.

Classifiers are often used to detect miscreant activities. We study how an adversary can efficiently query a classifier to elicit information that allows the adversary to evade detection at near-minimal cost. We generalize results of Lowd and Meek (2005) to convex-inducing classifiers. We present algorithms that construct undetected instances of near-minimal cost using only polynomially many queries in the dimension of the space and without reverse engineering the decision boundary.

Subfields: Artificial Intelligence, Computer Networks and Communications, Safety, Robustness & Interpretability

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. Battista Biggio
  2. Fabio Roli
  3. Bo Li
  4. Giorgio Fumera
  5. Nicolas Papernot
  6. Neil Zhenqiang Gong
  7. Yevgeniy Vorobeychik
  8. Prateek Mittal

In Computer Networks and Communications

  1. Battista Biggio
  2. Fabio Roli
  3. Giorgio Fumera
  4. Neil Zhenqiang Gong
  5. Blaine Nelson
  6. Binghui Wang
  7. Bo Li
  8. Pavel Laskov

In Safety, Robustness & Interpretability

  1. Battista Biggio
  2. Fabio Roli
  3. Bo Li
  4. Giorgio Fumera
  5. Nicolas Papernot
  6. Yevgeniy Vorobeychik
  7. Neil Zhenqiang Gong
  8. Blaine Nelson

Citations in the corpus