Learning theory of regularized Huber regression

DOI10.1016/J.ACHA.2026.101894MaRDI QIDQ7305365zbMATH OpenFDO

Authors Hongzhi Tong

Publication date 29 July 2026

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ACHA.2026.101894

Mathematics Subject Classification ID

Nonparametric robustness (62G35) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• 10.1162/153244302760200704
• A general Bahadur representation of M-estimators and its application to linear regression with nonstochastic designs
• A new perspective on robust \(M\)-estimation: finite sample theory and applications to dependence-adjusted multiple testing
• A statistical learning assessment of Huber regression
• Adaptive Huber Regression
• Adaptive Huber regression on Markov-dependent data
• An introduction to the theory of reproducing kernel Hilbert spaces
• Asymptotic behavior of M estimators of p regression parameters when \(p^ 2/n\) is large. II: Normal approximation
• Asymptotic behavior of M-estimators for the linear model
• Functional linear regression with Huber loss
• Heavy-Tail Phenomena
• How to compare different loss functions and their risks
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• scientific article; zbMATH DE number 7415114 (Why is no real title available?)
• Kernel ridge vs. principal component regression: minimax bounds and the qualification of regularization operators
• Learning rates of least-square regularized regression
• Learning theory estimates via integral operators and their approximations
• Learning with correntropy-induced losses for regression with mixture of symmetric stable noise
• Learning with the maximum correntropy criterion induced losses for regression
• Leave-One-Out Bounds for Kernel Methods
• Model selection for regularized least-squares algorithm in learning theory
• On regularization algorithms in learning theory
• Optimal learning rates for least squares regularized regression with unbounded sampling
• Optimal rates for multi-pass stochastic gradient methods
• Optimal rates for regularization of statistical inverse learning problems
• Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces
• Optimal rates for the regularized least-squares algorithm
• Optimality of regularized least squares ranking with imperfect kernels
• Robust Estimation of a Location Parameter
• Robust regression: Asymptotics, conjectures and Monte Carlo
• Sobolev norm learning rates for regularized least-squares algorithms
• Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
• Support Vector Machines
• Theory of Reproducing Kernels

This page was built for publication: Learning theory of regularized Huber regression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305365)