165 citations · 950 across the 71 of their papers we have counts for
3 papers · 2 filters
Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination
Sitan Chen, Frederic Koehler, Ankur Moitra +1
In this work we revisit two classic high-dimensional online learning problems, namely linear regression and contextual bandits, from the perspective of adversarial robustness. Exis…
Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Connections to Evolvability
Sitan Chen, Frederic Koehler, Ankur Moitra +1
In this paper we revisit some classic problems on classification under misspecification. In particular, we study the problem of learning halfspaces under Massart noise with rate $η…
Learning Structured Distributions From Untrusted Batches: Faster and Simpler
Sitan Chen, Jerry Li, Ankur Moitra
We revisit the problem of learning from untrusted batches introduced by Qiao and Valiant [QV17]. Recently, Jain and Orlitsky [JO19] gave a simple semidefinite programming approach…