Sample Complexity

Structured Estimation with Atomic Norms: General Bounds and Applications NeurIPS 2015 Unified View of Matrix Completion under General Structural Constraints NeurIPS 2015 Combinatorial Pure Exploration of Multi-Armed Bandits NeurIPS 2014 Near-optimal sample compression for nearest neighbors NeurIPS 2014 Optimistic Planning in Markov Decision Processes Using a Generative Model NeurIPS 2014 Time--Data Tradeoffs by Aggressive Smoothing NeurIPS 2014 Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NeurIPS 2013 Eluder Dimension and the Sample Complexity of Optimistic Exploration NeurIPS 2013 More data speeds up training time in learning halfspaces over sparse vectors NeurIPS 2013 On the Sample Complexity of Subspace Learning NeurIPS 2013 Phase Retrieval using Alternating Minimization NeurIPS 2013 Dimensionality Dependent PAC-Bayes Margin Bound NeurIPS 2012 Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs NeurIPS 2012 Near-optimal Differentially Private Principal Components NeurIPS 2012 On the Sample Complexity of Robust PCA NeurIPS 2012 Provable ICA with Unknown Gaussian Noise, with Implications for Gaussian Mixtures and Autoencoders NeurIPS 2012 Scalable Training of Mixture Models via Coresets NeurIPS 2011 Spectral Methods for Learning Multivariate Latent Tree Structure NeurIPS 2011 Multi-View Active Learning in the Non-Realizable Case NeurIPS 2010 Rates of convergence for the cluster tree NeurIPS 2010 Sample Complexity of Testing the Manifold Hypothesis NeurIPS 2010 Tight Sample Complexity of Large-Margin Learning NeurIPS 2010 Lower bounds on minimax rates for nonparametric regression with additive sparsity and smoothness NeurIPS 2009 Noisy Generalized Binary Search NeurIPS 2009 Sufficient Conditions for Agnostic Active Learnable NeurIPS 2009