Poster "query complexity" Papers
10 papers found
Discovering Data Structures: Nearest Neighbor Search and Beyond
Omar Salemohamed, Laurent Charlin, Shivam Garg et al.
NeurIPS 2025posterarXiv:2411.03253
Efficient Preference-Based Reinforcement Learning: Randomized Exploration meets Experimental Design
Andreas Schlaginhaufen, Reda Ouhamma, Maryam Kamgarpour
NeurIPS 2025posterarXiv:2506.09508
1
citations
Near-optimal Active Regression of Single-Index Models
Yi Li, Wai Ming Tai
ICLR 2025posterarXiv:2502.18213
1
citations
Oracle efficient truncated statistics
Konstantinos Karatapanis, Vasilis Kontonis, Christos Tzamos
ICLR 2025poster
Robust Regression of General ReLUs with Queries
Ilias Diakonikolas, Daniel Kane, Mingchen Ma
NeurIPS 2025poster
Tight Bounds for Answering Adaptively Chosen Concentrated Queries
Emma Rapoport, Edith Cohen, Uri Stemmer
NeurIPS 2025posterarXiv:2507.13700
A Dynamic Algorithm for Weighted Submodular Cover Problem
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi et al.
ICML 2024poster
Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization
Ruizhong Qiu, Hanghang Tong
ICML 2024poster
Riemannian Accelerated Zeroth-order Algorithm: Improved Robustness and Lower Query Complexity
Chang He, Zhaoye Pan, Xiao Wang et al.
ICML 2024poster
Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
Sara Ahmadian, Edith Cohen
ICML 2024poster