sample complexity

Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems COLT 2017 Minimizing a Submodular Function from Samples NeurIPS 2017 Mixing Implies Lower Bounds for Space Bounded Learning COLT 2017 Monte-Carlo Tree Search by Best Arm Identification NeurIPS 2017 Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection AISTATS 2017 Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017 Optimal Sample Complexity of M-wise Data for Top-K Ranking NeurIPS 2017 Phase Transitions in the Pooled Data Problem NeurIPS 2017 Preference-based Teaching of Unions of Geometric Objects ALT 2017 Priv’IT: Private and Sample Efficient Identity Testing ICML 2017 Rank Aggregation and Prediction with Item Features AISTATS 2017 Recovery Guarantees for One-hidden-layer Neural Networks ICML 2017 Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces NeurIPS 2017 Robust and Proper Learning for Mixtures of Gaussians via Systems of Polynomial Inequalities COLT 2017 Sample complexity of population recovery COLT 2017 Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing COLT 2017 Statistical Cost Sharing NeurIPS 2017 Structured Best Arm Identification with Fixed Confidence ALT 2017 Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues NeurIPS 2017 Testing Bayesian Networks COLT 2017 The Sample Complexity of Online One-Class Collaborative Filtering ICML 2017 The Sample Complexity of Optimizing a Convex Function COLT 2017 The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime COLT 2017 Towards Instance Optimal Bounds for Best Arm Identification COLT 2017 Accurate Robust and Efficient Error Estimation for Decision Trees ICML 2016