Sample Complexity

On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons NeurIPS 2019 Structure Learning with Side Information: Sample Complexity NeurIPS 2019 Data Amplification: A Unified and Competitive Approach to Property Estimation NeurIPS 2018 Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity NeurIPS 2018 Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes NeurIPS 2018 On Oracle-Efficient PAC RL with Rich Observations NeurIPS 2018 Query Complexity of Bayesian Private Learning NeurIPS 2018 Tight Bounds for Collaborative PAC Learning via Multiplicative Weights NeurIPS 2018 A Sample Complexity Measure with Applications to Learning Optimal Auctions NeurIPS 2017 Optimal Sample Complexity of M-wise Data for Top-K Ranking NeurIPS 2017 Phase Transitions in the Pooled Data Problem NeurIPS 2017 Adaptive Concentration Inequalities for Sequential Decision Problems NeurIPS 2016 Dimension-Free Iteration Complexity of Finite Sum Optimization Problems NeurIPS 2016 Finite-Sample Analysis of Fixed-k Nearest Neighbor Density Functional Estimators NeurIPS 2016 PAC Reinforcement Learning with Rich Observations NeurIPS 2016 The Power of Adaptivity in Identifying Statistical Alternatives NeurIPS 2016 Beyond Sub-Gaussian Measurements: High-Dimensional Structured Estimation with Sub-Exponential Designs NeurIPS 2015 Fast Randomized Kernel Ridge Regression with Statistical Guarantees NeurIPS 2015 Learnability of Influence in Networks NeurIPS 2015 On the Pseudo-Dimension of Nearly Optimal Auctions NeurIPS 2015 On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NeurIPS 2015 Optimal Testing for Properties of Distributions NeurIPS 2015 Sample Complexity Bounds for Iterative Stochastic Policy Optimization NeurIPS 2015 Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning NeurIPS 2015 Sample Complexity of Learning Mahalanobis Distance Metrics NeurIPS 2015