query complexity

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint NeurIPS 2024 Quantum Algorithms and Lower Bounds for Finite-Sum Optimization ICML 2024 Quantum Algorithms for Non-smooth Non-convex Optimization NeurIPS 2024 The Human-AI Substitution game: active learning from a strategic labeler ICLR 2024 Active Ranking of Experts Based on their Performances in Many Tasks ICML 2023 A Query Algorithm for Learning a Spanning Forest in Weighted Undirected Graphs ALT 2023 Bandit Learnability can be Undecidable COLT 2023 Contextual Bandits and Imitation Learning with Preference-Based Active Queries NeurIPS 2023 Curvature and complexity: Better lower bounds for geodesically convex optimization COLT 2023 Does Sparsity Help in Learning Misspecified Linear Bandits? ICML 2023 Efficient Convex Optimization Requires Superlinear Memory (Extended Abstract) IJCAI 2023 Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning AISTATS 2023 From Adaptive Query Release to Machine Unlearning ICML 2023 Identification of Blackwell Optimal Policies for Deterministic MDPs AISTATS 2023 Near-Optimal Quantum Coreset Construction Algorithms for Clustering ICML 2023 On Testing and Learning Quantum Junta Channels COLT 2023 On the complexity of finding stationary points of smooth functions in one dimension ALT 2023 Open Problem: Polynomial linearly-convergent method for g-convex optimization? COLT 2023 Origins of Low-Dimensional Adversarial Perturbations AISTATS 2023 Parallel Submodular Function Minimization NeurIPS 2023 Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal COLT 2023 Quantum Channel Certification with Incoherent Measurements COLT 2023 Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions ICML 2023 Robust Algorithms on Adaptive Inputs from Bounded Adversaries ICLR 2023 Semi-Verified PAC Learning from the Crowd AISTATS 2023