query complexity

Optimal Query Complexity of Secure Stochastic Convex Optimization NeurIPS 2020 Optimal Sequential Maximization: One Interview is Enough! ICML 2020 Parallel Algorithm for Non-Monotone DR-Submodular Maximization ICML 2020 Recovery of sparse linear classifiers from mixture of responses NeurIPS 2020 Recovery of Sparse Signals from a Mixture of Linear Samples ICML 2020 Reducing Adversarially Robust Learning to Non-Robust PAC Learning NeurIPS 2020 Scalable and Efficient Comparison-based Search without Features ICML 2020 Streaming k-Submodular Maximization under Noise subject to Size Constraint ICML 2020 The Gradient Complexity of Linear Regression COLT 2020 HS^2: Active learning over hypergraphs with pointwise and pairwise queries AISTATS 2019 Adaptive Exact Learning of Decision Trees from Membership Queries ALT 2019 Correlation Clustering with Adaptive Similarity Queries NeurIPS 2019 Efficient Pure Exploration in Adaptive Round model NeurIPS 2019 Fairly Allocating Many Goods with Few Queries AAAI 2019 Flattening a Hierarchical Clustering through Active Learning NeurIPS 2019 Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization ICML 2019 Learning Erdos-Renyi Random Graphs via Edge Detecting Queries NeurIPS 2019 Learning Nearest Neighbor Graphs from Noisy Distance Samples NeurIPS 2019 Low Frequency Adversarial Perturbation UAI 2019 Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity ICML 2019 On Learning Graphs with Edge-Detecting Queries ALT 2019 On Mean Estimation for General Norms with Statistical Queries COLT 2019 On the Design of Black-Box Adversarial Examples by Leveraging Gradient-Free Optimization and Operator Splitting Method ICCV 2019 Open Problem: Do Good Algorithms Necessarily Query Bad Points? COLT 2019 Rapid Performance Gain through Active Model Reuse IJCAI 2019