.png){kind=icon}
返回
Error Risk Minimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2024.124332.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Empirical Risk Minimization (ERM) with the squared loss has become one of the most popular principles for designing learning algorithms. However, the existing mean regression models under ERM usually suffer from poor generalization performance due to their sensitivity to atypical observations (e.g., outliers). For alleviating this sensitivity, some strategies have been proposed by utilizing the quantitative relationship of error values with different observations to form robust learning objectives. Instead of focusing on error values, this paper considers the error density to uncover the structure information of observations and proposes a new learning objective, called Error Density -dependent Empirical Risk Minimization (EDERM), for robust regression under complex data environments. Property characterizations and experimental analysis validate the robustness and competitiveness of the proposed EDERM-based learning models. The implemented codes can be found at https://github.com/zhangxuelincode/EDERM.
Keyword:
Error density
Robust estimation
Kernel regression
Empirical risk minimization
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
On the Development and Applications of Cellulosic Nanofibrillar and Nanocrystalline Materials纤维素纳米原纤和纳米晶材料的发展与应用
PREAI
分享收藏
A robust algorithm of support vector regression with a trimmed Huber loss function in the primal.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏
查看更多内容