{"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":"/task/token-reduction/papers/ran/1","list_of":"/task/token-reduction","task":"Token Reduction","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,21],"of":21,"counts":{"archive_papers_tagged":78,"with_a_code_link":37,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":78,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":15,"listed_every_run_a_failure_of_syntologys_instrument":6,"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"},"first_page":"/task/token-reduction/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/flowcut-rethinking-redundancy-via-information","slug":"flowcut-rethinking-redundancy-via-information","title":"FlowCut: Rethinking Redundancy via Information Flow for Efficient Vision-Language Models","date":"2025-05-26","arxiv_id":"2505.19536","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/flowcut-rethinking-redundancy-via-information#ran","syntology_url":"https://syntology.ai/paper/2505.19536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19536"}},"official":{"repos":["tungchintao/flowcut"],"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"]}}},{"url":"/paper/not-all-tokens-are-what-you-need-in-thinking","slug":"not-all-tokens-are-what-you-need-in-thinking","title":"Not All Tokens Are What You Need In Thinking","date":"2025-05-23","arxiv_id":"2505.17827","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/not-all-tokens-are-what-you-need-in-thinking#ran","syntology_url":"https://syntology.ai/paper/2505.17827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.17827"}},"official":{"repos":["faustrazor/not-all-thinking-tokens"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/streamline-without-sacrifice-squeeze-out","slug":"streamline-without-sacrifice-squeeze-out","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","date":"2025-05-21","arxiv_id":"2505.15816","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/streamline-without-sacrifice-squeeze-out#ran","syntology_url":"https://syntology.ai/paper/2505.15816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.15816"}},"official":{"repos":["penghao-wu/proxyv"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/attend-to-not-attended-structure-then-detail","slug":"attend-to-not-attended-structure-then-detail","title":"Attend to Not Attended: Structure-then-Detail Token Merging for Post-training DiT Acceleration","date":"2025-05-16","arxiv_id":"2505.11707","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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) · 0 unverified","sample_list":"/paper/attend-to-not-attended-structure-then-detail#ran","syntology_url":"https://syntology.ai/paper/2505.11707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.11707"}},"official":null}},{"url":"/paper/pact-pruning-and-clustering-based-token","slug":"pact-pruning-and-clustering-based-token","title":"PACT: Pruning and Clustering-Based Token Reduction for Faster Visual Language Models","date":"2025-04-11","arxiv_id":"2504.08966","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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) · 1 unverified","sample_list":"/paper/pact-pruning-and-clustering-based-token#ran","syntology_url":"https://syntology.ai/paper/2504.08966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.08966"}},"official":{"repos":["orailix/pact"],"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"]}}},{"url":"/paper/cached-adaptive-token-merging-dynamic-token","slug":"cached-adaptive-token-merging-dynamic-token","title":"Cached Adaptive Token Merging: Dynamic Token Reduction and Redundant Computation Elimination in Diffusion Model","date":"2025-01-01","arxiv_id":"2501.00946","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cached-adaptive-token-merging-dynamic-token#ran","syntology_url":"https://syntology.ai/paper/2501.00946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.00946"}},"official":{"repos":["omidiu/ca_tome"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/framefusion-combining-similarity-and","slug":"framefusion-combining-similarity-and","title":"FrameFusion: Combining Similarity and Importance for Video Token Reduction on Large Visual Language Models","date":"2024-12-30","arxiv_id":"2501.01986","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/framefusion-combining-similarity-and#ran","syntology_url":"https://syntology.ai/paper/2501.01986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.01986"}},"official":{"repos":["thu-nics/framefusion"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-merge-tokens-via-decoupled","slug":"learning-to-merge-tokens-via-decoupled","title":"Learning to Merge Tokens via Decoupled Embedding for Efficient Vision Transformers","date":"2024-12-13","arxiv_id":"2412.10569","repositories_listed":1,"syntology":{"n":34,"n_ran":28,"n_constructed":1,"n_ran_checked":25,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":25,"n_pointer_only":4,"phrase":"28 ran (of which 1 constructed an object rather than computing a result; 25 with no instrument failure: 0 honoured, 0 violated, 25 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-to-merge-tokens-via-decoupled#ran","syntology_url":"https://syntology.ai/paper/2412.10569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.10569"}},"official":{"repos":["movinghoon/dtem"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/inference-optimal-vlms-need-only-one-visual","slug":"inference-optimal-vlms-need-only-one-visual","title":"Inference Optimal VLMs Need Fewer Visual Tokens and More Parameters","date":"2024-11-05","arxiv_id":"2411.03312","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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","sample_list":"/paper/inference-optimal-vlms-need-only-one-visual#ran","syntology_url":"https://syntology.ai/paper/2411.03312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03312"}},"official":{"repos":["locuslab/llava-token-compression"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/longvu-spatiotemporal-adaptive-compression","slug":"longvu-spatiotemporal-adaptive-compression","title":"LongVU: Spatiotemporal Adaptive Compression for Long Video-Language Understanding","date":"2024-10-22","arxiv_id":"2410.17434","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/longvu-spatiotemporal-adaptive-compression#ran","syntology_url":"https://syntology.ai/paper/2410.17434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17434"}},"official":{"repos":["Vision-CAIR/LongVU"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-token-reduction-for-state-space","slug":"rethinking-token-reduction-for-state-space","title":"Rethinking Token Reduction for State Space Models","date":"2024-10-16","arxiv_id":"2410.14725","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-token-reduction-for-state-space#ran","syntology_url":"https://syntology.ai/paper/2410.14725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14725"}},"official":{"repos":["wuyushuwys/tor_ssm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fastadasp-multitask-adapted-efficient","slug":"fastadasp-multitask-adapted-efficient","title":"FastAdaSP: Multitask-Adapted Efficient Inference for Large Speech Language Model","date":"2024-10-03","arxiv_id":"2410.03007","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fastadasp-multitask-adapted-efficient#ran","syntology_url":"https://syntology.ai/paper/2410.03007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03007"}},"official":{"repos":["yichen14/fastadasp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/discovering-the-gems-in-early-layers","slug":"discovering-the-gems-in-early-layers","title":"Discovering the Gems in Early Layers: Accelerating Long-Context LLMs with 1000x Input Token Reduction","date":"2024-09-25","arxiv_id":"2409.17422","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":9,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 1 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/discovering-the-gems-in-early-layers#ran","syntology_url":"https://syntology.ai/paper/2409.17422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17422"}},"official":{"repos":["salesforceairesearch/gemfilter"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/less-is-more-a-simple-yet-effective-token","slug":"less-is-more-a-simple-yet-effective-token","title":"Less is More: A Simple yet Effective Token Reduction Method for Efficient Multi-modal LLMs","date":"2024-09-17","arxiv_id":"2409.10994","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/less-is-more-a-simple-yet-effective-token#ran","syntology_url":"https://syntology.ai/paper/2409.10994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.10994"}},"official":{"repos":["freedomintelligence/trim"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-local-details-and-global-context-in","slug":"bridging-local-details-and-global-context-in","title":"Bridging Local Details and Global Context in Text-Attributed Graphs","date":"2024-06-18","arxiv_id":"2406.12608","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/bridging-local-details-and-global-context-in#ran","syntology_url":"https://syntology.ai/paper/2406.12608","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12608"}},"official":{"repos":["wykk00/graphbridge"],"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"]}}},{"url":"/paper/algm-adaptive-local-then-global-token-merging-1","slug":"algm-adaptive-local-then-global-token-merging-1","title":"ALGM: Adaptive Local-then-Global Token Merging for Efficient Semantic Segmentation with Plain Vision Transformers","date":"2024-06-14","arxiv_id":"2406.09936","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/algm-adaptive-local-then-global-token-merging-1#ran","syntology_url":"https://syntology.ai/paper/2406.09936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09936"}},"official":{"repos":["tue-mps/algm-segmenter"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-context-merging-better-long","slug":"hierarchical-context-merging-better-long","title":"Hierarchical Context Merging: Better Long Context Understanding for Pre-trained LLMs","date":"2024-04-16","arxiv_id":"2404.10308","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":1,"n_ran_checked":7,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":15,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hierarchical-context-merging-better-long#ran","syntology_url":"https://syntology.ai/paper/2404.10308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10308"}},"official":{"repos":["alinlab/homer"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":1,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/llava-prumerge-adaptive-token-reduction-for","slug":"llava-prumerge-adaptive-token-reduction-for","title":"LLaVA-PruMerge: Adaptive Token Reduction for Efficient Large Multimodal Models","date":"2024-03-22","arxiv_id":"2403.15388","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llava-prumerge-adaptive-token-reduction-for#ran","syntology_url":"https://syntology.ai/paper/2403.15388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15388"}},"official":null}},{"url":"/paper/which-tokens-to-use-investigating-token","slug":"which-tokens-to-use-investigating-token","title":"Which Tokens to Use? Investigating Token Reduction in Vision Transformers","date":"2023-08-09","arxiv_id":"2308.04657","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/which-tokens-to-use-investigating-token#ran","syntology_url":"https://syntology.ai/paper/2308.04657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.04657"}},"official":null}},{"url":"/paper/pumer-pruning-and-merging-tokens-for","slug":"pumer-pruning-and-merging-tokens-for","title":"PuMer: Pruning and Merging Tokens for Efficient Vision Language Models","date":"2023-05-27","arxiv_id":"2305.17530","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pumer-pruning-and-merging-tokens-for#ran","syntology_url":"https://syntology.ai/paper/2305.17530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17530"}},"official":{"repos":["csarron/pumer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adavit-adaptive-tokens-for-efficient-vision","slug":"adavit-adaptive-tokens-for-efficient-vision","title":"AdaViT: Adaptive Tokens for Efficient Vision Transformer","date":"2021-12-14","arxiv_id":"2112.07658","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adavit-adaptive-tokens-for-efficient-vision#ran","syntology_url":"https://syntology.ai/paper/2112.07658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07658"}},"official":null}}],"record_sha256":"fa0b6f0a68f6cf092e001ff36628fa53c9413b4c1eb24c8288d8d97707f6299c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}