← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Reinforcement Learning in Finite MDPs: PAC Analysis JMLR 2009
On The Power of Membership Queries in Agnostic Learning JMLR 2009
Provably Efficient Learning with Typed Parametric Models JMLR 2009
Nearly Uniform Validation Improves Compression-Based Error Bounds JMLR 2008
Sparsity of SVMs that use the epsilon-insensitive loss NIPS 2008
Learning from Multiple Sources JMLR 2008
Aggregation of SVM Classifiers Using Sobolev Spaces JMLR 2008
Look Ma, No Hands: Analyzing the Monotonic Feature Abstraction for Text Classification NIPS 2008
Exact Convex Confidence-Weighted Learning NIPS 2008
Human Active Learning NIPS 2008
On the Generalization Ability of Online Strongly Convex Programming Algorithms NIPS 2008
Risk Bounds for Randomized Sample Compressed Classifiers NIPS 2008
Near-optimal Regret Bounds for Reinforcement Learning NIPS 2008
Learning with Consistency between Inductive Functions and Kernels NIPS 2008
From Online to Batch Learning with Cutoff-Averaging NIPS 2008
Learning Balls of Strings from Edit Corrections JMLR 2008
Using Markov Blankets for Causal Structure Learning JMLR 2008
Resolution Limits of Sparse Coding in High Dimensions NIPS 2008
Fast Rates for Regularized Objectives NIPS 2008
Theory of matching pursuit NIPS 2008
On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor NIPS 2008
Inferring rankings under constrained sensing NIPS 2008
Mind the Duality Gap: Logarithmic regret algorithms for online optimization NIPS 2008
Algorithms for Infinitely Many-Armed Bandits NIPS 2008
Rademacher Complexity Bounds for Non-I.I.D. Processes NIPS 2008