On the hardness of robust classification
It is becoming increasingly important to understand the vulnerability of machine learning models to adversarial attacks. In this paper we study the feasibility of robust learning from the perspective of computational learning theory, considering both sample and computational complexity. In particula...
Main Authors: | Gourdeau, P, Kanade, V, Kwiatkowska, M, Worrell, J |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Neural Information Processing Systems Foundation
2019
|
Similar Items
-
On the hardness of robust classification
by: Gourdeau, P, et al.
Published: (2021) -
When are local queries useful for robust learning?
by: Gourdeau, P, et al.
Published: (2023) -
Sample complexity bounds for robustly learning decision lists against evasion attacks
by: Gourdeau, P, et al.
Published: (2022) -
Sample complexity of robust learning against evasion attacks
by: Gourdeau, P
Published: (2023) -
Adversarial robustness guarantees for classification with Gaussian Processes
by: Blaas, A, et al.
Published: (2020)