Robust regression framework with asymmetrically analogous to correntropy-induced loss

被引:0
|
作者
Yang, Liming [1 ]
Ding, Guangsheng [1 ]
Yuan, Chao [2 ]
Zhang, Min [1 ]
机构
[1] College of Science, China Agricultural University, Beijing,100083, China
[2] College of Information and Electrical Engineering, China Agricultural University, China
基金
中国国家自然科学基金;
关键词
Statistics - Regression analysis - Benchmarking - Numerical methods;
D O I
暂无
中图分类号
学科分类号
摘要
This work proposes a robust loss function based on expectile penalty (named as rescaled expectile loss, RE-loss), which includes and generalizes the existing loss functions. Then some important properties of RE-loss are demonstrated such as asymmetry, nonconvexity, smoothness, boundedness and asymptotic approximation behaviors. From the viewpoints of correntropy, we analyze that the proposed RE-loss can be viewed as a correntropy-induced loss by a reproducing piecewise kernel. Furthermore, a sparse version of RE-loss (called SRE-loss function) is developed to improve sparsity by introducing a ϵ-insensitive zone. Following that, two robust regression frameworks are proposed with the proposed loss functions. However, the non-convexity of the proposed losses makes the problems difficult to optimize. We apply concave–convex procedure (CCCP) and dual theory to solve the problems effectively. The resulting algorithms converge linearly. To validate the proposed methods, we carry out numerical experiments in different scale datasets with different levels of noises and outliers, respectively. In three databases including artificial database, benchmark database and a practical application database, experimental results demonstrate that the proposed methods achieve better generalization than the traditional regression methods in most cases,especially when noise and outlier distribution are imbalance. © 2019 Elsevier B.V.
引用
收藏
相关论文
共 50 条
  • [1] Robust regression framework with asymmetrically analogous to correntropy-induced loss
    Yang, Liming
    Ding, Guangsheng
    Yuan, Chao
    Zhang, Min
    [J]. KNOWLEDGE-BASED SYSTEMS, 2020, 191
  • [2] Kernel-based sparse regression with the correntropy-induced loss
    Chen, Hong
    Wang, Yulong
    [J]. APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2018, 44 (01) : 144 - 164
  • [3] Efficient and robust deep learning with Correntropy-induced loss function
    Liangjun Chen
    Hua Qu
    Jihong Zhao
    Badong Chen
    Jose C. Principe
    [J]. Neural Computing and Applications, 2016, 27 : 1019 - 1031
  • [4] Efficient and robust deep learning with Correntropy-induced loss function
    Chen, Liangjun
    Qu, Hua
    Zhao, Jihong
    Chen, Badong
    Principe, Jose C.
    [J]. NEURAL COMPUTING & APPLICATIONS, 2016, 27 (04): : 1019 - 1031
  • [5] Sparse Additive Machine With the Correntropy-Induced Loss
    Yuan, Peipei
    You, Xinge
    Chen, Hong
    Wang, Yingjie
    Peng, Qinmu
    Zou, Bin
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, : 1 - 15
  • [6] Correntropy-Induced Robust Low-Rank Hypergraph
    Jin, Taisong
    Ji, Rongrong
    Gao, Yue
    Sun, Xiaoshuai
    Zhao, Xibin
    Tao, Dacheng
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2019, 28 (06) : 2755 - 2769
  • [7] Learning with correntropy-induced losses for regression with mixture of symmetric stable noise
    Feng, Yunlong
    Ying, Yiming
    [J]. APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2020, 48 (02) : 795 - 810
  • [8] Correntropy-induced metric with Laplacian kernel for robust fluorescence molecular tomography
    Yuan, Yating
    Guo, Hongbo
    Yi, Huangjian
    Yu, Jingjing
    He, Xuelei
    He, Xiaowei
    [J]. BIOMEDICAL OPTICS EXPRESS, 2021, 12 (10) : 5991 - 6012
  • [9] CTSVM: A robust twin support vector machine with correntropy-induced loss function for binary classification problems
    Zheng, Xiaohan
    Zhang, Li
    Yan, Leilei
    [J]. INFORMATION SCIENCES, 2021, 559 : 22 - 45
  • [10] Deep particulate matter forecasting model using correntropy-induced loss
    Kim, Jongsu
    Lee, Changhoon
    [J]. JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY, 2021, 35 (09) : 4045 - 4063