sample complexity

Almost Horizon-Free Structure-Aware Best Policy Identification with a Generative Model NeurIPS 2019 A Theoretical Analysis of Contrastive Unsupervised Representation Learning ICML 2019 Attribute-efficient learning of monomials over highly-correlated variables ALT 2019 Average Case Column Subset Selection for Entrywise ℓ_1-Norm Loss NeurIPS 2019 Best Arm Identification for Contaminated Bandits JMLR 2019 Characterizing the Sample Complexity of Pure Private Learners JMLR 2019 Communication and Memory Efficient Testing of Discrete Distributions COLT 2019 Data-dependent Sample Complexity of Deep Neural Networks via Lipschitz Augmentation NeurIPS 2019 Differentially Private Algorithms for Learning Mixtures of Separated Gaussians NeurIPS 2019 Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm COLT 2019 Efficient Lifelong Learning with A-GEM ICLR 2019 Efficiently Learning Fourier Sparse Set Functions NeurIPS 2019 Estimating Entropy of Distributions in Constant Space NeurIPS 2019 Explicit Explore-Exploit Algorithms in Continuous State Spaces NeurIPS 2019 Exploring k out of Top ρ Fraction of Arms in Stochastic Bandits AISTATS 2019 Finite-time Analysis of Approximate Policy Iteration for the Linear Quadratic Regulator NeurIPS 2019 Generalization Bounds for Neural Networks via Approximate Description Length NeurIPS 2019 Graph-based Discriminators: Sample Complexity and Expressiveness NeurIPS 2019 Hessian Aided Policy Gradient ICML 2019 How Hard is Robust Mean Estimation? COLT 2019 How Many Pairwise Preferences Do We Need to Rank a Graph Consistently? AAAI 2019 Inference under Information Constraints: Lower Bounds from Chi-Square Contraction COLT 2019 Iterative Classroom Teaching AAAI 2019 Iterative Least Trimmed Squares for Mixed Linear Regression NeurIPS 2019 Learning Distributions Generated by One-Layer ReLU Networks NeurIPS 2019