Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The literature on sparse recovery often adopts the lp “norm” ( p ∈ [0,1]) as the penalty to induce sparsity of the signal… 
Highly Cited
2013
Highly Cited
2013
We propose two versions of affine projection (AP) algorithms tailored for sparse system identification (SSI). Contrary to most… 
2012
2012
In the binary classification framework, a closed form expression of the cross-validation Leave-p-Out (LpO) risk estimator for the… 
2010
2010
Data envelopment analysis (DEA) has attracted considerable attention during the last few decades as an intuitively clear method… 
2007
2007
Due to highly nonlinear characteristics of switched reluctance motor (SRM), an accurate nonlinear model is the key to minimize… 
Highly Cited
2005
Highly Cited
2005
We present a method for predicting data-dependent jitter (DDJ) introduced by a general linear time-invariant LTI system based on… 
Highly Cited
2003
Highly Cited
2003
In this paper, we extend a recently introduced motion planning framework for autonomous vehicles based on a maneuver automation… 
2002
2002
Abstract. We study the general problem of an agent wishing to minimize the risk of a position at a fixed date. The agent trades… 
1993
1993
The asymptotic covariance matrix of the empirical cepstrum is analyzed. It is shown that for Gaussian processes, ceptral…