Methods › General › Normalization › Sparse Switchable Normalization

Sparse Switchable Normalization

1 paper tagged archive 2025-07-28

Introduced by Wenqi Shao et al. in SSN: Learning Sparse Switchable Normalization via SparsestMax

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

Sparse Switchable Normalization (SSN) is a variant on Switchable Normalization where the importance ratios are constrained to be sparse. Unlike ℓ₁ and ℓ₀ constraints that impose difficulties in optimization, the constrained optimization problem is turned into feed-forward computation through SparseMax, which is a sparse version of softmax.

PaperSourceSee Code · switchablenorms/Sparse_SwitchNorm

Papers archive 2025-07-28

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

The archive attaches no task to a paper tagged with this method.

Usage over time archive 2025-07-28

Papers per year tagged with Sparse Switchable Normalization: 2019 to 2019, peak 1 1 0 2019: 1 paper 2019
Papers per year the archive tags with this method, by the paper's archive date (1 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

Normalization

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