conftrace_

query complexity

183 papers

Explore in graph

Co-occurring keywords

active learning (1301) combinatorial optimization (1039) learning theory (519) approximation algorithm (630) multi-armed bandit (1098) pac learning (283) submodular maximization (143) adversarial attack (1621) regret bound (1926) lower bound (173)

Papers

Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond NIPS 2022
When are Local Queries Useful for Robust Learning? NIPS 2022
TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions ALT 2022
Learning Low Degree Hypergraphs COLT 2022
Near optimal efficient decoding from pooled data COLT 2022
The Query Complexity of Local Search and Brouwer in Rounds COLT 2022
Tight query complexity bounds for learning graph partitions COLT 2022
Optimal query complexity for private sequential learning against eavesdropping AISTATS 2021
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel NIPS 2021
Keep Your Distance: Land Division With Separation IJCAI 2021
Query Complexity of Adversarial Attacks ICML 2021
Active Covering ICML 2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions AISTATS 2021
Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss COLT 2021
A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization ICML 2021
Exponential Separation between Two Learning Models and Adversarial Robustness NIPS 2021
Optimal Sketching for Trace Estimation NIPS 2021
Teaching an Active Learner with Contrastive Examples NIPS 2021
On learning sparse vectors from mixture of responses NIPS 2021
Active Learning of Convex Halfspaces on Graphs NIPS 2021
On Margin-Based Cluster Recovery with Oracle Queries NIPS 2021
Bounded Memory Active Learning through Enriched Queries COLT 2021
Quantum Exploration Algorithms for Multi-Armed Bandits AAAI 2021
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021
Efficiently Learning One Hidden Layer ReLU Networks From Queries NIPS 2021