Steve Hanneke

9 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0002-5511-1467

Computer Science Department, Purdue University

Publications

• A no-free-lunch theorem for multitask learning — The Annals of Statistics 2022 (name-matched, not ORCID-linked)
• Learning Whenever Learning is Possible: Universal Learning under General Stochastic Processes — Journal of Machine Learning Research 2021 (name-matched, not ORCID-linked)
• Universal Bayes consistency in metric spaces — The Annals of Statistics 2021 (name-matched, not ORCID-linked)
• Refined Error Bounds for Several Learning Algorithms — Journal of Machine Learning Research 2016 (name-matched, not ORCID-linked)
• The Optimal Sample Complexity of PAC Learning — Journal of Machine Learning Research 2016 (name-matched, not ORCID-linked)
• A Compression Technique for Analyzing Disagreement-Based Active Learning — Journal of Machine Learning Research 2015 (name-matched, not ORCID-linked)
• Minimax Analysis of Active Learning — Journal of Machine Learning Research 2015 (name-matched, not ORCID-linked)
• Activized Learning: Transforming Passive to Active with Improved Label Complexity — Journal of Machine Learning Research 2012 (name-matched, not ORCID-linked)
• Rates of convergence in active learning — The Annals of Statistics 2011 (name-matched, not ORCID-linked)