sample complexity

On Projection Robust Optimal Transport: Sample Complexity and Model Misspecification AISTATS 2021 On Reward-Free RL with Kernel and Neural Function Approximations: Single-Agent MDP and Markov Game ICML 2021 On the Bias-Variance-Cost Tradeoff of Stochastic Optimization NeurIPS 2021 On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method NeurIPS 2021 On the Hardness of Robust Classification JMLR 2021 On the High Accuracy Limitation of Adaptive Property Estimation AISTATS 2021 On the Sample Complexity of Learning under Geometric Stability NeurIPS 2021 On the Sample Complexity of Privately Learning Axis-Aligned Rectangles NeurIPS 2021 On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians ALT 2021 Optimal Algorithms for Range Searching over Multi-Armed Bandits IJCAI 2021 Optimal Streaming Algorithms for Multi-Armed Bandits ICML 2021 Optimal Uniform OPE and Model-based Offline Reinforcement Learning in Time-Homogeneous, Reward-Free and Task-Agnostic Settings NeurIPS 2021 Policy Finetuning: Bridging Sample-Efficient Offline and Online Reinforcement Learning NeurIPS 2021 Predicting What You Already Know Helps: Provable Self-Supervised Learning NeurIPS 2021 Predictive Learning on Hidden Tree-Structured Ising Models JMLR 2021 Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates ICML 2021 Provable Meta-Learning of Linear Representations ICML 2021 Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature NeurIPS 2021 Provable Rich Observation Reinforcement Learning with Combinatorial Latent States ICLR 2021 Pure Exploration in Kernel and Neural Bandits NeurIPS 2021 Quantum algorithms for reinforcement learning with a generative model ICML 2021 Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation NeurIPS 2021 Robust and Private Learning of Halfspaces AISTATS 2021 Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free ICML 2021 Robust Learning of Optimal Auctions NeurIPS 2021