Using Machine Teaching to Identify Optimal Training-Set Attacks on Machine Learners

By Shike Mei, Xiaojin Zhu. 2015

435 citations recorded by the source corpus.

We investigate a problem at the intersection of machine learning and security: training-set attacks on machine learners. In such attacks an attacker contaminates the training data so that a specific learning algorithm would produce a model profitable to the attacker. Understanding training-set attacks is important as more intelligent agents (e.g. spam filters and robots) are equipped with learning capability and can potentially be hacked via data they receive from the environment. This paper identifies the optimal training-set attack on a broad family of machine learners. First we show that optimal training-set attack can be formulated as a bilevel optimization problem. Then we show that for machine learners with certain Karush-Kuhn-Tucker conditions we can solve the bilevel problem efficiently using gradient methods on an implicit function. As examples, we demonstrate optimal training-set attacks on Support VectorMachines, logistic regression, and linear regression with extensive experiments. Finally, we discuss potential defenses against such attacks.

Subfields: Artificial Intelligence, Representation & Self-Supervised Learning

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. Percy Liang
  2. Bo Li
  3. Nicholas Carlini
  4. Nicolas Papernot
  5. Dawn Song
  6. Martin Jaggi
  7. Qiang Yang
  8. Dacheng Tao

In Representation & Self-Supervised Learning

  1. Percy Liang
  2. Qiang Yang
  3. Dacheng Tao
  4. Michael I. Jordan
  5. Mingsheng Long
  6. Stephan Günnemann
  7. Jianmin Wang
  8. Bernhard Schölkopf

Citations in the corpus