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

Equivalence Testing: The Power of Bounded Adaptivity AISTATS 2024
On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries NIPS 2024
Learning Sampling Policy to Achieve Fewer Queries for Zeroth-Order Optimization AISTATS 2024
Learning Hypertrees From Shortest Path Queries ALT 2024
No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation NIPS 2024
Quantum Algorithms for Non-smooth Non-convex Optimization NIPS 2024
Cumulative Regret Analysis of the Piyavskii–Shubert Algorithm and Its Variants for Global Optimization AAAI 2024
Contextual Active Model Selection NIPS 2024
Active Ranking of Experts Based on their Performances in Many Tasks ICML 2023
Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning AISTATS 2023
Efficient Convex Optimization Requires Superlinear Memory (Extended Abstract) IJCAI 2023
From Adaptive Query Release to Machine Unlearning ICML 2023
On Testing and Learning Quantum Junta Channels COLT 2023
Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games NIPS 2023
Origins of Low-Dimensional Adversarial Perturbations AISTATS 2023
SQ Lower Bounds for Learning Mixtures of Separated and Bounded Covariance Gaussians COLT 2023
Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal COLT 2023
Parallel Submodular Function Minimization NIPS 2023
Bandit Learnability can be Undecidable COLT 2023
A Query Algorithm for Learning a Spanning Forest in Weighted Undirected Graphs ALT 2023
Near-Optimal Quantum Coreset Construction Algorithms for Clustering ICML 2023
On the complexity of finding stationary points of smooth functions in one dimension ALT 2023
Semi-Verified PAC Learning from the Crowd AISTATS 2023
Does Sparsity Help in Learning Misspecified Linear Bandits? ICML 2023
Contextual Bandits and Imitation Learning with Preference-Based Active Queries NIPS 2023