query complexity

Learner-Private Convex Optimization ICML 2021 Learning and testing junta distributions with sub cube conditioning COLT 2021 Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021 On learning sparse vectors from mixture of responses NeurIPS 2021 On Margin-Based Cluster Recovery with Oracle Queries NeurIPS 2021 On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function COLT 2021 Optimal query complexity for private sequential learning against eavesdropping AISTATS 2021 Optimal Sketching for Trace Estimation NeurIPS 2021 Quantum Exploration Algorithms for Multi-Armed Bandits AAAI 2021 Query Complexity of Adversarial Attacks ICML 2021 Query complexity of least absolute deviation regression via robust uniform convergence COLT 2021 Teaching an Active Learner with Contrastive Examples NeurIPS 2021 Teaching via Best-Case Counterexamples in the Learning-with-Equivalence-Queries Paradigm NeurIPS 2021 Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss COLT 2021 Toward a General Theory of Online Selective Sampling: Trading Off Mistakes and Queries AISTATS 2021 Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle COLT 2021 When Is Generalizable Reinforcement Learning Tractable? NeurIPS 2021 Active Local Learning COLT 2020 A Frank-Wolfe Framework for Efficient and Effective Adversarial Attacks AAAI 2020 Black-Box Methods for Restoring Monotonicity ICML 2020 Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems AAAI 2020 Chain Length and CSPs Learnable with Few Queries AAAI 2020 Costly Zero Order Oracles COLT 2020 Diameter-based Interactive Structure Discovery AISTATS 2020 Optimal multiclass overfitting by sequence reconstruction from Hamming queries ALT 2020