← Keywords

learning theory

518 papers

Explore in graph

Co-occurring keywords

generalization bound (649) sample complexity (1158) statistical learning (350) neural network (6616) online learning (1770) gradient descent (1143) stochastic gradient descent (1088) empirical risk minimization (348) convergence rate (606) pac learning (280)

Papers

The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning NIPS 2011
Learning Bounds for Importance Weighting NIPS 2010
On the Theory of Learnining with Privileged Information NIPS 2010
Near-optimal Regret Bounds for Reinforcement Learning JMLR 2010
Stability Bounds for Stationary φ-mixing and β-mixing Processes JMLR 2010
On Finding Predictors for Arbitrary Families of Processes JMLR 2010
Empirical Bernstein Inequalities for U-Statistics NIPS 2010
Tight Sample Complexity of Large-Margin Learning NIPS 2010
A Theory of Multiclass Boosting NIPS 2010
Sample Complexity of Testing the Manifold Hypothesis NIPS 2010
Asymptotically Optimal Regularization in Smooth Parametric Models NIPS 2009
On The Power of Membership Queries in Agnostic Learning JMLR 2009
Fast Learning from Non-i.i.d. Observations NIPS 2009
Consistency and Localizability JMLR 2009
Human Rademacher Complexity NIPS 2009
Discrete MDL Predicts in Total Variation NIPS 2009
Rademacher Complexity Bounds for Non-I.I.D. Processes NIPS 2008
A Moment Bound for Multi-hinge Classifiers JMLR 2008
Learning from Multiple Sources JMLR 2008
Multi-stage Convex Relaxation for Learning with Sparse Regularization NIPS 2008
From Online to Batch Learning with Cutoff-Averaging NIPS 2008
Progressive mixture rules are deviation suboptimal NIPS 2007
Stability Bounds for Non-i.i.d. Processes NIPS 2007
Cluster Stability for Finite Samples NIPS 2007
Separating Models of Learning from Correlated and Uncorrelated Data JMLR 2007