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

Progressive mixture rules are deviation suboptimal NIPS 2007
Learnability of Gaussians with Flexible Variances JMLR 2007
Separating Models of Learning from Correlated and Uncorrelated Data JMLR 2007
Dynamics and Generalization Ability of LVQ Algorithms JMLR 2007
Sparseness vs Estimating Conditional Probabilities: Some Asymptotic Results JMLR 2007
Combining PAC-Bayesian and Generic Chaining Bounds JMLR 2007
From External to Internal Regret JMLR 2007
Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions JMLR 2007
On the Effectiveness of Laplacian Normalization for Graph Semi-supervised Learning JMLR 2007
Polynomial Identification in the Limit of Substitutable Context-free Languages JMLR 2007
Unlabeled Compression Schemes for Maximum Classes JMLR 2007
AdaBoost is Consistent JMLR 2007
Revised Loss Bounds for the Set Covering Machine and Sample-Compression Loss Bounds for Imbalanced Data JMLR 2007
VC Theory of Large Margin Multi-Category Classifiers JMLR 2007
Temporal Coding using the Response Properties of Spiking Neurons NIPS 2006
Active learning for misspecified generalized linear models NIPS 2006
Tighter PAC-Bayes Bounds NIPS 2006
Stability of $K$-Means Clustering NIPS 2006
On Transductive Regression NIPS 2006
PAC-Bayes Bounds for the Risk of the Majority Vote and the Variance of the Gibbs Classifier NIPS 2006
Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds NIPS 2006
Attribute-efficient learning of decision lists and linear threshold functions under unconcentrated distributions NIPS 2006
AdaBoost is Consistent NIPS 2006
Fundamental Limitations of Spectral Clustering NIPS 2006
Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning NIPS 2006