Sample Complexity

Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals NeurIPS 2020 Online Planning with Lookahead Policies NeurIPS 2020 On Suboptimality of Least Squares with Application to Estimation of Convex Bodies COLT 2020 On the Theory of Transfer Learning: The Importance of Task Diversity NeurIPS 2020 Optimal Prediction of the Number of Unseen Species with Multiplicity NeurIPS 2020 Pan-Private Uniformity Testing COLT 2020 Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity NeurIPS 2020 Privately Learning Thresholds: Closing the Exponential Gap COLT 2020 Proper Learning, Helly Number, and an Optimal SVM Bound COLT 2020 Provably efficient reinforcement learning with linear function approximation COLT 2020 Sample complexity and effective dimension for regression on manifolds NeurIPS 2020 Sample Complexity Bounds for RNNs with Application to Combinatorial Graph Problems (Student Abstract) AAAI 2020 Sample Complexity of Uniform Convergence for Multicalibration NeurIPS 2020 The EM Algorithm gives Sample-Optimality for Learning Mixtures of Well-Separated Gaussians COLT 2020 The Influence of Shape Constraints on the Thresholding Bandit Problem COLT 2020 The Power of Comparisons for Actively Learning Linear Classifiers NeurIPS 2020 Worst-Case Analysis for Randomly Collected Data NeurIPS 2020 A General Framework for Symmetric Property Estimation NeurIPS 2019 Almost Horizon-Free Structure-Aware Best Policy Identification with a Generative Model NeurIPS 2019 Characterizing the Sample Complexity of Pure Private Learners JMLR 2019 Estimating Entropy of Distributions in Constant Space NeurIPS 2019 Graph-based Discriminators: Sample Complexity and Expressiveness NeurIPS 2019 Limits of Private Learning with Access to Public Data NeurIPS 2019 Multiclass Learning from Contradictions NeurIPS 2019 On Mean Estimation for General Norms with Statistical Queries COLT 2019