{"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/rga","slug":"rga","name":"RGA","full_name":"Relation-aware Global Attention","full_name_withheld":false,"description_markdown":"In relation-aware global attention (RGA) stresses the importance of global structural information provided by pairwise relations, and uses it to produce attention maps. \r\n\r\nRGA comes in two forms,  spatial RGA (RGA-S) and channel RGA (RGA-C). RGA-S first reshapes the input feature map $X$ to $C\\times (H\\times W)$ and the pairwise relation matrix $R \\in \\mathbb{R}^{(H\\times W)\\times (H\\times W)}$ is computed using \r\n\\begin{align}\r\n    Q &= \\delta(W^QX) \r\n\\end{align}\r\n\\begin{align}\r\n    K &= \\delta(W^KX) \r\n\\end{align}\r\n\\begin{align}\r\n    R &= Q^TK\r\n\\end{align}\r\nThe relation vector $r_i$ at position $i$ is defined by stacking  pairwise relations at all positions:\r\n\\begin{align}\r\n    r_i = [R(i, :); R(:,i)]    \r\n\\end{align}\r\nand the spatial relation-aware feature $y_i$ can be written as\r\n\\begin{align}\r\n    Y_i = [g^c_\\text{avg}(\\delta(W^\\varphi x_i)); \\delta(W^\\phi r_i)]\r\n\\end{align}\r\nwhere $g^c_\\text{avg}$ denotes global average pooling in the channel domain. Finally, the spatial attention score at position $i$ is given by \r\n\\begin{align}\r\n    a_i = \\sigma(W_2\\delta(W_1y_i))\r\n\\end{align}\r\nRGA-C has the same form as RGA-S, except for taking the input feature map as a set of $H\\times W$-dimensional features.\r\n\r\nRGA uses global relations to generate the attention score for each feature node,  so provides valuable structural information and significantly enhances the representational power. RGA-S and RGA-C are flexible enough to be used in any CNN network; Zhang et al. propose  using them jointly in sequence to better capture both spatial and cross-channel relationships.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Relation-Aware Global Attention for Person Re-identification","paper":"/paper/relation-aware-global-attention","first_author":"Zhizheng Zhang","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/relation-aware-global-attention"},"source":{"url":"https://arxiv.org/abs/1904.02998v2","title":"Relation-Aware Global Attention for Person Re-identification","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":11,"archive_num_papers":11,"papers_newest_first":[{"paper":null,"slug":"a-family-of-robust-generalized-adaptive","title":"A Family of Robust Generalized Adaptive Filters and Application for Time-series Prediction","date":"2025-05-31","arxiv_id":"2506.00397","n_code_links":0,"syntology":null},{"paper":null,"slug":"bridging-the-reality-gap-in-digital-twins","title":"Bridging the Reality Gap in Digital Twins with Context-Aware, Physics-Guided Deep Learning","date":"2025-05-17","arxiv_id":"2505.11847","n_code_links":0,"syntology":null},{"paper":null,"slug":"cognisnn-a-first-exploration-to-random-graph","title":"CogniSNN: A First Exploration to Random Graph Architecture based Spiking Neural Networks with Enhanced Expandability and Neuroplasticity","date":"2025-05-09","arxiv_id":"2505.05992","n_code_links":0,"syntology":null},{"paper":null,"slug":"region-guided-attack-on-the-segment-anything","title":"Region-Guided Attack on the Segment Anything Model (SAM)","date":"2024-11-05","arxiv_id":"2411.02974","n_code_links":0,"syntology":null},{"paper":"/paper/rate-gradient-approximation-attack-threats","slug":"rate-gradient-approximation-attack-threats","title":"Rate Gradient Approximation Attack Threats Deep Spiking Neural Networks","date":"2023-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/reinforced-genetic-algorithm-for-structure","slug":"reinforced-genetic-algorithm-for-structure","title":"Reinforced Genetic Algorithm for Structure-based Drug Design","date":"2022-11-28","arxiv_id":"2211.16508","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-use-of-the-moore-penrose-pseudoinverse-for","title":"On Use of the Moore-Penrose Pseudoinverse for Evaluating the RGA of Non-Square Systems","date":"2021-06-17","arxiv_id":"2106.09766","n_code_links":0,"syntology":null},{"paper":null,"slug":"adversarial-blocking-bandits","title":"Adversarial Blocking Bandits","date":"2020-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"quantization-in-relative-gradient-angle","title":"Quantization in Relative Gradient Angle Domain For Building Polygon Estimation","date":"2020-07-10","arxiv_id":"2007.05617","n_code_links":0,"syntology":null},{"paper":null,"slug":"delving-into-the-imbalance-of-positive","title":"Delving into the Imbalance of Positive Proposals in Two-stage Object Detection","date":"2020-05-23","arxiv_id":"2005.11472","n_code_links":0,"syntology":null},{"paper":"/paper/relation-aware-global-attention","slug":"relation-aware-global-attention","title":"Relation-Aware Global Attention for Person Re-identification","date":"2019-04-05","arxiv_id":"1904.02998","n_code_links":1,"syntology":{"ran":3,"of":6,"n_ran_checked":3,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["microsoft/Relation-Aware-Global-Attention-Networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}}],"papers_shown":11,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":11,"with_a_code_link":3,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":11,"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/rga/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/rga/papers/ran/1","json":"/method/rga/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":2},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/blocking","name":"Blocking","papers":1},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/combinatorial-optimization","name":"Combinatorial Optimization","papers":1},{"task":"/task/continual-learning","name":"Continual Learning","papers":1},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":1},{"task":"/task/drug-design","name":"Drug Design","papers":1},{"task":"/task/drug-discovery","name":"Drug Discovery","papers":1},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":1},{"task":"/task/object-detection","name":"Object Detection","papers":1},{"task":"/task/person-re-identification","name":"Person Re-Identification","papers":1},{"task":"/task/quantization","name":"Quantization","papers":1},{"task":null,"name":"Relation","papers":1},{"task":"/task/scene-segmentation","name":"Scene Segmentation","papers":1},{"task":"/task/segmentation","name":"Segmentation","papers":1},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":1},{"task":"/task/structural-health-monitoring","name":"Structural Health Monitoring","papers":1},{"task":"/task/time-series-1","name":"Time Series","papers":1},{"task":"/task/time-series-prediction","name":"Time Series Prediction","papers":1}],"tasks_shown":20,"n_tasks":23,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":3},{"year":"2021","papers":1},{"year":"2022","papers":1},{"year":"2023","papers":1},{"year":"2024","papers":1},{"year":"2025","papers":3}],"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/rga"},"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=RGA","read_at":"2026-10-05T01:01:17+00:00","query":"RGA","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1904.02998","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":1,"served":null,"leading_other_bearer":{"arxiv_id":"2602.12968","title":"RGAlign-Rec: Ranking-Guided Alignment for Latent Query Reasoning in Recommendation Systems","citations":0,"named_by":["acronym_expansion"],"bearer_name":"Ranking-Guided Alignment (RGA)","ask_with":"have('2602.12968')"},"n_other_bearers_listed":1,"note":"Nothing resolved to 'RGA' by name, but 1 thing(s) here DECLARE that name -- most cited: 'Ranking-Guided Alignment (RGA)', a method in 'RGAlign-Rec: Ranking-Guided Alignment for Latent Query Reasoning in Recommendation Systems' (arXiv:2602.12968, 0 citations). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 1 entry in Syntology's graph carry it; the most cited is “Ranking-Guided Alignment (RGA)”, a method in the paper “RGAlign-Rec: Ranking-Guided Alignment for Latent Query Reasoning in Recommendation Systems” (arXiv:2602.12968, 0 citations). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","near_matches":["Ranking-Guided Alignment (RGA)","Reward-Guided Autoregressive Graph Generation (RGA-Designer)"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"dd3d83c1b7a471d128ce15e077799575c48e6c234ea26b914f817dc73b27654b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}