{"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/lv-vit","slug":"lv-vit","name":"LV-ViT","full_name":"LV-ViT","full_name_withheld":false,"description_markdown":"**LV-ViT** is a type of [vision transformer](https://paperswithcode.com/method/vision-transformer) that uses token labelling as a training objective. Different from the standard training\r\nobjective of ViTs that computes the classification loss on an additional trainable class token, token labelling takes advantage of all the image patch tokens to compute the training loss in a dense manner. Specifically, token labeling reformulates the image classification problem into multiple token-level recognition problems and assigns each patch token with an individual location-specific supervision generated by a machine annotator.","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/2104.10858v3","title":"All Tokens Matter: Token Labeling for Training Better Vision Transformers","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":"Vision Transformers","url":"/methods/category/vision-transformers","pwc_aliases":["vision-transformer"]}],"n_papers_tagged":9,"archive_num_papers":null,"papers_newest_first":[{"paper":"/paper/2408-01986","slug":"2408-01986","title":"DeMansia: Mamba Never Forgets Any Tokens","date":"2024-08-04","arxiv_id":"2408.01986","n_code_links":1,"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":"token-propagation-controller-for-efficient","title":"TPC-ViT: Token Propagation Controller for Efficient Vision Transformer","date":"2024-01-03","arxiv_id":"2401.01470","n_code_links":0,"syntology":null},{"paper":"/paper/the-lottery-ticket-hypothesis-for-vision","slug":"the-lottery-ticket-hypothesis-for-vision","title":"Data Level Lottery Ticket Hypothesis for Vision Transformers","date":"2022-11-02","arxiv_id":"2211.01484","n_code_links":1,"syntology":null},{"paper":"/paper/coarse-to-fine-vision-transformer","slug":"coarse-to-fine-vision-transformer","title":"CF-ViT: A General Coarse-to-Fine Method for Vision Transformer","date":"2022-03-08","arxiv_id":"2203.03821","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":1,"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) · 1 unverified","official":{"repos":["chenmnz/cf-vit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"make-a-long-image-short-adaptive-token-length","title":"Make A Long Image Short: Adaptive Token Length for Vision Transformers","date":"2021-12-03","arxiv_id":"2112.01686","n_code_links":0,"syntology":null},{"paper":"/paper/self-slimmed-vision-transformer","slug":"self-slimmed-vision-transformer","title":"Self-slimmed Vision Transformer","date":"2021-11-24","arxiv_id":"2111.12624","n_code_links":1,"syntology":null},{"paper":null,"slug":"self-slimming-vision-transformer","title":"Self-Slimming Vision Transformer","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/token-labeling-training-a-85-5-top-1-accuracy","slug":"token-labeling-training-a-85-5-top-1-accuracy","title":"All Tokens Matter: Token Labeling for Training Better Vision Transformers","date":"2021-04-22","arxiv_id":"2104.10858","n_code_links":7,"syntology":{"ran":3,"of":5,"n_ran_checked":1,"n_instrument":2,"unverified":2,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["zihangJiang/TokenLabeling"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}}],"papers_shown":9,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":9,"with_a_code_link":6,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":1,"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":3,"papers_where_code_ran_first_page":"/method/lv-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/lv-vit/papers/ran/1","json":"/method/lv-vit/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":4},{"task":"/task/image-classification","name":"image-classification","papers":4},{"task":"/task/efficient-vits","name":"Efficient ViTs","papers":2},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":2},{"task":"/task/action-recognition-in-videos","name":"Action Recognition","papers":1},{"task":"/task/all","name":"All","papers":1},{"task":"/task/analogical-similarity","name":"Analogical Similarity","papers":1},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/informativeness","name":"Informativeness","papers":1},{"task":"/task/mamba","name":"Mamba","papers":1},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":1},{"task":"/task/state-space-models","name":"State Space Models","papers":1},{"task":"/task/token-reduction","name":"Token Reduction","papers":1}],"tasks_shown":14,"n_tasks":14,"usage_by_year":[{"year":"2021","papers":4},{"year":"2022","papers":2},{"year":"2024","papers":3}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/lv-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=LV-ViT","read_at":"2026-10-05T00:58:49+00:00","query":"LV-ViT","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":null,"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 'LV-ViT' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"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":"88c93328d1045b47ebe8487614f7536eedaaafbc2bc8c46defe30fcd66fe47d1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}