sample complexity

On the Recursive Teaching Dimension of VC Classes NeurIPS 2016 Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture COLT 2016 Optimal Best Arm Identification with Fixed Confidence COLT 2016 Optimal Learning for Multi-pass Stochastic Gradient Methods NeurIPS 2016 Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables COLT 2016 PAC Lower Bounds and Efficient Algorithms for The Max K-Armed Bandit Problem ICML 2016 Pareto Front Identification from Stochastic Bandit Feedback AISTATS 2016 Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NeurIPS 2016 Pure Exploration of Multi-armed Bandit Under Matroid Constraints COLT 2016 Random Forest for the Contextual Bandit Problem AISTATS 2016 Refined Error Bounds for Several Learning Algorithms JMLR 2016 Sample Complexity of Automated Mechanism Design NeurIPS 2016 Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja’s Algorithm COLT 2016 Subspace Learning with Partial Information JMLR 2016 The Optimal Sample Complexity of PAC Learning JMLR 2016 The Power of Adaptivity in Identifying Statistical Alternatives NeurIPS 2016 The Power of Optimization from Samples NeurIPS 2016 Algorithmic Stability and Uniform Generalization NeurIPS 2015 An Almost Optimal PAC Algorithm COLT 2015 A Nearly-Linear Time Framework for Graph-Structured Sparsity ICML 2015 A New Look at Nearest Neighbours: Identifying Benign Input Geometries via Random Projections ACML 2015 Beyond Sub-Gaussian Measurements: High-Dimensional Structured Estimation with Sub-Exponential Designs NeurIPS 2015 Competitive Distribution Estimation: Why is Good-Turing Good NeurIPS 2015 CUR Algorithm for Partially Observed Matrices ICML 2015 Differentially Private Learning of Structured Discrete Distributions NeurIPS 2015