7 citations · 10 across the 21 of their papers we have counts for
4 papers · 1 filter
Optimal Mistake Bounds for Transductive Online Learning
Zachary Chase, Steve Hanneke, Shay Moran +1
We resolve a 30-year-old open problem concerning the power of unlabeled data in online learning by tightly quantifying the gap between transductive and standard online learning. In…
Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
Alon Cohen, Liad Erez, Steve Hanneke +4
The fundamental theorem of statistical learning states that binary PAC learning is governed by a single parameter -- the Vapnik-Chervonenkis (VC) dimension -- which determines both…
Private List Learnability vs. Online List Learnability
Steve Hanneke, Shay Moran, Hilla Schefler +1
This work explores the connection between differential privacy (DP) and online learning in the context of PAC list learning. In this setting, a -list learner outputs a list of $…
Data Selection for ERMs
Steve Hanneke, Shay Moran, Alexander Shlimovich +1
Learning theory has traditionally followed a model-centric approach, focusing on designing optimal algorithms for a fixed natural learning task (e.g., linear classification or regr…