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

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization COLT 2023
Origins of Low-Dimensional Adversarial Perturbations AISTATS 2023
Identification of Blackwell Optimal Policies for Deterministic MDPs AISTATS 2023
Near-Optimal Quantum Coreset Construction Algorithms for Clustering ICML 2023
From Adaptive Query Release to Machine Unlearning ICML 2023
PAC Top-$k$ Identification under SST in Limited Rounds AISTATS 2022
Near optimal efficient decoding from pooled data COLT 2022
Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning NIPS 2022
The Query Complexity of Cake Cutting NIPS 2022
On Scalable Testing of Samplers NIPS 2022
Learning Low Degree Hypergraphs COLT 2022
Optimal Clustering with Noisy Queries via Multi-Armed Bandit ICML 2022
Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active Queries ICML 2022
TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions ALT 2022
Confident Approximate Policy Iteration for Efficient Local Planning in $q^\pi$-realizable MDPs NIPS 2022
Rejection sampling from shape-constrained distributions in sublinear time AISTATS 2022
Accelerated Zeroth-Order and First-Order Momentum Methods from Mini to Minimax Optimization JMLR 2022
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond NIPS 2022
A query-optimal algorithm for finding counterfactuals ICML 2022
Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity NIPS 2022
When are Local Queries Useful for Robust Learning? NIPS 2022
Scalable and Efficient Non-adaptive Deterministic Group Testing NIPS 2022
Bayesian Auctions with Efficient Queries (Extended Abstract) IJCAI 2022
Active Learning Polynomial Threshold Functions NIPS 2022
Optimal Query Complexities for Dynamic Trace Estimation NIPS 2022