{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/srm","slug":"srm","name":"SRM","full_name":"style-based recalibration module","full_name_withheld":false,"description_markdown":"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.\r\nGiven an input feature map $X \\in \\mathbb{R}^{C \\times H \\times W}$, SRM first collects global information by using style pooling ($\\text{SP}(\\cdot)$) which combines global average pooling and global standard deviation pooling. \r\nThen a channel-wise fully connected ($\\text{CFC}(\\cdot)$) layer (i.e. fully connected per channel), batch normalization $\\text{BN}$ and sigmoid function $\\sigma$ 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:\r\n\\begin{align}\r\n    s = F_\\text{srm}(X, \\theta) & = \\sigma (\\text{BN}(\\text{CFC}(\\text{SP}(X))))\r\n\\end{align}\r\n\\begin{align}\r\n    Y & = s  X\r\n\\end{align}\r\nThe SRM block improves both squeeze and excitation modules, yet can be added after each residual unit like an SE block.","description_state":"present","introduced_year":null,"introduced_by":{"title":"SRM: A Style-Based Recalibration Module for Convolutional Neural Networks","paper":"/paper/srm-a-style-based-recalibration-module-for-1","first_author":"HyunJae Lee","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/srm-a-style-based-recalibration-module-for-1"},"source":{"url":"http://openaccess.thecvf.com/content_ICCV_2019/html/Lee_SRM_A_Style-Based_Recalibration_Module_for_Convolutional_Neural_Networks_ICCV_2019_paper.html","title":"SRM: A Style-Based Recalibration Module for Convolutional Neural Networks","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Attention Mechanisms","url":"/methods/category/attention-mechanisms","pwc_aliases":["attention-mechanisms-1"]}],"n_papers_tagged":33,"archive_num_papers":33,"papers_newest_first":[{"paper":null,"slug":"learn-to-vaccinate-combining-structure","title":"Learn to Vaccinate: Combining Structure Learning and Effective Vaccination for Epidemic and Outbreak Control","date":"2025-06-18","arxiv_id":"2506.15397","n_code_links":0,"syntology":null},{"paper":"/paper/speculative-reward-model-boosts-decision","slug":"speculative-reward-model-boosts-decision","title":"Speculative Reward Model Boosts Decision Making Ability of LLMs Cost-Effectively","date":"2025-05-31","arxiv_id":"2506.00396","n_code_links":1,"syntology":null},{"paper":"/paper/boosting-virtual-agent-learning-and-reasoning","slug":"boosting-virtual-agent-learning-and-reasoning","title":"Boosting Virtual Agent Learning and Reasoning: A Step-wise, Multi-dimensional, and Generalist Reward Model with Benchmark","date":"2025-03-24","arxiv_id":"2503.18665","n_code_links":1,"syntology":null},{"paper":null,"slug":"collaboration-of-large-language-models-and","title":"Collaboration of Large Language Models and Small Recommendation Models for Device-Cloud Recommendation","date":"2025-01-10","arxiv_id":"2501.05647","n_code_links":0,"syntology":null},{"paper":"/paper/beyond-cvar-leveraging-static-spectral-risk","slug":"beyond-cvar-leveraging-static-spectral-risk","title":"Beyond CVaR: Leveraging Static Spectral Risk Measures for Enhanced Decision-Making in Distributional Reinforcement Learning","date":"2025-01-03","arxiv_id":"2501.02087","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":4,"phrase":"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","official":{"repos":["mehrdadmoghimi/qrsrm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":null,"slug":"a-deep-semantic-segmentation-network-with","title":"A Deep Semantic Segmentation Network with Semantic and Contextual Refinements","date":"2024-12-11","arxiv_id":"2412.08671","n_code_links":0,"syntology":null},{"paper":null,"slug":"intuitionistic-fuzzy-universum-twin-support","title":"Robust Universum Twin Support Vector Machine for Imbalanced Data","date":"2024-10-27","arxiv_id":"2410.20335","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-robustness-and-efficiency-of-least","title":"Enhancing Robustness and Efficiency of Least Square Twin SVM via Granular Computing","date":"2024-10-22","arxiv_id":"2410.17338","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperdet-generalizable-detection-of","title":"HyperDet: Generalizable Detection of Synthesized Images by Generating and Merging A Mixture of Hyper LoRAs","date":"2024-10-08","arxiv_id":"2410.06044","n_code_links":0,"syntology":null},{"paper":"/paper/granular-ball-twin-support-vector-machine","slug":"granular-ball-twin-support-vector-machine","title":"Granular Ball Twin Support Vector Machine","date":"2024-10-07","arxiv_id":"2410.04774","n_code_links":1,"syntology":null},{"paper":null,"slug":"solution-for-authenticity-identification-of","title":"Solution for Authenticity Identification of Typical Target Remote Sensing Images","date":"2024-05-03","arxiv_id":"2405.02362","n_code_links":0,"syntology":null},{"paper":"/paper/structure-aware-human-body-reshaping-with","slug":"structure-aware-human-body-reshaping-with","title":"Structure-Aware Human Body Reshaping with Adaptive Affinity-Graph Network","date":"2024-04-22","arxiv_id":"2404.13983","n_code_links":1,"syntology":null},{"paper":null,"slug":"assessing-generalization-for-subpopulation","title":"Assessing Generalization for Subpopulation Representative Modeling via In-Context Learning","date":"2024-02-12","arxiv_id":"2402.07368","n_code_links":0,"syntology":null},{"paper":null,"slug":"inverse-reinforcement-learning-with-unknown","title":"Model Selection for Inverse Reinforcement Learning via Structural Risk Minimization","date":"2023-12-27","arxiv_id":"2312.16566","n_code_links":0,"syntology":null},{"paper":null,"slug":"structural-risk-minimization-for-learning","title":"Structural Risk Minimization for Learning Nonlinear Dynamics","date":"2023-09-28","arxiv_id":"2309.16527","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-via-wasserstein-based-high","title":"Learning via Wasserstein-Based High Probability Generalisation Bounds","date":"2023-06-07","arxiv_id":"2306.04375","n_code_links":0,"syntology":null},{"paper":null,"slug":"smooth-robustness-measures-for-symbolic","title":"Smooth Robustness Measures for Symbolic Control Via Signal Temporal Logic","date":"2023-05-16","arxiv_id":"2305.09116","n_code_links":0,"syntology":null},{"paper":null,"slug":"auditory-distraction-in-open-plan-office","title":"Auditory distraction in open-plan office environments: The effect of multi-talker acoustics","date":"2023-04-14","arxiv_id":"2304.12817","n_code_links":0,"syntology":null},{"paper":null,"slug":"mdl-based-compressing-sequential-rules","title":"MDL-based Compressing Sequential Rules","date":"2022-12-20","arxiv_id":"2212.10252","n_code_links":0,"syntology":null},{"paper":null,"slug":"joint-secure-communication-and-radar","title":"Joint Secure Communication and Radar Beamforming: A Secrecy-Estimation Rate-Based Design","date":"2022-11-23","arxiv_id":"2211.12667","n_code_links":0,"syntology":null},{"paper":null,"slug":"driving-safety-prediction-and-safe-route","title":"Driving Safety Prediction and Safe Route Mapping Using In-vehicle and Roadside Data","date":"2022-09-12","arxiv_id":"2209.05604","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-target-sequential-rules","title":"Towards Target Sequential Rules","date":"2022-06-09","arxiv_id":"2206.04728","n_code_links":0,"syntology":null},{"paper":null,"slug":"mminr-multi-frame-to-multi-frame-inference","title":"MMINR: Multi-frame-to-Multi-frame Inference with Noise Resistance for Precipitation Nowcasting with Radar","date":"2022-05-05","arxiv_id":"2205.02457","n_code_links":0,"syntology":null},{"paper":"/paper/deep-learning-based-cloud-cover","slug":"deep-learning-based-cloud-cover","title":"Deep Learning Based Cloud Cover Parameterization for ICON","date":"2021-12-21","arxiv_id":"2112.11317","n_code_links":1,"syntology":null},{"paper":null,"slug":"csrnet-cascaded-selective-resolution-network","title":"CSRNet: Cascaded Selective Resolution Network for Real-time Semantic Segmentation","date":"2021-06-08","arxiv_id":"2106.04400","n_code_links":0,"syntology":null},{"paper":"/paper/knowledge-distillation-by-sparse-1","slug":"knowledge-distillation-by-sparse-1","title":"Knowledge Distillation By Sparse Representation Matching","date":"2021-03-31","arxiv_id":"2103.17012","n_code_links":1,"syntology":null},{"paper":"/paper/an-empirical-evaluation-of-functional","slug":"an-empirical-evaluation-of-functional","title":"An empirical evaluation of functional alignment using inter-subject decoding","date":"2020-12-08","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"artificial-noise-aided-secure-mimo-wireless","title":"Artificial-Noise-Aided Secure MIMO Wireless Communications via Intelligent Reflecting Surface","date":"2020-02-17","arxiv_id":"2002.07063","n_code_links":0,"syntology":null},{"paper":null,"slug":"estimation-of-spectral-risk-measures","title":"Estimation of Spectral Risk Measures","date":"2019-12-22","arxiv_id":"1912.10398","n_code_links":0,"syntology":null},{"paper":null,"slug":"sum-rate-maximization-for-multiuser-miso","title":"Sum Rate Maximization for Multiuser MISO Downlink with Intelligent Reflecting Surface","date":"2019-12-19","arxiv_id":"1912.09315","n_code_links":0,"syntology":null},{"paper":null,"slug":"reflecting-modulation","title":"Reflecting Modulation","date":"2019-12-18","arxiv_id":"1912.08428","n_code_links":0,"syntology":null},{"paper":null,"slug":"scaling-up-psychology-via-scientific-regret","title":"Scaling up Psychology via Scientific Regret Minimization: A Case Study in Moral Decisions","date":"2019-10-16","arxiv_id":"1910.07581","n_code_links":0,"syntology":null},{"paper":"/paper/srm-a-style-based-recalibration-module-for-1","slug":"srm-a-style-based-recalibration-module-for-1","title":"SRM: A Style-Based Recalibration Module for Convolutional Neural Networks","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":33,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":33,"with_a_code_link":8,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":33,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/srm/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/srm/papers/ran/1","json":"/method/srm/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":3},{"task":"/task/decision-making","name":"Decision Making","papers":3},{"task":"/task/model-selection","name":"Model Selection","papers":2},{"task":"/task/segmentation","name":"Segmentation","papers":2},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":2},{"task":"/task/autonomous-vehicles","name":"Autonomous Vehicles","papers":1},{"task":"/task/collaborative-inference","name":"Collaborative Inference","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/device-cloud-collaboration","name":"Device-Cloud Collaboration","papers":1},{"task":"/task/distributional-reinforcement-learning","name":"Distributional Reinforcement Learning","papers":1},{"task":"/task/edge-computing","name":"Edge-computing","papers":1},{"task":"/task/experimental-design","name":"Experimental Design","papers":1},{"task":"/task/feature-importance","name":"Feature Importance","papers":1},{"task":"/task/in-context-learning","name":"In-Context Learning","papers":1},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":1},{"task":"/task/language-modeling","name":"Language Modeling","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/large-language-model","name":"Large Language Model","papers":1},{"task":"/task/mathematical-reasoning","name":"Mathematical Reasoning","papers":1},{"task":"/task/numerical-integration","name":"Numerical Integration","papers":1}],"tasks_shown":20,"n_tasks":26,"usage_by_year":[{"year":"2019","papers":5},{"year":"2020","papers":2},{"year":"2021","papers":3},{"year":"2022","papers":5},{"year":"2023","papers":5},{"year":"2024","papers":8},{"year":"2025","papers":5}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/srm"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=SRM","read_at":"2026-10-05T01:02:30+00:00","query":"SRM","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"novel DRL algorithm with convergence guarantees that optimizes for a broader class of static Spectral Risk Measures (SRM)","origin_arxiv_id":"2501.02087"},"resolution":"alias","resolved_name_differs":true,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":4,"served":{"arxiv_id":"2501.02087","citations":9},"leading_other_bearer":{"arxiv_id":"2606.13637","title":"The Stable Recovery Manifold: Geometric Principles Governing Recoverability in Continual Learning","citations":0,"named_by":["acronym_expansion"],"bearer_name":"Stable Recovery Manifold (SRM)","ask_with":"have('2606.13637')"},"n_other_bearers_listed":3,"note":"3 other thing(s) here are also called 'SRM', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2501.02087","page":"/paper/beyond-cvar-leveraging-static-spectral-risk","syntology_url":"https://syntology.ai/paper/2501.02087","in_graph_layer":true,"samples":4,"ran":3,"n_ran_checked":2,"n_instrument":1,"unverified":1,"phrase":"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","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"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.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"9faedcea8cf2982dba98459da386e2fb0f9f54612405d380d85b87deff108ff4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}