Skip to content
conftrace_

sample complexity

1,587 papers

Papers

Multi-Bandit Best Arm Identification NeurIPS 2011 Multiclass Learnability and the ERM principle COLT 2011 On Learning Discrete Graphical Models using Greedy Methods NeurIPS 2011 Sample Complexity Bounds for Differentially Private Learning COLT 2011 Spectral Methods for Learning Multivariate Latent Tree Structure NeurIPS 2011 The Sample Complexity of Dictionary Learning COLT 2011 The Sample Complexity of Dictionary Learning JMLR 2011 The Sample Complexity of Self-Verifying Bayesian Active Learning AISTATS 2011 Empirical Risk Minimization with Approximations of Probabilistic Grammars NeurIPS 2010 Finite-sample Analysis of Bellman Residual Minimization ACML 2010 Learning Bounds for Importance Weighting NeurIPS 2010 Multi-View Active Learning in the Non-Realizable Case NeurIPS 2010 Online Learning: Random Averages, Combinatorial Parameters, and Learnability NeurIPS 2010 Permutation Complexity Bound on Out-Sample Error NeurIPS 2010 Rademacher Complexities and Bounding the Excess Risk in Active Learning JMLR 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 Two-Layer Generalization Analysis for Ranking Using Rademacher Average NeurIPS 2010 Noisy Generalized Binary Search NeurIPS 2009 Provably Efficient Learning with Typed Parametric Models JMLR 2009 Reinforcement Learning in Finite MDPs: PAC Analysis JMLR 2009 Riffled Independence for Ranked Data NeurIPS 2009 High-dimensional support union recovery in multivariate regression NeurIPS 2008 Phase transitions for high-dimensional joint support recovery NeurIPS 2008