{"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/t2t-vit","slug":"t2t-vit","name":"T2T-ViT","full_name":"Tokens-To-Token Vision Transformer","full_name_withheld":false,"description_markdown":"**T2T-ViT** (Tokens-To-Token Vision Transformer) is a type of [Vision Transformer](https://paperswithcode.com/method/vision-transformer) which incorporates 1) a layerwise Tokens-to-Token (T2T) transformation to progressively structurize the image to tokens by recursively aggregating neighboring Tokens into one Token (Tokens-to-Token), such that local structure represented by surrounding tokens can be modeled and tokens length can be reduced; 2) an efficient backbone with a deep-narrow structure for vision [transformer](https://paperswithcode.com/method/transformer) motivated by CNN architecture design after empirical study.","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"https://arxiv.org/abs/2101.11986v3","title":"Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNet","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/yitu-opensource/T2T-ViT/blob/main/models/t2t_vit.py","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Vision Transformers","url":"/methods/category/vision-transformers","pwc_aliases":["vision-transformer"]}],"n_papers_tagged":11,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"changing-base-without-losing-pace-a-gpu","title":"Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs","date":"2025-03-15","arxiv_id":"2503.12211","n_code_links":0,"syntology":null},{"paper":"/paper/multi-criteria-token-fusion-with-one-step","slug":"multi-criteria-token-fusion-with-one-step","title":"Multi-criteria Token Fusion with One-step-ahead Attention for Efficient Vision Transformers","date":"2024-03-15","arxiv_id":"2403.10030","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":0,"n_instrument":3,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["mlvlab/mctf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"usdc-unified-static-and-dynamic-compression","title":"USDC: Unified Static and Dynamic Compression for Visual Transformer","date":"2023-10-17","arxiv_id":"2310.11117","n_code_links":0,"syntology":null},{"paper":"/paper/kdeformer-accelerating-transformers-via","slug":"kdeformer-accelerating-transformers-via","title":"KDEformer: Accelerating Transformers via Kernel Density Estimation","date":"2023-02-05","arxiv_id":"2302.02451","n_code_links":1,"syntology":{"ran":8,"of":12,"n_ran_checked":1,"n_instrument":7,"unverified":4,"pointer_only":0,"phrase":"8 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; 7 where Syntology's instrument failed) · 4 unverified","official":{"repos":["majid-daliri/kdeformer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/unified-visual-transformer-compression-1","slug":"unified-visual-transformer-compression-1","title":"Unified Visual Transformer Compression","date":"2022-03-15","arxiv_id":"2203.08243","n_code_links":1,"syntology":{"ran":9,"of":16,"n_ran_checked":6,"n_instrument":3,"unverified":7,"pointer_only":3,"phrase":"9 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","official":{"repos":["VITA-Group/UVC"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/bvit-broad-attention-based-vision-transformer","slug":"bvit-broad-attention-based-vision-transformer","title":"BViT: Broad Attention based Vision Transformer","date":"2022-02-13","arxiv_id":"2202.06268","n_code_links":1,"syntology":null},{"paper":"/paper/multi-dimensional-model-compression-of-vision","slug":"multi-dimensional-model-compression-of-vision","title":"Multi-Dimensional Model Compression of Vision Transformer","date":"2021-12-31","arxiv_id":"2201.00043","n_code_links":1,"syntology":null},{"paper":"/paper/dynamic-token-normalization-improves-vision-1","slug":"dynamic-token-normalization-improves-vision-1","title":"Dynamic Token Normalization Improves Vision Transformers","date":"2021-12-05","arxiv_id":"2112.02624","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["wqshao126/dtn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/scatterbrain-unifying-sparse-and-low-rank","slug":"scatterbrain-unifying-sparse-and-low-rank","title":"Scatterbrain: Unifying Sparse and Low-rank Attention Approximation","date":"2021-10-28","arxiv_id":"2110.15343","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["hazyresearch/scatterbrain"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/scatterbrain-unifying-sparse-and-low-rank-1","slug":"scatterbrain-unifying-sparse-and-low-rank-1","title":"Scatterbrain: Unifying Sparse and Low-rank Attention","date":"2021-05-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/tokens-to-token-vit-training-vision","slug":"tokens-to-token-vit-training-vision","title":"Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNet","date":"2021-01-28","arxiv_id":"2101.11986","n_code_links":13,"syntology":{"ran":21,"of":26,"n_ran_checked":21,"n_instrument":0,"unverified":5,"pointer_only":8,"phrase":"21 ran (of which 16 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 0 violated, 20 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["yitu-opensource/T2T-ViT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}}],"papers_shown":11,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":11,"with_a_code_link":9,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":11,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":2,"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":6,"papers_where_code_ran_first_page":"/method/t2t-vit/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/t2t-vit/papers/ran/1","json":"/method/t2t-vit/papers/ran/1.json","rows":6}],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":3},{"task":"/task/image-generation","name":"Image Generation","papers":3},{"task":"/task/language-modeling","name":"Language Modeling","papers":3},{"task":"/task/language-modelling","name":"Language Modelling","papers":3},{"task":"/task/image-classification","name":"image-classification","papers":3},{"task":"/task/model-compression","name":"Model Compression","papers":2},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/density-estimation","name":"Density Estimation","papers":1},{"task":"/task/efficient-vits","name":"Efficient ViTs","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":1},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":1},{"task":"/task/listops","name":"ListOps","papers":1},{"task":"/task/object-detection","name":"Object Detection","papers":1},{"task":"/task/object-recognition","name":"Object Recognition","papers":1},{"task":"/task/model","name":"model","papers":1},{"task":"/task/object-detection-1","name":"object-detection","papers":1}],"tasks_shown":17,"n_tasks":17,"usage_by_year":[{"year":"2021","papers":5},{"year":"2022","papers":2},{"year":"2023","papers":2},{"year":"2024","papers":1},{"year":"2025","papers":1}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/t2t-vit"},"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=T2T-ViT","read_at":"2026-10-05T01:02:52+00:00","query":"T2T-ViT","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":"Tokens-To-Token Vision Transformer (T2T-ViT)","origin_arxiv_id":"2101.11986"},"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":5,"in_graph":13,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2101.11986","citations":2549},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'T2T-ViT'. 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":[{"name":"Fast T2T","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Fast T2T')","origin_arxiv_id":"2502.02941"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2101.11986","page":"/paper/tokens-to-token-vit-training-vision","syntology_url":"https://syntology.ai/paper/2101.11986","in_graph_layer":true,"samples":26,"ran":21,"n_ran_checked":21,"n_instrument":0,"unverified":5,"phrase":"21 ran (of which 16 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 0 violated, 20 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 13 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'Tokens-To-Token Vision Transformer (T2T-ViT)' (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:2101.11986) is about this method is not checked.","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":"c6a802d8f7894b0b8f339487f933fb5b483b5cd4e8d3dcc0dfef88d2dea830d3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}