query complexity

Rejection sampling from shape-constrained distributions in sublinear time AISTATS 2022 Scalable and Efficient Non-adaptive Deterministic Group Testing NeurIPS 2022 Semi-supervised Active Linear Regression NeurIPS 2022 TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions ALT 2022 The Query Complexity of Cake Cutting NeurIPS 2022 The Query Complexity of Local Search and Brouwer in Rounds COLT 2022 The query complexity of sampling from strongly log-concave distributions in one dimension COLT 2022 Tight query complexity bounds for learning graph partitions COLT 2022 Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical Systems JMLR 2022 When are Local Queries Useful for Robust Learning? NeurIPS 2022 Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity NeurIPS 2022 Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients NeurIPS 2022 Active Covering ICML 2021 Active Learning of Convex Halfspaces on Graphs NeurIPS 2021 Adaptive Sampling for Fast Constrained Maximization of Submodular Functions AISTATS 2021 A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching AAAI 2021 Average-Case Communication Complexity of Statistical Problems COLT 2021 A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization ICML 2021 Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel NeurIPS 2021 Black-Box Reductions for Zeroth-Order Gradient Algorithms to Achieve Lower Query Complexity JMLR 2021 Bounded Memory Active Learning through Enriched Queries COLT 2021 Efficiently Learning One Hidden Layer ReLU Networks From Queries NeurIPS 2021 Exponential Separation between Two Learning Models and Adversarial Robustness NeurIPS 2021 Finding Optimal Tangent Points for Reducing Distortions of Hard-label Attacks NeurIPS 2021 Keep Your Distance: Land Division With Separation IJCAI 2021