conftrace_

risk bound

71 papers

Explore in graph

Co-occurring keywords

learning theory (519) statistical learning (351) rademacher complexity (109) excess risk (66) generalization bound (652) empirical risk minimization (352) ensemble learning (1274) pac-bayes bound (53) linear regression (282) statistical learning theory (82)

Papers

Barron and Cover’s Theory in Supervised Learning and its Application to Lasso ICML 2016
Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithm JMLR 2015
Risk and Regret of Hierarchical Bayesian Learners ICML 2015
Fast Function to Function Regression AISTATS 2015
Active Regression by Stratification NIPS 2014
Quantized Estimation of Gaussian Sequence Models in Euclidean Balls NIPS 2014
Cost-sensitive Multiclass Classification Risk Bounds ICML 2013
Distribution-Free Distribution Regression AISTATS 2013
Risk Bounds and Learning Algorithms for the Regression Approach to Structured Output Prediction ICML 2013
Controlled Recognition Bounds for Visual Learning and Exploration NIPS 2012
Generalization Bounds for Online Learning Algorithms with Pairwise Loss Functions COLT 2012
Assisting Main Task Learning by Heterogeneous Auxiliary Tasks with Applications to Skin Cancer Screening AISTATS 2011
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011
Risk Bounds for Levy Processes in the PAC-Learning Framework AISTATS 2010
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization NIPS 2008
Risk Bounds for Randomized Sample Compressed Classifiers NIPS 2008
PAC-Bayes Risk Bounds for Stochastic Averages and Majority Votes of Sample-Compressed Classifiers JMLR 2007
Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds NIPS 2006
PAC-Bayes Bounds for the Risk of the Majority Vote and the Variance of the Gibbs Classifier NIPS 2006
A PAC-Bayes Risk Bound for General Loss Functions NIPS 2006
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results JMLR 2002