Empirical risk minimization

Known as: ERM 
Empirical risk minimization (ERM) is a principle in statistical learning theory which defines a family of learning algorithms and is used to give… (More)
Wikipedia

Related topics

Related topics

19 relations
Gradient boostingHinge lossLinear classifierLoss function
(More)

Broader (1)

Machine learning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
mixup: Beyond Empirical Risk Minimization
Large deep neural networks are powerful, but exhibit undesirable behaviors such as memorization and sensitivity to adversarial… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2018
2018
Empirical Risk Minimization Under Fairness Constraints
We address the problem of algorithmic fairness: ensuring that sensitive variables do not unfairly influence the outcome of a… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
We consider a generic convex optimization problem associated with regularized empirical risk minimization of linear predictors… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds
Convex empirical risk minimization is a basic tool in machine learning and statistics. We provide new algorithms and matching… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Private Convex Empirical Risk Minimization and High-dimensional Regression
We consider differentially private algorithms for convex empirical risk minimization (ERM). Differential privacy (Dwork et al… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Differentially Private Empirical Risk Minimization
Privacy-preserving machine learning algorithms are crucial for the increasingly common setting in which personal data, such as… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Sparsity in penalized empirical risk minimization
Let (X,Y ) be a random couple in S × T with unknown distribution P. Let (X1, Y1), . . . , (Xn,Yn) be i.i.d. copies of (X,Y ), Pn… (More)
Is this relevant?
2007
2007
Aggregation via Empirical Risk Minimization
Given a finite set F of estimators, the problem of aggregation is to construct a new estimator whose risk is as close as possible… (More)
Is this relevant?
2004
2004
Local Complexities for Empirical Risk Minimization
We present sharp bounds on the risk of the empirical minimization algorithm under mild assumptions on the class. We introduce the… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Nonparametric estimation via empirical risk minimization
A general notion of universal consistency of nonparametric estimators is introduced that applies to regression estimation… (More)
Is this relevant?