conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,334 papers

Papers per year

17
66
123
466
307
'05
'10
'15
'20
'25

Papers

From Online to Batch Learning with Cutoff-Averaging NIPS 2008
Linear Classification and Selective Sampling Under Low Noise Conditions NIPS 2008
Unlabeled data: Now it helps, now it doesn't NIPS 2008
Domain Adaptation with Multiple Sources NIPS 2008
Weighted Sums of Random Kitchen Sinks: Replacing minimization with randomization in learning NIPS 2008
Inferring rankings under constrained sensing NIPS 2008
Algorithms for Infinitely Many-Armed Bandits NIPS 2008
On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor NIPS 2008
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization NIPS 2008
Exact Convex Confidence-Weighted Learning NIPS 2008
Look Ma, No Hands: Analyzing the Monotonic Feature Abstraction for Text Classification NIPS 2008
Theory of matching pursuit NIPS 2008
Rademacher Complexity Bounds for Non-I.I.D. Processes NIPS 2008
Resolution Limits of Sparse Coding in High Dimensions NIPS 2008
Learning with Consistency between Inductive Functions and Kernels NIPS 2008
Posterior Consistency of the Silverman g-prior in Bayesian Model Choice NIPS 2008
Fast Rates for Regularized Objectives NIPS 2008
Mind the Duality Gap: Logarithmic regret algorithms for online optimization NIPS 2008
Sparsity of SVMs that use the epsilon-insensitive loss NIPS 2008
A Transductive Bound for the Voted Classifier with an Application to Semi-supervised Learning NIPS 2008
Near-optimal Regret Bounds for Reinforcement Learning NIPS 2008
Risk Bounds for Randomized Sample Compressed Classifiers NIPS 2008
On the Generalization Ability of Online Strongly Convex Programming Algorithms NIPS 2008
Human Active Learning NIPS 2008
Finite-Time Bounds for Fitted Value Iteration JMLR 2008