Methods › General › Attention Mechanisms › SRM

style-based recalibration module

SRM

33 papers tagged archive 2025-07-28

Introduced by HyunJae Lee et al. in SRM: A Style-Based Recalibration Module for Convolutional Neural Networks

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

SRM combines style transfer with an attention mechanism. Its main contribution is style pooling which utilizes both mean and standard deviation of the input features to improve its capability to capture global information. It also adopts a lightweight channel-wise fully-connected (CFC) layer, in place of the original fully-connected layer, to reduce the computational requirements. Given an input feature map X ∈ℝ^(C ×H ×W), SRM first collects global information by using style pooling (SP(·)) which combines global average pooling and global standard deviation pooling. Then a channel-wise fully connected (CFC(·)) layer (i.e. fully connected per channel), batch normalization BN and sigmoid function σ are used to provide the attention vector. Finally, as in an SE block, the input features are multiplied by the attention vector. Overall, an SRM can be written as: s = Fₛᵣₘ(X, θ) = σ(BN(CFC(SP(X)))) Y = s X The SRM block improves both squeeze and excitation modules, yet can be added after each residual unit like an SE block.

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'novel DRL algorithm with convergence guarantees that optimizes for a broader class of static Spectral Risk Measures (SRM)' (resolution: alias); this answer is about that name. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2501.02087) is about this method is not checked.

Origin paper of this answer, arXiv:2501.02087 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples) · 4 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

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: 33 · with a code link: 8 · where Syntology ran a sample: 1 (1 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 (1 of 33 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 33 of 33, 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.

Tasks archive 2025-07-28

20 shown of 26 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
Computational Efficiency3
Decision Making3
Model Selection2
Segmentation2
Semantic Segmentation2
Autonomous Vehicles1
Collaborative Inference1
Deep Learning1
Device-Cloud Collaboration1
Distributional Reinforcement Learning1
Edge-computing1
Experimental Design1
Feature Importance1
In-Context Learning1
Knowledge Distillation1
Language Modeling1
Language Modelling1
Large Language Model1
Mathematical Reasoning1
Numerical Integration1

Usage over time archive 2025-07-28

Papers per year tagged with SRM: 2019 to 2025, peak 8 8 0 2019: 5 papers 2019 2020: 2 papers 2020 2021: 3 papers 2021 2022: 5 papers 2022 2023: 5 papers 2023 2024: 8 papers 2024 2025: 5 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (33 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

Attention Mechanisms

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