"query complexity" Papers
13 papers found
Conference
Agnostic Active Learning Is Always Better Than Passive Learning
Steve Hanneke
NEURIPS 2025oral
Discovering Data Structures: Nearest Neighbor Search and Beyond
Omar Salemohamed, Laurent Charlin, Shivam Garg et al.
NEURIPS 2025arXiv:2411.03253
Efficient Preference-Based Reinforcement Learning: Randomized Exploration meets Experimental Design
Andreas Schlaginhaufen, Reda Ouhamma, Maryam Kamgarpour
NEURIPS 2025arXiv:2506.09508
3
citations
From Counterfactuals to Trees: Competitive Analysis of Model Extraction Attacks
Awa Khouna, Julien Ferry, Thibaut Vidal
NEURIPS 2025spotlightarXiv:2502.05325
1
citations
Near-optimal Active Regression of Single-Index Models
Yi Li, Wai Ming Tai
ICLR 2025arXiv:2502.18213
1
citations
Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
Tongyang Li, Xinzhao Wang, Yexin Zhang
NEURIPS 2025arXiv:2510.16782
Oracle efficient truncated statistics
Konstantinos Karatapanis, Vasilis Kontonis, Christos Tzamos
ICLR 2025
Robust Regression of General ReLUs with Queries
Ilias Diakonikolas, Daniel Kane, Mingchen Ma
NEURIPS 2025
Tight Bounds for Answering Adaptively Chosen Concentrated Queries
Emma Rapoport, Edith Cohen, Uri Stemmer
NEURIPS 2025arXiv:2507.13700
A Dynamic Algorithm for Weighted Submodular Cover Problem
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi et al.
ICML 2024arXiv:2407.10003
2
citations
Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization
Ruizhong Qiu, Hanghang Tong
ICML 2024arXiv:2405.16805
11
citations
Riemannian Accelerated Zeroth-order Algorithm: Improved Robustness and Lower Query Complexity
Chang He, Zhaoye Pan, Xiao Wang et al.
ICML 2024arXiv:2405.05713
8
citations
Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
Sara Ahmadian, Edith Cohen
ICML 2024arXiv:2405.17780
6
citations