Methods › General › Loss Functions › Huber loss
Huber loss
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
The Huber loss function describes the penalty incurred by an estimation procedure f. Huber (1964) defines the loss function piecewise by[1]
L δ ( a ) = { 1 2 a 2 for | a | ≤ δ , δ ⋅ ( | a | − 1 2 δ ) , otherwise. {\displaystyle L_{\delta }(a)={\begin{cases}{\frac {1}{2}}{a^{2}}&{\text{for }}|a|\leq \delta ,\\\delta \cdot \left(|a|-{\frac {1}{2}}\delta \right),&{\text{otherwise.}}\end{cases}}}
This function is quadratic for small values of a, and linear for large values, with equal values and slopes of the different sections at the two points where | a | = δ |a|=\delta . The variable a often refers to the residuals, that is to the difference between the observed and predicted values a = y − f ( x ) a=y-f(x), so the former can be expanded to[2]
L δ ( y , f ( x ) ) = { 1 2 ( y − f ( x ) ) 2 for | y − f ( x ) | ≤ δ , δ ⋅ ( | y − f ( x ) | − 1 2 δ ) , otherwise. {\displaystyle L_{\delta }(y,f(x))={\begin{cases}{\frac {1}{2}}(y-f(x))^{2}&{\text{for }}|y-f(x)|\leq \delta ,\\\delta \ \cdot \left(|y-f(x)|-{\frac {1}{2}}\delta \right),&{\text{otherwise.}}\end{cases}}}
The Huber loss is the convolution of the absolute value function with the rectangular function, scaled and translated. Thus it "smoothens out" the former's corner at the origin.
.. math:: \ell(x, y) = L = {l_1, ..., l_N}^T
with
.. math::
l_n = \begin{cases}
0.5 (x_n - y_n)^2, & \text{if } |x_n - y_n| < delta \\
delta * (|x_n - y_n| - 0.5 * delta), & \text{otherwise }
\end{cases}
Papers archive 2025-07-28
30 shown of 77, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
SHORE: A Long-term User Lifetime Value Prediction Model in Digital Games 12 Jun 2025 · 0 repositories · arXiv:2506.10487
-
Heavy Lasso: sparse penalized regression under heavy-tailed noise via data-augmented soft-thresholding 9 Jun 2025 · 1 repository · arXiv:2506.07790
-
Differentially Private Sparse Linear Regression with Heavy-tailed Responses 7 Jun 2025 · 0 repositories · arXiv:2506.06861
-
A Surrogate Model for the Forward Design of Multi-layered Metasurface-based Radar Absorbing Structures 14 May 2025 · 0 repositories · arXiv:2505.09251
-
A Piecewise Lyapunov Analysis of Sub-quadratic SGD: Applications to Robust and Quantile Regression 11 Apr 2025 · 0 repositories · arXiv:2504.08178
-
Asymptotics of Non-Convex Generalized Linear Models in High-Dimensions: A proof of the replica formula 27 Feb 2025 · 0 repositories · arXiv:2502.20003
-
Explainable AI based System for Supply Air Temperature Forecast 9 Jan 2025 · 0 repositories · arXiv:2501.05163
-
Robust Sparse Regression with Non-Isotropic Designs 31 Oct 2024 · 0 repositories · arXiv:2410.23937
-
Residual-based Adaptive Huber Loss (RAHL) -- Design of an improved Huber loss for CQI prediction in 5G networks 27 Aug 2024 · 0 repositories · arXiv:2408.14718
-
A Huber Loss Minimization Approach to Mean Estimation under User-level Differential Privacy 22 May 2024 · 0 repositories · arXiv:2405.13453
-
Robust deep learning from weakly dependent data 8 May 2024 · 0 repositories · arXiv:2405.05081
-
H-Consistency Guarantees for Regression 28 Mar 2024 · 0 repositories · arXiv:2403.19480
-
A Unified Framework for Center-based Clustering of Distributed Data 2 Feb 2024 · 0 repositories · arXiv:2402.01302
-
A Robust Quantile Huber Loss With Interpretable Parameter Adjustment In Distributional Reinforcement Learning 4 Jan 2024 · 1 repository · arXiv:2401.02325
-
Robust Non-parametric Knowledge-based Diffusion Least Mean Squares over Adaptive Networks 3 Dec 2023 · 0 repositories · arXiv:2312.01299
-
Towards Robust Offline Reinforcement Learning under Diverse Data Corruption 19 Oct 2023 · 2 repositories · arXiv:2310.12955Syntology ran 5 of 9 samples · 4 unverified · 9 pointer-only (licence)
-
Dual Latent State Learning: Exploiting Regional Network Similarities for QoS Prediction 7 Oct 2023 · 0 repositories · arXiv:2310.05988
-
High-dimensional robust regression under heavy-tailed data: Asymptotics and Universality 28 Sep 2023 · 0 repositories · arXiv:2309.16476
-
A Huber Loss Minimization Approach to Byzantine Robust Federated Learning 24 Aug 2023 · 0 repositories · arXiv:2308.12581
-
Machine learning in parameter estimation of nonlinear systems 23 Aug 2023 · 0 repositories · arXiv:2308.12393
-
Multi-Task Pseudo-Label Learning for Non-Intrusive Speech Quality Assessment Model 18 Aug 2023 · 0 repositories · arXiv:2308.09262
-
Investigating the Edge of Stability Phenomenon in Reinforcement Learning 9 Jul 2023 · 0 repositories · arXiv:2307.04210
-
SDR-GAIN: A High Real-Time Occluded Pedestrian Pose Completion Method for Autonomous Driving 6 Jun 2023 · 0 repositories · arXiv:2306.03538
-
Asymptotic Characterisation of Robust Empirical Risk Minimisation Performance in the Presence of Outliers 30 May 2023 · 1 repository · arXiv:2305.18974
-
Distributional Reinforcement Learning with Dual Expectile-Quantile Regression 26 May 2023 · 0 repositories · arXiv:2305.16877
-
Robust Nonparametric Regression under Poisoning Attack 26 May 2023 · 0 repositories · arXiv:2305.16771
-
Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression 10 May 2023 · 0 repositories · arXiv:2305.06199
-
Directly Optimizing IoU for Bounding Box Localization 14 Apr 2023 · 0 repositories · arXiv:2304.07256
-
Robust convex biclustering with a tuning-free method 6 Dec 2022 · 1 repository · arXiv:2212.03122
-
Inflexible Multi-Asset Hedging of incomplete market 2 Nov 2022 · 0 repositories · arXiv:2211.00948
Tasks archive 2025-07-28
20 shown of 71 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections