sample complexity

Hardness in Markov Decision Processes: Theory and Practice NeurIPS 2022 Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies COLT 2022 How Much More Data Do I Need? Estimating Requirements for Downstream Tasks CVPR 2022 How Sampling Impacts the Robustness of Stochastic Neural Networks NeurIPS 2022 How to Leverage Unlabeled Data in Offline Reinforcement Learning ICML 2022 How to Reduce Action Space for Planning Domains? (Student Abstract) AAAI 2022 Identifying good directions to escape the NTK regime and efficiently learn low-degree plus sparse polynomials NeurIPS 2022 Identifying near-optimal decisions in linear-in-parameter bandit models with continuous decision sets UAI 2022 Improved Generalization Bounds for Adversarially Robust Learning JMLR 2022 Improved Pure Exploration in Linear Bandits with No-Regret Learning IJCAI 2022 Improved Regret for Differentially Private Exploration in Linear MDP ICML 2022 Independence Testing for Bounded Degree Bayesian Networks NeurIPS 2022 Inductive Biases and Variable Creation in Self-Attention Mechanisms ICML 2022 Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design NeurIPS 2022 Instance-optimal PAC Algorithms for Contextual Bandits NeurIPS 2022 Interactively Learning Preference Constraints in Linear Bandits ICML 2022 Intrinsic Dimension Estimation Using Wasserstein Distance JMLR 2022 Label Ranking through Nonparametric Regression ICML 2022 Lattice-Based Methods Surpass Sum-of-Squares in Clustering COLT 2022 Learning and Covering Sums of Independent Random Variables with Unbounded Support NeurIPS 2022 Learning a Single Neuron with Adversarial Label Noise via Gradient Descent COLT 2022 Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent ICML 2022 Learning in Congestion Games with Bandit Feedback NeurIPS 2022 Learning Influence Adoption in Heterogeneous Networks AAAI 2022 Learning Losses for Strategic Classification AAAI 2022