conftrace_

excess risk bound

38 papers

Explore in graph

Co-occurring keywords

empirical risk minimization (352) generalization bound (652) excess risk (66) local rademacher complexity (10) convergence rate (607) rademacher complexity (109) sample complexity (1169) convex optimization (1321) binary classification (678) learning theory (519)

Papers

Leveraging Low-Rank Relations Between Surrogate Tasks in Structured Prediction ICML 2019
Efficient Convex Completion of Coupled Tensors using Coupled Nuclear Norms NIPS 2018
Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learning JMLR 2018
Connecting Optimization and Regularization Paths NIPS 2018
On the Consistency of Ordinal Regression Methods JMLR 2017
Efficient Private Empirical Risk Minimization for High-dimensional Learning ICML 2016
Localized Complexities for Transductive Learning COLT 2014
Loss-Proportional Subsampling for Subsequent ERM ICML 2013
Excess risk bounds for multitask learning with trace norm regularization COLT 2013
The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning NIPS 2011
Rademacher Complexities and Bounding the Excess Risk in Active Learning JMLR 2010
Smoothness, Low Noise and Fast Rates NIPS 2010
Compressed Least-Squares Regression NIPS 2009