113 citations · 317 across the 70 of their papers we have counts for
4 papers · 1 filter
When are Local Queries Useful for Robust Learning?
Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska +1
Distributional assumptions have been shown to be necessary for the robust learnability of concept classes when considering the exact-in-the-ball robust risk and access to random ex…
Sample Complexity Bounds for Robustly Learning Decision Lists against Evasion Attacks
Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska +1
A fundamental problem in adversarial machine learning is to quantify how much training data is needed in the presence of evasion attacks. In this paper we address this issue within…
On the Hardness of Robust Classification
Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska +1
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 f…
Complexity of Equivalence and Learning for Multiplicity Tree Automata
Ines Marusic, James Worrell
We consider the complexity of equivalence and learning for multiplicity tree automata, i.e., weighted tree automata over a field. We first show that the equivalence problem is logs…