TY - JOUR
T1 - Outlier-robust learning with continuously differentiable least trimmed squares
AU - Xing, Lei
AU - Liu, Yufei
AU - Xu, Linhai
AU - Chen, Badong
N1 - Publisher Copyright:
© 2026 Elsevier Ltd
PY - 2026/7
Y1 - 2026/7
N2 - Robust estimation is a fundamental task in statistical analysis, aimed at identifying models that can effectively eliminate the impact of noise, especially in the presence of outliers. The Least Trimmed Squares (LTS) estimation approach is widely recognized for its robustness in such scenarios. However, selecting a representative subset of samples for LTS estimation is computationally demanding, and the effectiveness of LTS is sensitive to the number of samples selected. In this study, we propose a novel approach, continuously differentiable LTS (CD-LTS), which employs a continuous function to approximate the original LTS. Due to its continuity and differentiability properties, CD-LTS can be used as a cost function for a range of learning models and avoids the need for additional sorting steps, thereby addressing the difficulty of applying traditional LTS directly. We utilize CD-LTS to develop four robust learning algorithms, including random vector functional link (RVFL), principal component analysis (PCA), iterative closest point (ICP), and orthogonal iterative (OI). The experimental results indicate that the proposed algorithms exhibit superior performance compared to existing methods.
AB - Robust estimation is a fundamental task in statistical analysis, aimed at identifying models that can effectively eliminate the impact of noise, especially in the presence of outliers. The Least Trimmed Squares (LTS) estimation approach is widely recognized for its robustness in such scenarios. However, selecting a representative subset of samples for LTS estimation is computationally demanding, and the effectiveness of LTS is sensitive to the number of samples selected. In this study, we propose a novel approach, continuously differentiable LTS (CD-LTS), which employs a continuous function to approximate the original LTS. Due to its continuity and differentiability properties, CD-LTS can be used as a cost function for a range of learning models and avoids the need for additional sorting steps, thereby addressing the difficulty of applying traditional LTS directly. We utilize CD-LTS to develop four robust learning algorithms, including random vector functional link (RVFL), principal component analysis (PCA), iterative closest point (ICP), and orthogonal iterative (OI). The experimental results indicate that the proposed algorithms exhibit superior performance compared to existing methods.
KW - Continuously differentiable LTS (CD-LTS)
KW - Least trimmed squares (LTS)
KW - Robust estimation
UR - https://www.scopus.com/pages/publications/105028010101
U2 - 10.1016/j.patcog.2026.113099
DO - 10.1016/j.patcog.2026.113099
M3 - 文章
AN - SCOPUS:105028010101
SN - 0031-3203
VL - 175
JO - Pattern Recognition
JF - Pattern Recognition
M1 - 113099
ER -