conftrace_

empirical risk minimization

352 papers

Explore in graph

Also known as

ERM

Co-occurring keywords

convex optimization (1321) stochastic optimization (1060) differential privacy (1016) stochastic gradient descent (1091) learning theory (519) generalization bound (652) sample complexity (1169) non-convex optimization (547) domain generalization (1522) distributionally robust optimization (185)

Papers

On Elicitation Complexity NIPS 2015
Learning with Square Loss: Localization through Offset Rademacher Complexity COLT 2015
Local Smoothness in Variance Reduced Optimization NIPS 2015
Learning Sparse Low-Threshold Linear Classifiers JMLR 2015
Accelerated Mini-batch Randomized Block Coordinate Descent Method NIPS 2014
Large-scale Multi-label Learning with Missing Labels ICML 2014
Learnability of the Superset Label Learning Problem ICML 2014
An Inequality with Applications to Structured Sparsity and Multitask Dictionary Learning COLT 2014
From Stochastic Mixability to Fast Rates NIPS 2014
Altitude Training: Strong Bounds for Single-Layer Dropout NIPS 2014
Learning without concentration COLT 2014
Optimal learners for multiclass problems COLT 2014
An Accelerated Proximal Coordinate Gradient Method NIPS 2014
Learning with Noisy Labels NIPS 2013
Boosting with the Logistic Loss is Consistent COLT 2013
Linear Convergence with Condition Number Independent Access of Full Gradients NIPS 2013
Characterizing the Representer Theorem ICML 2013
Sharp Generalization Error Bounds for Randomly-projected Classifiers ICML 2013
Loss-Proportional Subsampling for Subsequent ERM ICML 2013
Local Supervised Learning through Space Partitioning NIPS 2012
Multi-Stage Classifier Design ACML 2012
Regularized Bundle Methods for Convex and Non-Convex Risks JMLR 2012
A Primal-Dual Convergence Analysis of Boosting JMLR 2012
Minimax Multi-Task Learning and a Generalized Loss-Compositional Paradigm for MTL NIPS 2012
Private Convex Empirical Risk Minimization and High-dimensional Regression COLT 2012