Sample Complexity

Promises and Pitfalls of Threshold-based Auto-labeling NeurIPS 2023 Quantum Channel Certification with Incoherent Measurements COLT 2023 Revisiting Sample Size Determination in Natural Language Understanding ACL 2023 Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-Free RL ICLR 2023 Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms NeurIPS 2023 Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes COLT 2023 Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models NeurIPS 2023 SQ Lower Bounds for Learning Mixtures of Separated and Bounded Covariance Gaussians COLT 2023 Statistical and Computational Limits for Tensor-on-Tensor Association Detection COLT 2023 The Role of Coverage in Online Reinforcement Learning ICLR 2023 Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient COLT 2023 Toward L_∞Recovery of Nonlinear Functions: A Polynomial Sample Complexity Bound for Gaussian Random Fields COLT 2023 When is Agnostic Reinforcement Learning Statistically Tractable? NeurIPS 2023 A Few Expert Queries Suffices for Sample-Efficient RL with Resets and Linear Value Approximation NeurIPS 2022 Beyond No Regret: Instance-Dependent PAC Reinforcement Learning COLT 2022 Beyond the Best: Distribution Functional Estimation in Infinite-Armed Bandits NeurIPS 2022 Estimation of Entropy in Constant Space with Improved Sample Complexity NeurIPS 2022 Learning and Covering Sums of Independent Random Variables with Unbounded Support NeurIPS 2022 Linear Label Ranking with Bounded Noise NeurIPS 2022 Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes NeurIPS 2022 Near optimal efficient decoding from pooled data COLT 2022 Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver ICLR 2022 Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise COLT 2022 Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals COLT 2022 Offline Reinforcement Learning: Fundamental Barriers for Value Function Approximation COLT 2022