Methods › General › Attention Mechanisms › SRM
style-based recalibration module
SRM
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.
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.
-
Learn to Vaccinate: Combining Structure Learning and Effective Vaccination for Epidemic and Outbreak Control 18 Jun 2025 · 0 repositories · arXiv:2506.15397
-
Speculative Reward Model Boosts Decision Making Ability of LLMs Cost-Effectively 31 May 2025 · 1 repository · arXiv:2506.00396
-
Boosting Virtual Agent Learning and Reasoning: A Step-wise, Multi-dimensional, and Generalist Reward Model with Benchmark 24 Mar 2025 · 1 repository · arXiv:2503.18665
-
Collaboration of Large Language Models and Small Recommendation Models for Device-Cloud Recommendation 10 Jan 2025 · 0 repositories · arXiv:2501.05647
-
Beyond CVaR: Leveraging Static Spectral Risk Measures for Enhanced Decision-Making in Distributional Reinforcement Learning 3 Jan 2025 · 1 repository · arXiv:2501.02087Syntology official (archive's flag): 2 ran · 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)
-
A Deep Semantic Segmentation Network with Semantic and Contextual Refinements 11 Dec 2024 · 0 repositories · arXiv:2412.08671
-
Robust Universum Twin Support Vector Machine for Imbalanced Data 27 Oct 2024 · 0 repositories · arXiv:2410.20335
-
Enhancing Robustness and Efficiency of Least Square Twin SVM via Granular Computing 22 Oct 2024 · 0 repositories · arXiv:2410.17338
-
HyperDet: Generalizable Detection of Synthesized Images by Generating and Merging A Mixture of Hyper LoRAs 8 Oct 2024 · 0 repositories · arXiv:2410.06044
-
Granular Ball Twin Support Vector Machine 7 Oct 2024 · 1 repository · arXiv:2410.04774
-
Solution for Authenticity Identification of Typical Target Remote Sensing Images 3 May 2024 · 0 repositories · arXiv:2405.02362
-
Structure-Aware Human Body Reshaping with Adaptive Affinity-Graph Network 22 Apr 2024 · 1 repository · arXiv:2404.13983
-
Assessing Generalization for Subpopulation Representative Modeling via In-Context Learning 12 Feb 2024 · 0 repositories · arXiv:2402.07368
-
Model Selection for Inverse Reinforcement Learning via Structural Risk Minimization 27 Dec 2023 · 0 repositories · arXiv:2312.16566
-
Structural Risk Minimization for Learning Nonlinear Dynamics 28 Sep 2023 · 0 repositories · arXiv:2309.16527
-
Learning via Wasserstein-Based High Probability Generalisation Bounds 7 Jun 2023 · 0 repositories · arXiv:2306.04375
-
Smooth Robustness Measures for Symbolic Control Via Signal Temporal Logic 16 May 2023 · 0 repositories · arXiv:2305.09116
-
Auditory distraction in open-plan office environments: The effect of multi-talker acoustics 14 Apr 2023 · 0 repositories · arXiv:2304.12817
-
MDL-based Compressing Sequential Rules 20 Dec 2022 · 0 repositories · arXiv:2212.10252
-
Joint Secure Communication and Radar Beamforming: A Secrecy-Estimation Rate-Based Design 23 Nov 2022 · 0 repositories · arXiv:2211.12667
-
Driving Safety Prediction and Safe Route Mapping Using In-vehicle and Roadside Data 12 Sep 2022 · 0 repositories · arXiv:2209.05604
-
Towards Target Sequential Rules 9 Jun 2022 · 0 repositories · arXiv:2206.04728
-
MMINR: Multi-frame-to-Multi-frame Inference with Noise Resistance for Precipitation Nowcasting with Radar 5 May 2022 · 0 repositories · arXiv:2205.02457
-
Deep Learning Based Cloud Cover Parameterization for ICON 21 Dec 2021 · 1 repository · arXiv:2112.11317
-
CSRNet: Cascaded Selective Resolution Network for Real-time Semantic Segmentation 8 Jun 2021 · 0 repositories · arXiv:2106.04400
-
Knowledge Distillation By Sparse Representation Matching 31 Mar 2021 · 1 repository · arXiv:2103.17012
-
An empirical evaluation of functional alignment using inter-subject decoding 8 Dec 2020 · 1 repository
-
Artificial-Noise-Aided Secure MIMO Wireless Communications via Intelligent Reflecting Surface 17 Feb 2020 · 0 repositories · arXiv:2002.07063
-
Estimation of Spectral Risk Measures 22 Dec 2019 · 0 repositories · arXiv:1912.10398
-
Sum Rate Maximization for Multiuser MISO Downlink with Intelligent Reflecting Surface 19 Dec 2019 · 0 repositories · arXiv:1912.09315
-
Reflecting Modulation 18 Dec 2019 · 0 repositories · arXiv:1912.08428
-
Scaling up Psychology via Scientific Regret Minimization: A Case Study in Moral Decisions 16 Oct 2019 · 0 repositories · arXiv:1910.07581
-
SRM: A Style-Based Recalibration Module for Convolutional Neural Networks 1 Oct 2019 · 0 repositories
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.
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