Name
Abstract | ||
|---|---|---|
The importance of studying the robustness of learners to malicious data is well established. While much work has been done establishing both robust estimators and effective data injection attacks when the attacker is omniscient, the ability of an attacker to provably harm learning while having access to little information is largely unstudied. We study the potential of a "blind attacker" to provably limit a learner's performance by data injection attack without observing the learner's training set or any parameter of the distribution from which it is drawn. We provide examples of simple yet effective attacks in two settings: firstly, where an "informed learner" knows the strategy chosen by the attacker, and secondly, where a "blind learner" knows only the proportion of malicious data and some family to which the malicious distribution chosen by the attacker belongs. For each attack, we analyze minimax rates of convergence and establish lower bounds on the learner's minimax risk, exhibiting limits on a learner's ability to learn under data injection attack even when the attacker is "blind". |
Year | Venue | Field |
|---|---|---|
2016 | ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016) | Training set,Convergence (routing),Injection attacks,Minimax,Computer security,Computer science,Harm,Robustness (computer science),Artificial intelligence,Ciphertext-only attack,Machine learning,Estimator |
DocType | Volume | ISSN |
Conference | 29 | 1049-5258 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alex Beatson | 1 | 8 | 4.56 |
| Zhaoran Wang | 2 | 157 | 33.20 |
| Han Liu | 3 | 434 | 42.70 |