concept class

On the Provable Generalization of Recurrent Neural Networks NeurIPS 2021 Simple and Fast Algorithms for Interactive Machine Learning with Random Counter-examples JMLR 2021 Bounds in query learning COLT 2020 Characterizing the Sample Complexity of Pure Private Learners JMLR 2019 Optimal Collusion-Free Teaching ALT 2019 Diameter-Based Active Learning ICML 2017 Preference-based Teaching JMLR 2017 On the Recursive Teaching Dimension of VC Classes NeurIPS 2016 Preference-based Teaching COLT 2016 An Almost Optimal PAC Algorithm COLT 2015 Open Problem: Recursive Teaching Dimension Versus VC Dimension COLT 2015 Learning Shuffle Ideals Under Restricted Distributions NeurIPS 2014 Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces COLT 2014 Sample Compression for Multi-label Concept Classes COLT 2014 Honest Compressions and Their Application to Compression Schemes COLT 2013 Computational Bounds on Statistical Query Learning COLT 2012 A Close Look to Margin Complexity and Related Parameters COLT 2011 Distribution-Independent Evolvability of Linear Threshold Functions COLT 2011 Models of Cooperative Teaching and Learning JMLR 2011 Supervised Clustering NeurIPS 2010 Trading off Mistakes and Don't-Know Predictions NeurIPS 2010 Behavioral Shaping for Geometric Concepts JMLR 2007