Results 1 -
1 of
1
Some Submodular Data-Poisoning Attacks on Machine Learners
, 2015
"... We study data-poisoning attacks using a machine teaching framework. For a family of NP-hard attack problems we pose them as submodular function maximization, thereby inheriting efficient greedy algorithms with theoretical guarantees. We demonstrate some attacks with experiments. 1 ..."
Abstract
- Add to MetaCart
(Show Context)
We study data-poisoning attacks using a machine teaching framework. For a family of NP-hard attack problems we pose them as submodular function maximization, thereby inheriting efficient greedy algorithms with theoretical guarantees. We demonstrate some attacks with experiments. 1
