Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox
Picture for Steve Hanneke

Steve Hanneke

A Theory of PAC Learnability of Partial Concept Classes


Jul 20, 2021
Noga Alon, Steve Hanneke, Ron Holzman, Shay Moran

Figure 1 for A Theory of PAC Learnability of Partial Concept Classes
Figure 2 for A Theory of PAC Learnability of Partial Concept Classes

  Access Paper or Ask Questions

Open Problem: Is There an Online Learning Algorithm That Learns Whenever Online Learning Is Possible?


Jul 20, 2021
Steve Hanneke


  Access Paper or Ask Questions

Robust learning under clean-label attack


Mar 03, 2021
Avrim Blum, Steve Hanneke, Jian Qian, Han Shao

Figure 1 for Robust learning under clean-label attack
Figure 2 for Robust learning under clean-label attack

  Access Paper or Ask Questions

Adversarially Robust Learning with Unknown Perturbation Sets


Feb 03, 2021
Omar Montasser, Steve Hanneke, Nathan Srebro

Figure 1 for Adversarially Robust Learning with Unknown Perturbation Sets

  Access Paper or Ask Questions

Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games


Feb 02, 2021
Steve Hanneke, Roi Livni, Shay Moran


  Access Paper or Ask Questions

Stable Sample Compression Schemes: New Applications and an Optimal SVM Margin Bound


Nov 09, 2020
Steve Hanneke, Aryeh Kontorovich


  Access Paper or Ask Questions

A Theory of Universal Learning


Nov 09, 2020
Olivier Bousquet, Steve Hanneke, Shay Moran, Ramon van Handel, Amir Yehudayoff

Figure 1 for A Theory of Universal Learning
Figure 2 for A Theory of Universal Learning
Figure 3 for A Theory of Universal Learning
Figure 4 for A Theory of Universal Learning

  Access Paper or Ask Questions

Reducing Adversarially Robust Learning to Non-Robust PAC Learning


Oct 22, 2020
Omar Montasser, Steve Hanneke, Nathan Srebro

* To appear in NeurIPS 2020 
  Access Paper or Ask Questions

A No-Free-Lunch Theorem for MultiTask Learning


Jul 13, 2020
Steve Hanneke, Samory Kpotufe


  Access Paper or Ask Questions

Proper Learning, Helly Number, and an Optimal SVM Bound


May 24, 2020
Olivier Bousquet, Steve Hanneke, Shay Moran, Nikita Zhivotovskiy

Figure 1 for Proper Learning, Helly Number, and an Optimal SVM Bound

  Access Paper or Ask Questions

On the Value of Target Data in Transfer Learning


Feb 12, 2020
Steve Hanneke, Samory Kpotufe

* NeurIPS 2019 
  Access Paper or Ask Questions

Universal Bayes consistency in metric spaces


Jun 26, 2019
Steve Hanneke, Aryeh Kontorovich, Sivan Sabato, Roi Weiss

Figure 1 for Universal Bayes consistency in metric spaces
* arXiv admin note: text overlap with arXiv:1705.08184 
  Access Paper or Ask Questions

VC Classes are Adversarially Robustly Learnable, but Only Improperly


Feb 12, 2019
Omar Montasser, Steve Hanneke, Nathan Srebro


  Access Paper or Ask Questions

Agnostic Sample Compression for Linear Regression


Oct 03, 2018
Steve Hanneke, Aryeh Kontorovich, Menachem Sadigurschi

Figure 1 for Agnostic Sample Compression for Linear Regression

  Access Paper or Ask Questions

Sample Compression for Real-Valued Learners


May 21, 2018
Steve Hanneke, Aryeh Kontorovich, Menachem Sadigurschi


  Access Paper or Ask Questions

A New Lower Bound for Agnostic Learning with Sample Compression Schemes


May 21, 2018
Steve Hanneke, Aryeh Kontorovich


  Access Paper or Ask Questions

Testing Piecewise Functions


May 20, 2018
Steve Hanneke, Liu Yang


  Access Paper or Ask Questions

Statistical Learning under Nonstationary Mixing Processes


May 20, 2018
Steve Hanneke, Liu Yang


  Access Paper or Ask Questions

Actively Avoiding Nonsense in Generative Models


Feb 20, 2018
Steve Hanneke, Adam Kalai, Gautam Kamath, Christos Tzamos

Figure 1 for Actively Avoiding Nonsense in Generative Models

  Access Paper or Ask Questions

Learning Whenever Learning is Possible: Universal Learning under General Stochastic Processes


Jun 05, 2017
Steve Hanneke


  Access Paper or Ask Questions

Learning with Changing Features


Apr 29, 2017
Amit Dhurandhar, Steve Hanneke, Liu Yang

Figure 1 for Learning with Changing Features
Figure 2 for Learning with Changing Features

  Access Paper or Ask Questions

Refined Error Bounds for Several Learning Algorithms


Sep 10, 2016
Steve Hanneke

* Journal of Machine Learning Research, Vol. 17 (2016), No. 135, pp. 1-55 
  Access Paper or Ask Questions

The Optimal Sample Complexity of PAC Learning


Feb 07, 2016
Steve Hanneke

* Journal of Machine Learning Research, Vol. 17 (2016), No. 38, pp. 1-15 
  Access Paper or Ask Questions

Bounds on the Minimax Rate for Estimating a Prior over a VC Class from Independent Learning Tasks


May 20, 2015
Liu Yang, Steve Hanneke, Jaime Carbonell


  Access Paper or Ask Questions

Learning with a Drifting Target Concept


May 20, 2015
Steve Hanneke, Varun Kanade, Liu Yang


  Access Paper or Ask Questions

Surrogate Losses in Passive and Active Learning


Mar 14, 2015
Steve Hanneke, Liu Yang


  Access Paper or Ask Questions

Minimax Analysis of Active Learning


Oct 03, 2014
Steve Hanneke, Liu Yang

Figure 1 for Minimax Analysis of Active Learning

  Access Paper or Ask Questions

A Compression Technique for Analyzing Disagreement-Based Active Learning


Apr 05, 2014
Yair Wiener, Steve Hanneke, Ran El-Yaniv


  Access Paper or Ask Questions