7 citations · 10 across the 21 of their papers we have counts for
Showing 2026 · stat.MLShow all
2 papers · 2 filters
stat.ML2026
The optimal information complexity of VC learning
Steve Hanneke, Juexiao Wang
Steinke and Zakynthinou(2020) introduces the Conditional Mutual Information (CMI) framework of analyzing the information complexity of learning algorithms based on algorithm-depend…
stat.ML2026
PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
Steve Hanneke, Qinglin Meng, Shay Moran +1
We study the problem of multiclass PAC learning with bandit feedback in the realizable setting. In this framework, there is an unknown data distribution over an instance space $\ma…