Learning Theory

On the Universality of Online Mirror Descent NeurIPS 2011 On U-processes and clustering performance NeurIPS 2011 Optimal learning rates for least squares SVMs using Gaussian kernels NeurIPS 2011 PAC-Bayesian Analysis of Contextual Bandits NeurIPS 2011 Prediction strategies without loss NeurIPS 2011 Regret Bounds for the Adaptive Control of Linear Quadratic Systems COLT 2011 Sample Complexity Bounds for Differentially Private Learning COLT 2011 Selecting the State-Representation in Reinforcement Learning NeurIPS 2011 Sequence learning with hidden units in spiking neural networks NeurIPS 2011 Shallow vs. Deep Sum-Product Networks NeurIPS 2011 Smoothness, Disagreement Coefficient, and the Label Complexity of Agnostic Active Learning JMLR 2011 Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011 Speedy Q-Learning NeurIPS 2011 Statistical Tests for Optimization Efficiency NeurIPS 2011 Stochastic convex optimization with bandit feedback NeurIPS 2011 The Fast Convergence of Boosting NeurIPS 2011 The Impact of Unlabeled Patterns in Rademacher Complexity Theory for Kernel Classifiers NeurIPS 2011 The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning NeurIPS 2011 The Sample Complexity of Dictionary Learning COLT 2011 The Sample Complexity of Dictionary Learning JMLR 2011 Unifying Framework for Fast Learning Rate of Non-Sparse Multiple Kernel Learning NeurIPS 2011 Weisfeiler-Lehman Graph Kernels JMLR 2011 Agnostic Active Learning Without Constraints NeurIPS 2010 An analysis on negative curvature induced by singularity in multi-layer neural-network learning NeurIPS 2010 A Reduction from Apprenticeship Learning to Classification NeurIPS 2010