query complexity

Complexity of Equivalence and Learning for Multiplicity Tree Automata JMLR 2015 Open Problem: Learning Quantum Circuits with Queries COLT 2015 S2: An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification COLT 2015 Active Imitation Learning: Formal and Practical Reductions to I.I.D. Learning JMLR 2014 Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces COLT 2014 Auditing: Active Learning with Outcome-Dependent Query Costs NeurIPS 2013 On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013 Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights COLT 2013 Statistical Active Learning Algorithms NeurIPS 2013 An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity JMLR 2012 Computational Bounds on Statistical Query Learning COLT 2012 Learning Functions of Halfspaces Using Prefix Covers COLT 2012 Query Complexity of Derivative-Free Optimization NeurIPS 2012 Robust Interactive Learning COLT 2012 Active Learning Ranking from Pairwise Preferences with Almost Optimal Query Complexity NeurIPS 2011 Randomized Algorithms for Comparison-based Search NeurIPS 2011 Extensions of Generalized Binary Search to Group Identification and Exponential Costs NeurIPS 2010 Near-Optimal Evasion of Convex-Inducing Classifiers AISTATS 2010 Analysis of Perceptron-Based Active Learning JMLR 2009 Learning a Hidden Hypergraph JMLR 2006