{"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/linformer","slug":"linformer","name":"Linformer","full_name":"Linformer","full_name_withheld":false,"description_markdown":"**Linformer** is a linear [Transformer](https://paperswithcode.com/method/transformer) that utilises a linear self-attention mechanism to tackle the self-attention bottleneck with [Transformer models](https://paperswithcode.com/methods/category/transformers). The original [scaled dot-product attention](https://paperswithcode.com/method/scaled) is decomposed into multiple smaller attentions through linear projections, such that the combination of these operations forms a low-rank factorization of the original attention.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Linformer: Self-Attention with Linear Complexity","paper":"/paper/linformer-self-attention-with-linear","first_author":"Sinong Wang","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/linformer-self-attention-with-linear"},"source":{"url":"https://arxiv.org/abs/2006.04768v3","title":"Linformer: Self-Attention with Linear Complexity","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Natural Language Processing","area_id":"natural-language-processing","collection":"Autoregressive Transformers","url":"/methods/category/autoregressive-transformers","pwc_aliases":[]},{"area":"Natural Language Processing","area_id":"natural-language-processing","collection":"Transformers","url":"/methods/category/transformers","pwc_aliases":[]}],"n_papers_tagged":17,"archive_num_papers":17,"papers_newest_first":[{"paper":null,"slug":"cacheformer-high-attention-based-segment","title":"CacheFormer: High Attention-Based Segment Caching","date":"2025-04-18","arxiv_id":"2504.13981","n_code_links":0,"syntology":null},{"paper":null,"slug":"linformer-a-linear-based-lightweight","title":"LinFormer: A Linear-based Lightweight Transformer Architecture For Time-Aware MIMO Channel Prediction","date":"2024-10-28","arxiv_id":"2410.21351","n_code_links":0,"syntology":null},{"paper":"/paper/joint-fine-tuning-and-conversion-of","slug":"joint-fine-tuning-and-conversion-of","title":"Joint Fine-tuning and Conversion of Pretrained Speech and Language Models towards Linear Complexity","date":"2024-10-09","arxiv_id":"2410.06846","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":1,"n_instrument":4,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["idiap/linearize-distill-pretrained-transformers"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"glmha-a-guided-low-rank-multi-head-self","title":"GLMHA A Guided Low-rank Multi-Head Self-Attention for Efficient Image Restoration and Spectral Reconstruction","date":"2024-10-01","arxiv_id":"2410.00380","n_code_links":0,"syntology":null},{"paper":null,"slug":"sumformer-universal-approximation-for","title":"Sumformer: Universal Approximation for Efficient Transformers","date":"2023-07-05","arxiv_id":"2307.02301","n_code_links":0,"syntology":null},{"paper":"/paper/mpcvit-searching-for-mpc-friendly-vision","slug":"mpcvit-searching-for-mpc-friendly-vision","title":"MPCViT: Searching for Accurate and Efficient MPC-Friendly Vision Transformer with Heterogeneous Attention","date":"2022-11-25","arxiv_id":"2211.13955","n_code_links":1,"syntology":null},{"paper":null,"slug":"treeformer-dense-gradient-trees-for-efficient","title":"Treeformer: Dense Gradient Trees for Efficient Attention Computation","date":"2022-08-18","arxiv_id":"2208.09015","n_code_links":0,"syntology":null},{"paper":null,"slug":"linearizing-transformer-with-key-value-memory","title":"Linearizing Transformer with Key-Value Memory","date":"2022-03-23","arxiv_id":"2203.12644","n_code_links":0,"syntology":null},{"paper":"/paper/sketching-as-a-tool-for-understanding-and","slug":"sketching-as-a-tool-for-understanding-and","title":"Sketching as a Tool for Understanding and Accelerating Self-attention for Long Sequences","date":"2021-12-10","arxiv_id":"2112.05359","n_code_links":1,"syntology":null},{"paper":null,"slug":"greenformers-improving-computation-and-memory","title":"Greenformers: Improving Computation and Memory Efficiency in Transformer Models via Low-Rank Approximation","date":"2021-08-24","arxiv_id":"2108.10808","n_code_links":0,"syntology":null},{"paper":"/paper/vision-xformers-efficient-attention-for-image","slug":"vision-xformers-efficient-attention-for-image","title":"Vision Xformers: Efficient Attention for Image Classification","date":"2021-07-05","arxiv_id":"2107.02239","n_code_links":2,"syntology":null},{"paper":"/paper/styleformer-transformer-based-generative","slug":"styleformer-transformer-based-generative","title":"Styleformer: Transformer based Generative Adversarial Networks with Style Vector","date":"2021-06-13","arxiv_id":"2106.07023","n_code_links":3,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Jeeseung-Park/Styleformer","younggeun-kim/Styleformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"self-supervised-depth-estimation-leveraging","title":"Self-supervised Depth Estimation Leveraging Global Perception and Geometric Smoothness Using On-board Videos","date":"2021-06-07","arxiv_id":"2106.03505","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-practical-survey-on-faster-and-lighter","title":"A Practical Survey on Faster and Lighter Transformers","date":"2021-03-26","arxiv_id":"2103.14636","n_code_links":0,"syntology":null},{"paper":null,"slug":"revisiting-linformer-with-a-modified-self","title":"Revisiting Linformer with a modified self-attention with linear complexity","date":"2020-12-16","arxiv_id":"2101.10277","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-transformers-a-survey","title":"Efficient Transformers: A Survey","date":"2020-09-14","arxiv_id":"2009.06732","n_code_links":0,"syntology":null},{"paper":"/paper/linformer-self-attention-with-linear","slug":"linformer-self-attention-with-linear","title":"Linformer: Self-Attention with Linear Complexity","date":"2020-06-08","arxiv_id":"2006.04768","n_code_links":3,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["facebookresearch/fairseq"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}}],"papers_shown":17,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":17,"with_a_code_link":6,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":17,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"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":3,"papers_where_code_ran_first_page":"/method/linformer/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/linformer/papers/ran/1","json":"/method/linformer/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/language-modelling","name":"Language Modelling","papers":3},{"task":null,"name":"GPU","papers":2},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":2},{"task":"/task/language-modeling","name":"Language Modeling","papers":2},{"task":"/task/survey","name":"Survey","papers":2},{"task":"/task/abstractive-text-summarization","name":"Abstractive Text Summarization","papers":1},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/deblurring","name":"Deblurring","papers":1},{"task":"/task/depth-estimation","name":"Depth Estimation","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/image-generation","name":"Image Generation","papers":1},{"task":"/task/image-restoration","name":"Image Restoration","papers":1},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":1},{"task":"/task/machine-translation","name":"Machine Translation","papers":1},{"task":"/task/mamba","name":"Mamba","papers":1},{"task":"/task/navigate","name":"Navigate","papers":1},{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":1},{"task":null,"name":"Position","papers":1}],"tasks_shown":20,"n_tasks":30,"usage_by_year":[{"year":"2020","papers":3},{"year":"2021","papers":6},{"year":"2022","papers":3},{"year":"2023","papers":1},{"year":"2024","papers":3},{"year":"2025","papers":1}],"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/linformer"},"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=Linformer","read_at":"2026-10-05T00:58:36+00:00","query":"Linformer","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2006.04768"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2006.04768","repositories":{"listed":3,"in_graph":3,"list_truncated":false,"strongest_link":"official"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='2006.04768')","name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"2006.04768","citations":2395},"leading_other_bearer":{"arxiv_id":"2410.21351","title":"LinFormer: A Linear-based Lightweight Transformer Architecture For Time-Aware MIMO Channel Prediction","citations":49,"named_by":["title_prefix"],"bearer_name":"LinFormer: A Linear-based Lightweight Transformer Architecture For Time-Aware MIMO Channel Prediction","ask_with":"have('2410.21351')"},"n_other_bearers_listed":1,"note":"1 other thing(s) here are also called 'Linformer', 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":"2006.04768","page":"/paper/linformer-self-attention-with-linear","syntology_url":"https://syntology.ai/paper/2006.04768","in_graph_layer":true,"samples":4,"ran":3,"n_ran_checked":2,"n_instrument":1,"unverified":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 3 listed of 3 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:2006.04768, not a method entry. This answer is about arXiv:2006.04768, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"2ab445f91f0835a8c6aaa7e1a81165b1870d162329807e16ac9b45ee0e6f7b3c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}