sample complexity

Testification of Condorcet Winners in dueling bandits UAI 2021 Testing Product Distributions: A Closer Look ALT 2021 The Effect of the Intrinsic Dimension on the Generalization of Quadratic Classifiers NeurIPS 2021 The Sample Complexity of Level Set Approximation AISTATS 2021 The Sample Complexity of Meta Sparse Regression AISTATS 2021 The Sample Complexity of Robust Covariance Testing COLT 2021 The Sample Complexity of Teaching by Reinforcement on Q-Learning AAAI 2021 The Teaching Dimension of Kernel Perceptron AISTATS 2021 Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning ICML 2021 Tighter Expected Generalization Error Bounds via Wasserstein Distance NeurIPS 2021 Top-m identification for linear bandits AISTATS 2021 Toward Better Generalization Bounds with Locally Elastic Stability ICML 2021 Towards Instance-Optimal Offline Reinforcement Learning with Pessimism NeurIPS 2021 Towards Sample-efficient Overparameterized Meta-learning NeurIPS 2021 Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors NeurIPS 2021 Towards Tight Bounds on the Sample Complexity of Average-reward MDPs ICML 2021 Uncertain Decisions Facilitate Better Preference Learning NeurIPS 2021 Variance-dependent best arm identification UAI 2021 Weak learning convex sets under normal distributions COLT 2021 What are the Statistical Limits of Offline RL with Linear Function Approximation? ICLR 2021 What Matters for Adversarial Imitation Learning? NeurIPS 2021 Why Are Convolutional Nets More Sample-Efficient than Fully-Connected Nets? ICLR 2021 Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Sparse Neural Networks NeurIPS 2021 A Computational Separation between Private Learning and Online Learning NeurIPS 2020 Active Model Estimation in Markov Decision Processes UAI 2020