Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shaoyi Zheng

dblp:417/5417 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 60% Generative modeling · 40%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
ToMA: Token Merge with Attention for Diffusion Models · ICML 2025
Machine learning › Generative modeling › diffusion model
diffusion model acceleration
0.912025
ToMA: Token Merge with Attention for Diffusion Models · ICML 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
ToMA: Token Merge with Attention for Diffusion Models · ICML 2025
Machine learning › Efficient and distributed learning › model compression › token compression
token merging
0.912025
ToMA: Token Merge with Attention for Diffusion Models · ICML 2025
Machine learning › Efficient and distributed learning
token reduction
0.912025
ToMA: Token Merge with Attention for Diffusion Models · ICML 2025

Methods — techniques the papers use, named apart from their topics

submodular optimization · 0.9flashattention · 0.9
YearPublicationVenuePosition
2025 ToMA: Token Merge with Attention for Diffusion Models
abstract
Diffusion models excel in high-fidelity image generation but face scalability limits due to transformers’ quadratic attention complexity. Plug-and-play token reduction methods like ToMeSD and ToFu reduce FLOPs by merging redundant tokens in generated images but rely on GPU-inefficient operations (e.g., sorting, scattered writes), introducing overheads that negate theoretical speedups when paired with optimized attention implementations (e.g., FlashAttention). To bridge this gap, we propose Token Merge with Attention (ToMA), an off-the-shelf method that redesigns token reduction for GPU-aligned efficiency, with three key contributions: 1) a reformulation of token merging as a submodular optimization problem to select diverse tokens; 2) merge/unmerge as an attention-like linear transformation via GPU-friendly matrix operations; and 3) exploiting latent locality and sequential redundancy (pattern reuse) to minimize overhead. ToMA reduces SDXL/Flux generation latency by 24%/23% (DINO $\Delta <$ 0.07), outperforming prior methods. This work bridges the gap between theoretical and practical efficiency for transformers in diffusion.
Shaoyi Zheng, Yuxuan Xia, Shengjie Wang 0001
ICML2