Reliable learning in challenging environments

Maria-Florina Balcan · Steve Hanneke · Rattana Pukdee · Dravyansh Sharma

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


The problem of designing learners that provide guarantees that their predictions are provably correct is of increasing importance in machine learning. However, learning theoretic guarantees have only been considered in very specific settings. In this work, we consider the design and analysis of reliable learners in challenging test-time environments as encountered in modern machine learning problems: namely adversarial test-time attacks (in several variations) and natural distribution shifts. In this work, we provide a reliable learner with provably optimal guarantees in such settings. We discuss computationally feasible implementations of the learner and further show that our algorithm achieves strong positive performance guarantees on several natural examples: for example, linear separators under log-concave distributions or smooth boundary classifiers under smooth probability distributions.

Chat is not available.