Skip to yearly menu bar Skip to main content


Adversarially Robust Learning with Uncertain Perturbation Sets

Tosca Lechner · Vinayak Pathak · Ruth Urner

Great Hall & Hall B1+B2 (level 1) #1712
[ ]
Tue 12 Dec 3:15 p.m. PST — 5:15 p.m. PST


In many real-world settings exact perturbation sets to be used by an adversary are not plausibly available to a learner. While prior literature has studied both scenarios with completely known and completely unknown perturbation sets, we propose an in-between setting of learning with respect to a class of perturbation sets. We show that in this setting we can improve on previous results with completely unknown perturbation sets, while still addressing the concerns of not having perfect knowledge of these sets in real life. In particular, we give the first positive results for the learnability of infinite Littlestone classes when having access to a perfect-attack oracle. We also consider a setting of learning with abstention, where predictions are considered robustness violations, only when the wrong prediction is made within the perturbation set. We show there are classes for which perturbation-set unaware learning without query access is possible, but abstention is required.

Chat is not available.