Learning Theory

Learning Factor Graphs in Polynomial Time and Sample Complexity JMLR 2006 Learning the Structure of Linear Latent Variable Models JMLR 2006 Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning NeurIPS 2006 On Model Selection Consistency of Lasso JMLR 2006 On the Complexity of Learning Lexicographic Strategies JMLR 2006 On Transductive Regression NeurIPS 2006 PAC-Bayes Bounds for the Risk of the Majority Vote and the Variance of the Gibbs Classifier NeurIPS 2006 Pattern Recognition for Conditionally Independent Data JMLR 2006 Prediction on a Graph with a Perceptron NeurIPS 2006 Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension NeurIPS 2006 Sample Complexity of Policy Search with Known Dynamics NeurIPS 2006 Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds NeurIPS 2006 Some Discriminant-Based PAC Algorithms JMLR 2006 Stability of K-Means Clustering NeurIPS 2006 Stability Properties of Empirical Risk Minimization over Donsker Classes JMLR 2006 Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition JMLR 2006 Temporal Coding using the Response Properties of Spiking Neurons NeurIPS 2006 Tighter PAC-Bayes Bounds NeurIPS 2006 Toward Attribute Efficient Learning of Decision Lists and Parities JMLR 2006 Adaptive Online Prediction by Following the Perturbed Leader JMLR 2005 A Generalization Error for Q-Learning JMLR 2005 Algorithmic Stability and Meta-Learning JMLR 2005 Analysis of Variance of Cross-Validation Estimators of the Generalization Error JMLR 2005 Concentration Bounds for Unigram Language Models JMLR 2005 Convergence Theorems for Generalized Alternating Minimization Procedures JMLR 2005