generalization bound

Semi-Supervised Learning with Adversarially Missing Label Information NeurIPS 2010 Smoothness, Low Noise and Fast Rates NeurIPS 2010 Stability Bounds for Stationary φ-mixing and β-mixing Processes JMLR 2010 Sufficient Conditions for Generating Group Level Sparsity in a Robust Minimax Framework NeurIPS 2010 Two-Layer Generalization Analysis for Ranking Using Rademacher Average NeurIPS 2010 Generalization Bounds for Ranking Algorithms via Algorithmic Stability JMLR 2009 Human Rademacher Complexity NeurIPS 2009 Learning from Multiple Partially Observed Views - an Application to Multilingual Text Categorization NeurIPS 2009 The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List JMLR 2009 Universal Kernel-Based Learning with Applications to Regular Languages JMLR 2009 Fast Rates for Regularized Objectives NeurIPS 2008 Generalization from Observed to Unobserved Features by Clustering JMLR 2008 Learning to Select Features using their Properties JMLR 2008 Nearly Uniform Validation Improves Compression-Based Error Bounds JMLR 2008 On the Generalization Ability of Online Strongly Convex Programming Algorithms NeurIPS 2008 Rademacher Complexity Bounds for Non-I.I.D. Processes NeurIPS 2008 Risk Bounds for Randomized Sample Compressed Classifiers NeurIPS 2008 Weighted Sums of Random Kitchen Sinks: Replacing minimization with randomization in learning NeurIPS 2008 A general agnostic active learning algorithm NeurIPS 2007 Cluster Stability for Finite Samples NeurIPS 2007 Combining PAC-Bayesian and Generic Chaining Bounds JMLR 2007 On the Effectiveness of Laplacian Normalization for Graph Semi-supervised Learning JMLR 2007 Stability Bounds for Non-i.i.d. Processes NeurIPS 2007 Analysis of Representations for Domain Adaptation NeurIPS 2006 Bounds for Linear Multi-Task Learning JMLR 2006