Methods › General › Loss Functions › Balanced L1 Loss

Balanced L1 Loss

7 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Balanced L1 Loss is a loss function used for the object detection task. Classification and localization problems are solved simultaneously under the guidance of a multi-task loss since Fast R-CNN, defined as:

L_(p,u,tᵤ,v) = L_(cls)(p, u) + λ[u ≥1]L_(loc)(tᵘ, v)

L_(cls) and L_(loc) are objective functions corresponding to recognition and localization respectively. Predictions and targets in L_(cls) are denoted as p and u. tᵤ is the corresponding regression results with class u. v is the regression target. λ is used for tuning the loss weight under multi-task learning. We call samples with a loss greater than or equal to 1.0 outliers. The other samples are called inliers.

A natural solution for balancing the involved tasks is to tune the loss weights of them. However, owing to the unbounded regression targets, directly raising the weight of localization loss will make the model more sensitive to outliers. These outliers, which can be regarded as hard samples, will produce excessively large gradients that are harmful to the training process. The inliers, which can be regarded as the easy samples, contribute little gradient to the overall gradients compared with the outliers. To be more specific, inliers only contribute 30% gradients average per sample compared with outliers. Considering these issues, the authors introduced the balanced L1 loss, which is denoted as L_b.

Balanced L1 loss is derived from the conventional smooth L1 loss, in which an inflection point is set to separate inliers from outliners, and clip the large gradients produced by outliers with a maximum value of 1.0, as shown by the dashed lines in the Figure to the right. The key idea of balanced L1 loss is promoting the crucial regression gradients, i.e. gradients from inliers (accurate samples), to rebalance the involved samples and tasks, thus achieving a more balanced training within classification, overall localization and accurate localization. Localization loss L_(loc) uses balanced L1 loss is defined as:

L_(loc) = ∑_(i∈x,y,w,h)L_b(tᵘᵢ-vᵢ)

The Figure to the right shows that the balanced L1 loss increases the gradients of inliers under the control of a factor denoted as α. A small α increases more gradient for inliers, but the gradients of outliers are not influenced. Besides, an overall promotion magnification controlled by γ is also brought in for tuning the upper bound of regression errors, which can help the objective function better balancing involved tasks. The two factors that control different aspects are mutually enhanced to reach a more balanced training.b is used to ensure L_b(x = 1) has the same value for both formulations in the equation below.

By integrating the gradient formulation above, we can get the balanced L1 loss as:

L_b(x) = α/b(b|x| + 1)ln(b|x| + 1) - α|x| if |x| < 1

L_b(x) = γ|x| + C otherwise

in which the parameters γ, α, and b are constrained by αln(b + 1) = γ. The default parameters are set as α= 0.5 and γ= 1.5

Source: Libra R-CNN: Towards Balanced Learning for Object DetectionSee Code · OceanPang/Libra_R-CNN

Papers archive 2025-07-28

7 shown of 7, 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.

Tasks archive 2025-07-28

11 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Object Detection3
object-detection3
Ensemble Learning1
Fire Detection1
Food recommendation1
Fracture detection1
Management1
Medical Object Detection1
Nutrition1
Object Localization1
Transfer Learning1

Usage over time archive 2025-07-28

Papers per year tagged with Balanced L1 Loss: 2019 to 2024, peak 3 3 0 2019: 1 paper 2019 2020: 1 paper 2020 2021: 3 papers 2021 2022: 0 papers 2022 2023: 1 paper 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (7 dated). Bars are counts, not a trend claim.

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

Loss Functions

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