SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2501.00946 · 2025

Cached Adaptive Token Merging: Dynamic Token Reduction and Redundant Computation Elimination in Diffusion Model

arXiv · PDF · Open in the Atlas

Code that ran

5 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2501.00946.json · badge: /api/ran/2501.00946.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
copy not recorded community
not in the paper's declared repositories
5 ran · 0 no recorded run
FunctionStatusWhere it lives
bipartite_soft_matching_random2d Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
this paper's copy was not recorded; identical code first harvested from omidiu/ca_tome
pointer only · get_code("7c14a90447a2579f")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

do_nothing Ran
ran, honoured the contract we drafted
this paper's copy was not recorded; identical code first harvested from omidiu/ca_tome
pointer only · get_code("50ce5aa3c4f434e3")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

init_generator Ran
ran; our contract draft was wrong, not the code
this paper's copy was not recorded; identical code first harvested from omidiu/ca_tome
pointer only · get_code("71d0bd8b57e89aba")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

isinstance_str Ran
ran, violated the contract we drafted
this paper's copy was not recorded; identical code first harvested from omidiu/ca_tome
pointer only · get_code("fadc1f6d2d7dd9fa")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

mps_gather_workaround Ran
ran; our contract draft was wrong, not the code
this paper's copy was not recorded; identical code first harvested from omidiu/ca_tome
pointer only · get_code("16eb26a585c085e1")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 5 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 0 the same month, 2 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
isinstance_str 10 other papers
8 dated earlier, 2 later
2303.17604 (2023-03)
Token Merging for Fast Stable Diffusion
2307.10373 (2023-07)
TokenFlow: Consistent Diffusion Features for Consistent Video Editing
2312.02212 (2023-12)
Portrait Diffusion: Training-free Face Stylization with Chain-of-Painting
and 7 more not named here
mps_gather_workaround 7 other papers
4 dated earlier, 2 later, 1 same year, order not determinable · 2 only as an assembly brick
2210.09461 (2022-10)
Token Merging: Your ViT But Faster
2303.17604 (2023-03)
Token Merging for Fast Stable Diffusion
2312.10656 (2023-12)
VidToMe: Video Token Merging for Zero-Shot Video Editing
and 4 more not named here
init_generator 4 other papers
3 dated earlier, 1 same year, order not determinable
2303.17604 (2023-03)
Token Merging for Fast Stable Diffusion
2312.10656 (2023-12)
VidToMe: Video Token Merging for Zero-Shot Video Editing
2403.14622 (2024-03)
Language Repository for Long Video Understanding
and 1 more not named here
bipartite_soft_matching_random2d 1 other paper
1 dated earlier
2303.17604 (2023-03)
Token Merging for Fast Stable Diffusion
do_nothing 1 other paper
1 dated earlier
2303.17604 (2023-03)
Token Merging for Fast Stable Diffusion

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Diffusion models have emerged as a promising approach for generating high-quality, high-dimensional images. Nevertheless, these models are hindered by their high computational cost and slow inference, partly due to the quadratic computational complexity of the self-attention mechanisms with respect to input size. Various approaches have been proposed to address this drawback. One such approach focuses on reducing the number of tokens fed into the self-attention, known as token merging (ToMe). In our method, which is called cached adaptive token merging(CA-ToMe), we calculate the similarity between tokens and then merge the r proportion of the most similar tokens. However, due to the repetitive patterns observed in adjacent steps and the variation in the frequency of similarities, we aim to enhance this approach by implementing an adaptive threshold for merging tokens and adding a caching mechanism that stores similar pairs across several adjacent steps. Empirical results demonstrate that our method operates as a training-free acceleration method, achieving a speedup factor of 1.24 in the denoising process while maintaining the same FID scores compared to existing approaches.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2501.00946")
get_code_for_paper("2501.00946")
have("2501.00946")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2501.00946.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2501.00946.svg)](https://syntology.ai/paper/2501.00946)

Connect an agent — have() is free.