Generalized and Robust Least Squares Regression

Jingyu Wang, Fangyuan Xie, Feiping Nie, Xuelong Li

科研成果: 期刊稿件文章同行评审

9 引用 (Scopus)

摘要

As a simple yet effective method, least squares regression (LSR) is extensively applied for data regression and classification. Combined with sparse representation, LSR can be extended to feature selection (FS) as well, in which l1 regularization is often applied in embedded FS algorithms. However, because the loss function is in the form of squared error, LSR and its variants are sensitive to noises, which significantly degrades the effectiveness and performance of classification and FS. To cope with the problem, we propose a generalized and robust LSR (GRLSR) for classification and FS, which is made up of arbitrary concave loss function and the l2, p-norm regularization term. Meanwhile, an iterative algorithm is applied to efficiently deal with the nonconvex minimization problem, in which an additional weight to suppress the effect of noises is added to each data point. The weights can be automatically assigned according to the error of the samples. When the error is large, the value of the corresponding weight is small. It is this mechanism that allows GRLSR to reduce the impact of noises and outliers. According to the different formulations of the concave loss function, four specific methods are proposed to clarify the essence of the framework. Comprehensive experiments on corrupted datasets have proven the advantage of the proposed method.

源语言英语
页(从-至)7006-7020
页数15
期刊IEEE Transactions on Neural Networks and Learning Systems
35
5
DOI
出版状态已出版 - 1 5月 2024

指纹

探究 'Generalized and Robust Least Squares Regression' 的科研主题。它们共同构成独一无二的指纹。

引用此