query complexity

Sorting and Hypergraph Orientation under Uncertainty with Predictions IJCAI 2023 SQ Lower Bounds for Learning Mixtures of Separated and Bounded Covariance Gaussians COLT 2023 Testing of Index-Invariant Properties in the Huge Object Model COLT 2023 The Computational Complexity of Finding Stationary Points in Non-Convex Optimization COLT 2023 The Power of Uniform Sampling for k-Median ICML 2023 Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games NeurIPS 2023 Accelerated Zeroth-Order and First-Order Momentum Methods from Mini to Minimax Optimization JMLR 2022 Active Learning of Classifiers with Label and Seed Queries NeurIPS 2022 Active Learning Polynomial Threshold Functions NeurIPS 2022 A query-optimal algorithm for finding counterfactuals ICML 2022 Bayesian Auctions with Efficient Queries (Extended Abstract) IJCAI 2022 Clustering with Queries under Semi-Random Noise COLT 2022 Confident Approximate Policy Iteration for Efficient Local Planning in q^π-realizable MDPs NeurIPS 2022 Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond NeurIPS 2022 Efficient Convex Optimization Requires Superlinear Memory COLT 2022 Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active Queries ICML 2022 How to Robustify Black-Box ML Models? A Zeroth-Order Optimization Perspective ICLR 2022 Learning Low Degree Hypergraphs COLT 2022 Near optimal efficient decoding from pooled data COLT 2022 Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals COLT 2022 On Scalable Testing of Samplers NeurIPS 2022 Optimal Clustering with Noisy Queries via Multi-Armed Bandit ICML 2022 Optimal Query Complexities for Dynamic Trace Estimation NeurIPS 2022 PAC Top-k Identification under SST in Limited Rounds AISTATS 2022 Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning NeurIPS 2022