Methods › General › Loss Functions › Seesaw Loss

Seesaw Loss

3 papers tagged archive 2025-07-28

Introduced by Jiaqi Wang et al. in Seesaw Loss for Long-Tailed Instance Segmentation

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

Seesaw Loss is a loss function for long-tailed instance segmentation. It dynamically re-balances the gradients of positive and negative samples on a tail class with two complementary factors: mitigation factor and compensation factor. The mitigation factor reduces punishments to tail categories w.r.t the ratio of cumulative training instances between different categories. Meanwhile, the compensation factor increases the penalty of misclassified instances to avoid false positives of tail categories. The synergy of the two factors enables Seesaw Loss to mitigate the overwhelming punishments on tail classes as well as compensate for the risk of misclassification caused by diminished penalties.

L_(seesaw)(𝐱) = - ∑^Cᵢ₌₁yᵢlog(σ̂ᵢ)

with σ̂ᵢ̂ = (e^(zᵢ))/(- ∑^C_(j≠1)𝒮ᵢⱼe^(zⱼ)+e^(zᵢ))

Here 𝒮ᵢⱼ works as a tunable balancing factor between different classes. By a careful design of 𝒮ᵢⱼ, Seesaw loss adjusts the punishments on class j from positive samples of class i. Seesaw loss determines 𝒮ᵢⱼ by a mitigation factor and a compensation factor, as:

𝒮ᵢⱼ =ℳᵢⱼ · 𝒞ᵢⱼ

The mitigation factor ℳᵢⱼ decreases the penalty on tail class j according to a ratio of instance numbers between tail class j and head class i. The compensation factor 𝒞ᵢⱼ increases the penalty on class j whenever an instance of class i is misclassified to class j.

PaperSource

Papers archive 2025-07-28

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

4 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
2D Object Detection1
Data Augmentation1
Instance Segmentation1
Semantic Segmentation1

Usage over time archive 2025-07-28

Papers per year tagged with Seesaw Loss: 2020 to 2024, peak 1 1 0 2020: 1 paper 2020 2021: 0 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 (3 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