{"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/gmlp","slug":"gmlp","name":"gMLP","full_name":"gMLP","full_name_withheld":false,"description_markdown":"**gMLP** is an [MLP](https://paperswithcode.com/methods/category/feedforward-networks)-based alternative to [Transformers](https://paperswithcode.com/methods/category/vision-transformer) without [self-attention](https://paperswithcode.com/method/scaled), which simply consists of channel projections and spatial projections with static parameterization. It is built out of basic MLP layers with gating. The model consists of a stack of $L$ blocks with identical size and structure. Let $X \\in \\mathbb{R}^{n \\times d}$ be the token representations with sequence length $n$ and dimension $d$. Each block is defined as:\r\n\r\n$$\r\nZ=\\sigma(X U), \\quad \\tilde{Z}=s(Z), \\quad Y=\\tilde{Z} V\r\n$$\r\n\r\nwhere $\\sigma$ is an activation function such as [GeLU](https://paperswithcode.com/method/gelu). $U$ and $V$ define linear projections along the channel dimension - the same as those in the FFNs of Transformers (e.g., their shapes are $768 \\times 3072$ and $3072 \\times 768$ for $\\text{BERT}_{\\text {base }}$).\r\n\r\nA key ingredient is $s(\\cdot)$, a layer which captures spatial interactions. When $s$ is an identity mapping, the above transformation degenerates to a regular FFN, where individual tokens are processed independently without any cross-token communication. One of the major focuses is therefore to design a good $s$ capable of capturing complex spatial interactions across tokens. This leads to the use of a [Spatial Gating Unit](https://www.paperswithcode.com/method/spatial-gating-unit) which involves a modified linear gating.\r\n\r\nThe overall block layout is inspired by [inverted bottlenecks](https://paperswithcode.com/method/inverted-residual-block), which define $s(\\cdot)$ as a [spatial depthwise convolution](https://paperswithcode.com/method/depthwise-separable-convolution). Note, unlike Transformers, gMLP does not require position embeddings because such information will be captured in $s(\\cdot)$.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Pay Attention to MLPs","paper":"/paper/pay-attention-to-mlps","first_author":"Hanxiao Liu","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/pay-attention-to-mlps"},"source":{"url":"https://arxiv.org/abs/2105.08050v2","title":"Pay Attention to MLPs","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Image Models","url":"/methods/category/image-models","pwc_aliases":[]}],"n_papers_tagged":7,"archive_num_papers":7,"papers_newest_first":[{"paper":"/paper/gswin-gated-mlp-vision-model-with","slug":"gswin-gated-mlp-vision-model-with","title":"gSwin: Gated MLP Vision Model with Hierarchical Structure of Shifted Window","date":"2022-08-24","arxiv_id":"2208.11718","n_code_links":0,"syntology":null},{"paper":"/paper/a-proposal-of-multi-layer-perceptron-with","slug":"a-proposal-of-multi-layer-perceptron-with","title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","date":"2022-07-11","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/bag-of-words-vs-sequence-vs-graph-vs","slug":"bag-of-words-vs-sequence-vs-graph-vs","title":"Are We Really Making Much Progress in Text Classification? A Comparative Review","date":"2022-04-08","arxiv_id":"2204.03954","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-language-modeling-with-sparse-all","slug":"efficient-language-modeling-with-sparse-all","title":"Efficient Language Modeling with Sparse all-MLP","date":"2022-03-14","arxiv_id":"2203.06850","n_code_links":0,"syntology":null},{"paper":null,"slug":"convolutional-gated-mlp-combining","title":"Convolutional Gated MLP: Combining Convolutions & gMLP","date":"2021-11-06","arxiv_id":"2111.03940","n_code_links":0,"syntology":null},{"paper":"/paper/cyclemlp-a-mlp-like-architecture-for-dense","slug":"cyclemlp-a-mlp-like-architecture-for-dense","title":"CycleMLP: A MLP-like Architecture for Dense Prediction","date":"2021-07-21","arxiv_id":"2107.10224","n_code_links":8,"syntology":{"ran":10,"of":15,"n_ran_checked":9,"n_instrument":1,"unverified":5,"pointer_only":2,"phrase":"10 ran (of which 6 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["ShoufaChen/CycleMLP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":"/paper/pay-attention-to-mlps","slug":"pay-attention-to-mlps","title":"Pay Attention to MLPs","date":"2021-05-17","arxiv_id":"2105.08050","n_code_links":20,"syntology":{"ran":34,"of":44,"n_ran_checked":31,"n_instrument":3,"unverified":10,"pointer_only":11,"phrase":"34 ran (of which 15 constructed an object rather than computing a result; 31 with no instrument failure: 1 honoured, 4 violated, 26 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","official":null}}],"papers_shown":7,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7,"with_a_code_link":4,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":7,"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/gmlp/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/gmlp/papers/ran/1","json":"/method/gmlp/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":3},{"task":"/task/instance-segmentation","name":"Instance Segmentation","papers":2},{"task":"/task/object-detection","name":"Object Detection","papers":2},{"task":"/task/question-answering","name":"Question Answering","papers":2},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":2},{"task":"/task/object-detection-1","name":"object-detection","papers":2},{"task":"/task/all","name":"All","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/common-sense-reasoning","name":"Common Sense Reasoning","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1},{"task":"/task/in-context-learning","name":"In-Context Learning","papers":1},{"task":"/task/language-modeling","name":"Language Modeling","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/mixture-of-experts","name":"Mixture-of-Experts","papers":1},{"task":"/task/multi-label-text-classification-1","name":"Multi Label Text Classification","papers":1},{"task":"/task/multi-label-classification","name":"Multi-Label Classification","papers":1},{"task":"/task/multi-label-text-classification","name":"Multi-Label Text Classification","papers":1},{"task":"/task/natural-language-inference","name":"Natural Language Inference","papers":1}],"tasks_shown":20,"n_tasks":31,"usage_by_year":[{"year":"2021","papers":3},{"year":"2022","papers":4}],"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/gmlp"},"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=gMLP","read_at":"2026-10-05T00:57:04+00:00","query":"gMLP","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":"gMLP","origin_arxiv_id":"2105.08050"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2105.08050","repositories":{"listed":5,"in_graph":20,"list_truncated":true,"strongest_link":"mentioned_in_github"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2105.08050","citations":null},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'gMLP'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2105.08050","page":"/paper/pay-attention-to-mlps","syntology_url":"https://syntology.ai/paper/2105.08050","in_graph_layer":true,"samples":44,"ran":34,"n_ran_checked":31,"n_instrument":3,"unverified":10,"phrase":"34 ran (of which 15 constructed an object rather than computing a result; 31 with no instrument failure: 1 honoured, 4 violated, 26 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 20 in the graph, strongest link: mentioned on GitHub). This answer is about arXiv:2105.08050, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"79f19d22c9aa9a0f1292777128c3ae0229376a68080055201784c9958fcc03aa","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}