query complexity

Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity AAAI 2025 Accelerating Matroid Optimization through Fast Imprecise Oracles NeurIPS 2024 Active Classification with Few Queries under Misspecification NeurIPS 2024 Active Learning of General Halfspaces: Label Queries vs Membership Queries NeurIPS 2024 Active Learning with Simple Questions COLT 2024 A Dynamic Algorithm for Weighted Submodular Cover Problem ICML 2024 Auditing Local Explanations is Hard NeurIPS 2024 Binary Search with Distributional Predictions NeurIPS 2024 Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization COLT 2024 Clustering with Non-adaptive Subset Queries NeurIPS 2024 Contextual Active Model Selection NeurIPS 2024 Cumulative Regret Analysis of the Piyavskii–Shubert Algorithm and Its Variants for Global Optimization AAAI 2024 Equivalence Testing: The Power of Bounded Adaptivity AISTATS 2024 Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization ICML 2024 HyPA-RAG: A Hybrid Parameter Adaptive Retrieval-Augmented Generation System for AI Legal and Policy Applications EMNLP 2024 Learning Hypertrees From Shortest Path Queries ALT 2024 Learning Sampling Policy to Achieve Fewer Queries for Zeroth-Order Optimization AISTATS 2024 Learning Thresholds with Latent Values and Censored Feedback ICLR 2024 Making RL with Preference-based Feedback Efficient via Randomization ICLR 2024 Metric Clustering and MST with Strong and Weak Distance Oracles COLT 2024 Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss ICLR 2024 No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation NeurIPS 2024 Online Learning with Sublinear Best-Action Queries NeurIPS 2024 On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries NeurIPS 2024 Optimal Algorithms for Learning Partitions with Faulty Oracles NeurIPS 2024