Methods › General › Loss Functions › Self-Adjusting Smooth L1 Loss
Self-Adjusting Smooth L1 Loss
Introduced by Cheng-Yang Fu et al. in RetinaMask: Learning to predict masks improves state-of-the-art single-shot detection for free
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Self-Adjusting Smooth L1 Loss is a loss function used in object detection that was introduced with RetinaMask. This is an improved version of Smooth L1. For Smooth L1 loss we have:
f(x) = 0.5 x²/β if |x| < β f(x) = |x| -0.5β otherwise
Here a point β splits the positive axis range into two parts: L2 loss is used for targets in range [0, β], and L1 loss is used beyond β to avoid over-penalizing utliers. The overall function is smooth (continuous, together with its derivative). However, the choice of control point (β) is heuristic and is usually done by hyper parameter search.
Instead, with self-adjusting smooth L1 loss, inside the loss function the running mean and variance of the absolute loss are recorded. We use the running minibatch mean and variance with a momentum of 0.9 to update these two parameters.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: Self-Denoised Smoothing; Self-Adjusting Softmax (SA-Softmax); Adaptive Label Smoothing with Self-Knowledge; Near-imperceptible Neural Linguistic Steganography via Self-Adjusting Arithmetic Coding; CUDA-L1; l1-APGD; Self-MAP; Self-Aug.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 1 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 1 tagged papers has a Syntology run on record
Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
RetinaMask: Learning to predict masks improves state-of-the-art single-shot detection for free 10 Jan 2019 · 53 repositories · arXiv:1901.03353
Tasks archive 2025-07-28
1 task the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Object Detection | 1 |
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