query complexity

Same-Cluster Querying for Overlapping Clusters NeurIPS 2019 Active Tolerant Testing COLT 2018 Computational Social Choice Meets Databases IJCAI 2018 Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice ICML 2018 Generalized Binary Search For Split-Neighborly Problems AISTATS 2018 Interactive Algorithms: Pool, Stream and Precognitive Stream JMLR 2018 Norm-Ranging LSH for Maximum Inner Product Search NeurIPS 2018 Private Sequential Learning COLT 2018 Query Complexity of Bayesian Private Learning NeurIPS 2018 Scheduling under Uncertainty: A Query-based Approach IJCAI 2018 The Everlasting Database: Statistical Validity at a Fair Price NeurIPS 2018 A General Characterization of the Statistical Query Complexity COLT 2017 Clustering with Noisy Queries NeurIPS 2017 Graph Verification with a Betweenness Oracle ALT 2017 Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017 Noise-Tolerant Interactive Learning Using Pairwise Comparisons NeurIPS 2017 Query Complexity of Clustering with Side Information NeurIPS 2017 The Power of Random Counterexamples ALT 2017 Active Learning from Imperfect Labelers NeurIPS 2016 Active Learning with Oracle Epiphany NeurIPS 2016 Clustering with Same-Cluster Queries NeurIPS 2016 Interactive Algorithms: from Pool to Stream COLT 2016 Maximization of Approximately Submodular Functions NeurIPS 2016 On the Recursive Teaching Dimension of VC Classes NeurIPS 2016 An Active Learning Framework using Sparse-Graph Codes for Sparse Polynomials and Graph Sketching NeurIPS 2015