{"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/gct","slug":"gct","name":"GCT","full_name":"Gated Channel Transformation","full_name_withheld":false,"description_markdown":"GCT first collects global information by computing the l2-norm of each channel. Next, a learnable vector $ \\alpha $ is applied to scale the feature. Then a competition mechanism is adopted by channel normalization to interact between channels.\r\n\r\nUnlike previous methods, GCT first collects global information by computing the $l_{2}$-norm of each channel. \r\nNext, a learnable vector $\\alpha$ is applied to scale the feature.\r\nThen a competition mechanism is adopted by \r\nchannel normalization to interact between channels. \r\nLike other common normalization methods, \r\na learnable scale parameter $\\gamma$ and bias $\\beta$ are applied to \r\nrescale the normalization.\r\nHowever, unlike previous methods,\r\nGCT adopts tanh activation to control the attention vector.\r\nFinally, it not only multiplies the input by the attention vector but also adds an identity connection. GCT can be written as: \r\n\\begin{align}\r\n    s = F_\\text{gct}(X, \\theta) & = \\tanh (\\gamma CN(\\alpha \\text{Norm}(X)) + \\beta)\r\n\\end{align}\r\n\\begin{align}\r\n    Y & = s  X + X\r\n\\end{align}\r\n\r\nwhere $\\alpha$, $\\beta$ and $\\gamma$ are trainable parameters. $\\text{Norm}(\\cdot)$ indicates the $L2$-norm of each channel. $CN$ is  channel normalization.\r\n\r\nA GCT block has fewer parameters than an SE block, and as it is  lightweight, \r\n can be added after each convolutional layer of a CNN.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Gated Channel Transformation for Visual Recognition","paper":"/paper/gated-channel-transformation-for-visual","first_author":"Zongxin Yang","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/gated-channel-transformation-for-visual"},"source":{"url":"https://arxiv.org/abs/1909.11519v2","title":"Gated Channel Transformation for Visual Recognition","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":8,"archive_num_papers":8,"papers_newest_first":[{"paper":null,"slug":"steam-squeeze-and-transform-enhanced","title":"STEAM: Squeeze and Transform Enhanced Attention Module","date":"2024-12-12","arxiv_id":"2412.09023","n_code_links":0,"syntology":null},{"paper":"/paper/a-generative-framework-to-bridge-data-driven","slug":"a-generative-framework-to-bridge-data-driven","title":"Generative causal testing to bridge data-driven models and scientific theories in language neuroscience","date":"2024-10-01","arxiv_id":"2410.00812","n_code_links":1,"syntology":{"ran":8,"of":11,"n_ran_checked":2,"n_instrument":6,"unverified":3,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","official":{"repos":["microsoft/automated-explanations"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/teltrans-applying-multi-type-telecom-data-to","slug":"teltrans-applying-multi-type-telecom-data-to","title":"TelTrans: Applying Multi-Type Telecom Data to Transportation Evaluation and Prediction via Multifaceted Graph Modeling","date":"2024-01-06","arxiv_id":"2401.03138","n_code_links":0,"syntology":{"ran":2,"of":7,"n_ran_checked":2,"n_instrument":0,"unverified":5,"pointer_only":7,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":null,"slug":"granger-causality-for-predictability-in","title":"Granger Causality for Predictability in Dynamic Mode Decomposition","date":"2022-10-23","arxiv_id":"2210.12737","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalised-co-salient-object-detection","title":"Generalised Co-Salient Object Detection","date":"2022-08-20","arxiv_id":"2208.09668","n_code_links":0,"syntology":null},{"paper":null,"slug":"csn-component-supervised-network-for-few-shot","title":"GCT: Graph Co-Training for Semi-Supervised Few-Shot Learning","date":"2022-03-15","arxiv_id":"2203.07738","n_code_links":0,"syntology":null},{"paper":null,"slug":"evolutionary-trajectory-and-origin-of-sars","title":"Integrating Fréchet distance and AI reveals the evolutionary trajectory and origin of SARS-CoV-2","date":"2021-10-14","arxiv_id":"2110.07696","n_code_links":0,"syntology":null},{"paper":"/paper/gated-channel-transformation-for-visual","slug":"gated-channel-transformation-for-visual","title":"Gated Channel Transformation for Visual Recognition","date":"2019-09-25","arxiv_id":"1909.11519","n_code_links":3,"syntology":null}],"papers_shown":8,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":8,"with_a_code_link":2,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":8,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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":2,"papers_where_code_ran_first_page":"/method/gct/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/gct/papers/ran/1","json":"/method/gct/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/object-detection","name":"Object Detection","papers":3},{"task":"/task/object-detection-1","name":"object-detection","papers":3},{"task":"/task/image-classification","name":"Image Classification","papers":2},{"task":"/task/instance-segmentation","name":"Instance Segmentation","papers":2},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":2},{"task":"/task/image-classification","name":"image-classification","papers":2},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/co-saliency-detection","name":"Co-Salient Object Detection","papers":1},{"task":"/task/few-shot-learning","name":"Few-Shot Learning","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/graph-learning","name":"Graph Learning","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/object","name":"Object","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1},{"task":"/task/salient-object-detection-1","name":"Salient Object Detection","papers":1},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":1},{"task":"/task/time-series","name":"Time Series Analysis","papers":1},{"task":"/task/traffic-prediction","name":"Traffic Prediction","papers":1},{"task":"/task/video-classification","name":"Video Classification","papers":1}],"tasks_shown":19,"n_tasks":19,"usage_by_year":[{"year":"2019","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":3},{"year":"2024","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/gct"},"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=GCT","read_at":"2026-10-05T00:56:42+00:00","query":"GCT","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":"1909.11519","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'GCT' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["GCT-MARL"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"f65577de0e2423e85c4edcaad4e326bcab219a82a50062b79e3cde84a741f5c8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}