DSA: Efficient Inference For Video Generation Models via Distributed Sparse Attention

Published as a conference paper at ICLR 2026

DSA: EFFICIENT SERVING FOR VIDEO GENERATION

MODELS VIA DISTRIBUTED SPARSE ATTENTION

Shenggui Li

Nanyang Technological University

[email protected]

Runyu Lu

University of Michigan

[email protected]

Qiaolin Chen

Nanyang Technological University

[email protected]

Haiyan Yin

CFAR and IHPC, Agency for Science,

Technology and Research (A*STAR), Singapore

yin [email protected]

Yueming Lyu

CFAR and IHPC, Agency for Science,

Technology and Research (A*STAR), Singapore

lyu [email protected]

Yonggang Wen

Nanyang Technological University

[email protected]

Ivor Tsang

CFAR and IHPC, Agency for Science,

Technology and Research (A*STAR), Singapore

ivor [email protected]

Tianwei Zhang

Nanyang Technological University

[email protected]

ABSTRACT

Diffusion Transformer models have driven the rapid advances in video generation,

achieving state-of-the-art quality and flexibility. However, their attention mech-

anism remains a major performance bottleneck, as its dense computation scales

quadratically with the sequence length. To overcome this limitation and reduce

the generation latency, we propose DSA, a novel attention mechanism that inte-

grates sparse attention with distributed inference for diffusion-based video gener-

ation. By leveraging carefully-designed parallelism strategies and scheduling, DSA

significantly reduces redundant computation while preserving global context. Ex-

tensive experiments on benchmark datasets demonstrate that, when deployed on

8 GPUs, DSA achieves up to 1.43× inference speedup than the existing distributed

method and 10.79× faster than single-GPU inference.

INTRODUCTION

Recent advances in generative models have transformed the landscape of digital content creation,

introducing unprecedented capabilities in generating sophisticated visual content (Rombach et al.,

2021; Ho et al., 2020; Song et al., 2020; Ding et al., 2021). This breakthrough has streamlined

creative processes across multiple industries, from artistic design to media production. Particu-

larly, advanced video generative models have been integrated into professional workflows through

proprietary commercial platforms such as Google Veo, Kwai Kling and OpenAI Sora, as well as

open-sourced alternatives like Stable Video Diffusion (Blattmann et al., 2023), Mochi (Team, 2024),

CogVideo (Hong et al., 2023), Hunyuan Video (Kong et al., 2024) and Wan (Wan et al., 2025).

In the field of vision generation, diffusion transformer models (DiTs) have emerged as a cornerstone,

renowned for their ability to synthesize highly realistic and visually coherent outputs (Peebles & Xie,

2022). By setting new benchmarks in video quality, these models represent a major step forward

in computer-generated content. However, this advantage comes at the cost of prohibitive inference

latency due to the substantial computational overhead of the attention mechanism. In practice, DiTs

often rely on full attention across temporal and spatial dimensions (Zheng et al., 2024; Lin et al.,

Published as a conference paper at ICLR 2026

2024; Hong et al., 2023; Wan et al., 2025), which incurs quadratic complexity with respect to the

sequence length. This scaling bottleneck poses severe challenges for generating high-resolution,

long-duration videos. For instance, producing a 5-second, 720p video with Wan2.1-14B (Wan et al.,

2025) requires approximately 31 minutes. This underscores the inefficiency of current approaches

and their prohibitive nature for commercial applications, necessitating further optimization.

Prior projects focus on the transformation from dense attention to sparse attention (Zhang et al.,

2025a; Xi et al., 2025; Zhang et al., 2025c;b). Video data inherently exhibit sparsity in the tem-

poral and spatial dimension. Therefore, sparse attention methods typically rely on the observation

that only a subset of temporal or spatial tokens contribute significantly to the next-step denoising.

By dynamically pruning attention maps, these methods achieve notable FLOP reductions without

retraining. However, such savings alone are insufficient at scale. Another domain focuses on the

system optimization. xDiT (Fang et al., 2024) successfully applies sequence parallelism (Li et al.,

2023; Fang & Zhao, 2024; Liu et al., 2024; Jacobs et al., 2024) for video generations. By splitting

the hidden states along the sequence dimension, sequence parallelism can evenly distribute the com-

putation workloads across GPUs, reducing the overall latency. However, this method often achieves

sub-linear scaling due to extra communication overhead. One direction for further improvement

is the integration of sparse attention and distributed inference. MagiAttention (Zewei & Yunpeng,

2025) combines sparse attention and distributed attention. However, it is used for training Large

Language Models (LLMs) instead of inference.

Our proposed Distributed Sparse Attention (DSA) bridges this gap by jointly exploiting redundancy

in attention maps and the computational capacity of distributed hardware. DSA is built on two

key components: mixed parallelism (MP) and dynamic attention scheduling (DAS). At runtime,

a lightweight profiler determines the attention pattern for each head, after which the most suitable

sequence parallelism strategy is applied. This adaptive choice ensures that both computation and

communication overheads are substantially reduced. Furthermore, since the distribution of attention

patterns can vary across layers and time steps, DAS dynamically adjusts the execution order to better

overlap computation with communication, thereby maximizing the efficiency. Notably, this design

achieves super-linear scaling, enabling larger models to run faster than their smaller counterparts

under specific configurations.

Overall, our work makes the following key contributions: (1) We analyze the runtime characteristics

of advanced DiT models during video generation and identify the computation bottleneck. (2) We

propose DSA, a novel training-free attention mechanism which integrates both sparse attention and

distributed inference. (3) We conduct extensive experiments to evaluate DSA, demonstrating its

ability to reduce end-to-end latency by 11× while maintaining the video quality.

PRELIMINARIES

2.1

DIFFUSION

Diffusion models are based on a stochastic denoising process, where data is gradually corrupted by

noise via a forward diffusion process and then reconstructed using a learned reverse process (Rom-

bach et al., 2021; Song et al., 2020; Ho et al., 2020). The forward process is defined as:

q(xt|xt−1) = N(xt; ^√αtxt−1, (1 −αt)I)

where xt represents the noisy data at timestep t, and αt controls the variance schedule. The reverse

process is parameterized by a neural network ϵθ, which predicts the noise added at each timestep.

The reverse transitions are modeled as:

pθ(xt−1|xt) = N(xt−1; µθ(xt, t), Σθ(xt, t))

where µθ and Σθ are learned mean and variance functions. The model iteratively refines a noisy

sample until it converges to the original data distribution.

Diffusion models excel in their ability to handle complex data distributions and produce high-

resolution outputs, making them a preferred choice for generative tasks. However, their iterative

denoising process requires multiple forward passes through the network, resulting in high computa-

tional and memory demands.

Published as a conference paper at ICLR 2026

2.2

DIFFUSION TRANSFORMER

Transformers, originally designed for sequence-to-sequence tasks in natural language process-

ing (Vaswani et al., 2017), become a cornerstone of modern AI architectures. Their self-attention

mechanism enables effective modeling of long-range dependencies, making them well-suited for

diverse tasks, including generative modeling (Liu et al., 2021; Dosovitskiy et al., 2020; Peebles &

Xie, 2022). In recent diffusion models, transformers are often employed as the backbone for the de-

noising network, where they learn to predict the noise or original data distribution at each timestep.

The transformer architecture relies on self-attention (MHSA) layers and feedforward neural net-

works. The self-attention mechanism computes a weighted representation of input tokens by attend-

ing to their pairwise relationships:

Attention(Q, K, V ) = softmax(^QK^T

√dk

where Q, K, and V represent the query, key, and value matrices, and dk is the dimensionality of the

keys. The attention module can capture global context efficiently, which is critical for vision tasks.

2.3

SPARSE ATTENTION

Sparse attention exploits the fact that only a subset of tokens—either within frames or across

time—contribute significantly to the output, allowing many attention computations to be skipped.

Broadly, sparse attention can be categorized into static and dynamic patterns. Static sparse attention

relies on predefined attention masks, typically designed based on observed runtime characteristics

of the model. Because the computation pattern is fixed in advance, it enables the use of high-

performance kernels. In contrast, dynamic sparse attention determines the sparse patterns on the

fly during inference, usually by approximating query–key interactions. While static patterns offer

efficiency through predictable computation, dynamic patterns provide greater adaptivity.

Examples of static sparse attention include MInference (Jiang et al., 2024), STA (Zhang et al.,

2025c), and SVG (Xi et al., 2025). Among them, SVG achieves the best performance, as it pre-

serves the original video generation quality without degradation. In contrast, dynamic sparse atten-

tion is exemplified by SpargeAttention (Zhang et al., 2025a), which pools query and key tokens and

computes cosine similarities to identify critical attention blocks in an online manner, skipping the

unimportant ones. SpargeAttention is versatile and can be applied to large language models, image

generation models, and video generation models. However, its performance lags behind state-of-

the-art static methods such as SVG, particularly in maintaining video quality.

2.4

SEQUENCE PARALLELISM

Traditional parallelism strategies, including data, tensor and pipeline parallelism (Li et al., 2020;

Zheng et al., 2022; Rasley et al., 2020; Narayanan et al., 2021), do not scale well when the sequence

length becomes extremely large. Sequence parallelism (SP) partitions the input along the sequence

dimension across devices to distribute both memmory and compute burden for attention over long

sequences. There are mainly three categories of sequence parallelism:

• SP-Ring (Li et al., 2023; Liu et al., 2024): The sequence data is partitioned into chunks and

distributed across devices in a ring layout. During the attention operation, the key and value

embeddings are circulated among devices in a ring fashion via peer-to-peer (P2P) communication,

which is often overlapped with computation to improve efficiency.

• SP-Ulysses (Jacobs et al., 2023): The input is also partitioned along the sequence dimension.

Through an all-to-all communication step, these chunks are redistributed so that each GPU holds

the full sequence for a subset of attention heads. Local attention is computed independently for

each head, after which the outputs are redistributed to restore the original sequence partitioning.

• SP-Unified (Fang & Zhao, 2024; Gu et al., 2024):This is a hybrid sequence parallelism, combin-

ing the strengths of Ulysses and Ring while mitigating their respective limitations. Devices are

organized into a two-dimensional grid (mesh): Ulysses is applied along one dimension (rows),

while Ring is applied along the other (columns). Redistribution via all-to-all and send-receive

communication ensures proper transfer of data between sequence partitions and head slices.

Published as a conference paper at ICLR 2026

CHALLENGES AND MOTIVATION

Deploying a transformer model for video generation has the following challenges.

1. Attention is the computational bottleneck. A high-resolution video is typically flattened into

a long sequence of vision tokens. Taking Wan-2.1-14B as an example, a 5-second 720p video

corresponds to approximately 302k tokens per input channel, with a total of 16 channels. As the

attention module scales quadratically with the sequence length, it accounts for a substantial fraction

of inference time, evidenced by the breakdown of inference execution time for Wan2.1-14B model

with flash attention (Dao, 2024) in Figure 1. This overhead becomes even more pronounced when

scaling to longer durations or higher resolutions.

wan-1.3B

wan-14B

hunyuan-13B

100

Execution Time Percentage / %

Attention

FFN

Others

Figure 1: Execution time breakdown of 720p

5-second video generation of different models

on H100 GPUs

2⁰

2¹

2²

2³

Number of GPUs

2⁸

2⁹

2¹⁰

2¹¹

Generation Time (s)

Ideal Linear Scaling

Ring-SP

Ulysses-SP

Figure 2: Weak scaling of a 720p 5-second

video using Wan2.1-14B on H100 GPUs,

showing sub-linear decrease in generation time

2. Sparse attention is not scalable. Since high-resolution videos lead to long sequences of vision

tokens for inference, it is natural to adopt parallel inference strategies such as sequence parallelism

to reduce per-device computational overhead. However, existing sparse attention methods are not

designed for multi-GPU inference and thus fail to scale efficiently. Sequence parallelism partitions

the token sequence into sub-chunks, with each device responsible for a subset of the query, key,

and value embeddings. A key challenge arises because existing sparse attention methods (Xi et al.,

2025; Zhang et al., 2025a;c) require access to the full-sequence query and key to determine the

sparse attention pattern. Under ring-style sequence parallelism (Li et al., 2023; Liu et al., 2024), this

leads to excessive communication overhead as devices must exchange full embeddings. Ulysses-

style sequence parallelism (Jacobs et al., 2024) alleviates this by gathering embeddings via all-to-

all communication, but still incurs significant overhead since tokens outside the sparse mask are

redundantly transferred.

Meanwhile, existing sparse attention methods fail to consider additional complexities when scaling

sparse attention to distributed settings. For instance, attention sinks (Xiao et al., 2024b) can be

observed in video generation models (Xi et al., 2025). When distributing the sequence over GPUs,

only 1 GPU holds attention sink tokens, while these tokens need to be attended by all other GPUs.

3. Sequence parallelism is sub-linearly scalable. Sequence parallelism is an effective approach

for handling long-sequence training and inference. However, it introduces additional communication

overhead since query, key, and value embeddings must be exchanged across devices. Consequently,

the scaling efficiency becomes sub-linear, meaning adding more GPUs does not yield a proportional

reduction in latency. As shown in Figure 2, when generating a 5-second 720p video using Wan2.1-

14B on H100 GPUs, the inference time only reduces from 1837.9s to 287.9s when scaling from

1 to 8 GPUs, equivalent to a scaling efficiency of 79.7%. Thus, sequence parallelism only trades

the overall throughput for a single request latency. This limitation raises concerns about the cost-

effectiveness of sequence parallelism in commercial model-as-a-service (MaaS) deployments.

DISTRIBUTED SPARSE ATTENTION

To address the above challenges, we introduce Distributed Sparse Attention (DSA), a methodology

that integrates sparse attention with distributed inference for efficient video generation. In contrast to

computing full-attention with sequence parallelism, DSA selectively matches the sparse pattern and

Published as a conference paper at ICLR 2026

Query

Tokens

Key

Tokens

Attention

Sink

(a) Spatial attention pattern

Query

Tokens

Key

Tokens

Attention

Sink

(b) Temporal attention pattern

Figure 3: Attention patterns which are unique to video generation models (Xi et al., 2025). In the

spatial attention pattern, query tokens primarily attend to key tokens within the same frame or in

adjacent frames, reflecting spatial locality. In contrast, the temporal attention pattern involves query

tokens attending to key tokens at the same spatial location but across different frames. Both patterns

exhibit the attention sink pattern (Xiao et al., 2024b), which all query tokens attend to the first few

key tokens, which are often the text tokens in video generation.

parallel strategy, leading to significant lower computational overhead. During the communication

of query, key and value embeddings, DSA can also filter out the unimportant tokens but only trans-

fer critical tokens to the target device, reducing the overall communication overhead. As a result,

DSA achieves sparse computation and super-linear scalability while preserving the video generation

quality, leading to significant reduction in the generation latency and deployment cost.

4.1

SPARSITY PATTERN MATCHING

Existing methods, such as SVG (Xi et al., 2025), adopt static sparsity patterns for video generation

models to achieve training-free inference acceleration. These static patterns are effective because

video generation models exhibit distinct attention patterns, specifically spatial sparsity and temporal

sparsity. Similar patterns have been observed in Large Language Models (Xiao et al., 2025). SVG

pre-defines spatial and temporal sparse masks and matches attention heads to one of these masks

through sampling, achieving video generation without quality loss.

While we adopt the same static pattern strategy, a challenge arises in distributed inference: video

data is split into sub-sequences, rendering the previous matching strategy—which relies on full

sequences—ineffective. To address this limitation, we employ local pattern matching with majority

voting. We create pre-defined attention masks for local query and key sub-sequences, ensuring mask

locations align with the corresponding query and key positions. Subsequently, we perform all-gather

operations to aggregate local pattern matching decisions and vote on the final sparsity pattern.

4.2

MIXED PARALLELISM

Existing models, including Hunyuan-Video (Kong et al., 2024), Wan (Wan et al., 2025), and Step-

Video (Ma et al., 2025), have adopted unified sequence parallelism (USP) (Fang & Zhao, 2024) as

their default parallelization strategy. USP combines ring-style (Li et al., 2023; Liu et al., 2024) and

Ulysses-style (Jacobs et al., 2023) sequence parallelism approaches. Specifically, it first performs

all-to-all operations to gather sub-sequences, then executes ring-style attention to exchange key-

value embeddings for self-attention computation. This design allows USP to degenerate to ring-style

sequence parallelism when the Ulysses degree is 1, and vice versa.

However, this hybrid design is primarily optimized for cross-node communication. In contrast,

model deployment is typically confined to a single node, since video generation models generally

range from several billion to around 20 billion parameters. Furthermore, USP fails to account for

the attention patterns inherent in video generation models. As demonstrated in prior work, attention

maps in video generation models exhibit sparsity, particularly in the form of temporal and spatial

sparse attention patterns illustrated in Figure 3. Current approaches lack specialized designs that

leverage these distinct attention patterns to reduce the computational and communication overhead.

Published as a conference paper at ICLR 2026

To address this limitation, we propose Mixed Parallelism (MP). As shown in Figure 3, the spatial

and temporal patterns show distintive features: the spatial sparsity occurs as the tokens are attending

to its spatially close tokens in the same frame or in the nearby frames while the temporal sparsity

shows that the tokens are attending other tokens at the same spatial location but across different

frames. Thus, it can be wiser to apply a distinct parallel strategy to each sparsity pattern.

Head1

Head2

Head3

Head4

Sub-sequence 1

Sub-sequence 2

Sub-sequence 3

Sub-sequence 4

Device 4

Key & Value are

circulated

Device 1

Device 4

Device 2

(a) Ring

Head1

Head2

Head3

Head4

Sub-sequence 1

Sub-sequence 2

Sub-sequence 3

Sub-sequence 4

Device 4

Send key & value to

adjacent devices only

Device 1

Device 4

Device 2

(b) Partial-ring

Figure 4: Comparison between the original ring-style attention (a) and partial-ring attention (b). The

typical ring attention will transfer the key and value embeddings from one device to others, resulting

in N −1 times of data transfer. By leveraging the spatial attention pattern, partial-ring only transfers

the embeddings to the adjacent neighbors, keeping the number of data transfer to 2.

Spatial Sequence Parallel. This parallel strategy is applied to spatial sparse patterns. Given N

devices, each video sequence is partitioned into N chunks of sub-sequences. Since query tokens

primarily attend to spatially proximate key tokens in spatial sparsity, we can simplify sparse attention

to local and adjacent computation only. However, this approach introduces two key complexities:

• Attention sink tokens: The first frame contains attention sink tokens that require global attention.

Specifically, tokens in the first frame located on the first device must be attended by all other query

tokens across devices.

• Variable spatial proximity ranges: The range of spatially proximate tokens varies across different

attention heads. In some cases, spatial tokens located on adjacent devices also require attention.

To address these challenges, we broadcast attention sink tokens from the first device to all others

and perform partial-ring communication for adjacent spatial tokens, as illustrated in Figure 4b. We

compute attention outputs in chunks using online softmax (Dao, 2024) and overlap communication

with computation. Since we only attend to spatially adjacent tokens, our approach performs send-

receive operations only twice (one clockwise and one counterclockwise), compared to the N −1

iterations required by typical ring attention. This design significantly reduces communication costs

as the number of GPUs increases. Moreover, by incorporating adjacent spatial tokens rather than

relying solely on local computation, we better preserve video generation quality.

Temporal Sequence Parallel. For temporal sparsity, the challenge is more complex due to re-

peated diagonal attention patterns that require query tokens on one device to attend to key tokens

distributed across all devices. This necessitates the use of sequence parallelism. To achieve higher

computational efficiency on modern accelerators such as GPUs, we perform layout transformations

on temporal sparsity patterns to enable blockwise computation.

While ring-style sequence parallelism processes only subsequences per transmission and cannot

perform global layout transformations, Ulyssesstyle sequence parallelism (Jacobs et al., 2024) is

ideally suited for this scenario. Each device initially stores a subsequence of the input with shape

[B, S/N, H, D], where B is the batch size, S is the full sequence length, H is the number of atten-

tion heads, and D is the head dimension. An all-to-all exchange is first performed so that each device

reconstructs full sequences with shape [B, S, H/N, D]. With the complete sequence available lo-

cally, we can then apply a sparse attention pattern independently to the subset of heads assigned to

each device. After the attention computation, a second all-to-all operation restores the tensor layout

to [B, S/N, H, D]. While the total communication volume remains the same as in conventional

Ulysses sequence parallelism, the use of sparse attention greatly reduces the computational cost.

Published as a conference paper at ICLR 2026

4.3

DYNAMIC ATTENTION SCHEDULING

Naive

Scheduling

Optimized

Scheduling

Spatial Sparse Attention

Ring

Send-Receive

Ring

Send-Receive

Broadcast

Attention

Sink

All2All

Temporal

Sparse

Attention

All2All

Spatial Sparse Attention

Temporal

Sparse

Attention

All2All

Ring

Send-Receive

Broadcast

Attention

Sink

Ring

Send-Receive

Time

Saved

(a) Spatial-Prominent Schedule.

Naive

Scheduling

Optimized

Scheduling

Spatial

Sparse

Attention

Ring

Send-

Receive

Ring

Send-

Receive

All2All

Temporal Sparse Attention

Time

Saved

Spatial

Sparse

Attention

Spatial

Sparse

Attention

All2All

Spatial

Sparse

Attention

Spatial

Sparse

Attention

Temporal Sparse Attention

Spatial

Sparse

Attention

All2All

Ring

Send-

Receive

Ring

Send-

Receive

Broadcast

Attention

Sink

(b) Temporal-Prominent Schedule.

Figure 5: Dynamic attention scheduling. The green boxes represent spatial attention and blue boxes

represent temporal attention.

Diffusion models exhibit dynamic behavior in their attention computation across different layers and

denoising steps when processing various prompts. Consequently, the ratio between spatial sparse

heads and temporal sparse heads fluctuates dynamically throughout the inference process. To en-

hance performance, we propose dynamic attention scheduling, which efficiently coordinates com-

putation and communication operations. Figure 5 shows the mechanism of our proposed solution.

Spatial-dominant Schedule. When spatially sparse heads comprise the majority of attention heads,

we interleave spatial attention computation with temporal attention computation. The key optimiza-

tion is to hide the communication overhead of all-to-all operations through this interleaving strategy.

Temporal-dominant Schedule. When temporally sparse heads are dominant, we adopt a different

approach. First, we compute the local attention for spatial heads while overlapping this computation

with all-to-all communication. During the subsequent Ulysses attention computation, we perform

partial-ring communication to gather spatial tokens, which are then concatenated into a larger tensor.

Finally, we execute spatial attention computation while simultaneously overlapping it with temporal

all-to-all communication.

EVALUATION

5.1

EXPERIMENT SETUP

We evaluated DSA on three state-of-the-art video generation models: Wan2.1-1.3B, Wan2.1-14B, and

Hunyuan-Video. We employed VBench (Huang et al., 2024) as our primary benchmark for assess-

ing video quality. Since the original prompts in VBench are concise and limited in complexity, we

refined them using GPT-4-mini. From VBench’s comprehensive evaluation framework, we selected

four critical dimensions: overall consistency, subject consistency, spatial relationship, and tempo-

ral style, which together provide a holistic assessment of video generation quality. Additionally,

we conducted frame-to-frame comparisons using traditional image quality metrics, including Peak

Published as a conference paper at ICLR 2026

Model

Method

Generated Video Quality

PSNR ↑

SSIM ↑

LPIPS ↓

Overall

Subject

Spatial

Temporal

Consistency ↑

Relationship ↑

Style ↑

Wan2.1-1.3B

Dense

0.168

0.922

0.819

0.156

Sparge

31.39

0.704

0.175

0.166

0.909

0.713

0.152

SVG

34.74

0.832

0.073

0.168

0.921

0.825

0.154

DSA (Ours)

34.67

0.833

0.073

0.166

0.922

0.824

0.152

Wan2.1-14B

Dense

0.170

0.927

0.798

0.163

Sparge

30.79

0.641

0.189

0.161

0.892

0.701

0.155

SVG

33.03

0.781

0.109

0.170

0.925

0.804

0.166

DSA (Ours)

33.19

0.775

0.103

0.171

0.922

0.804

0.165

Hunyuan-video

Dense

0.165

0.940

0.614

0.158

Sparge

32.19

0.762

0.141

0.160

0.930

0.584

0.143

SVG

33.32

0.810

0.120

0.168

0.938

0.637

0.152

DSA (Ours)

33.40

0.804

0.121

0.167

0.940

0.633

0.149

Table 1: Video quality evaluation on VBench

Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), and Learned Percep-

tual Image Patch Similarity (LPIPS) (Zhang et al., 2018). These evaluation metrics comprehensively

cover both image quality and spatial-temporal coherence at the video level.

We compared DSA with both sparse attention and distributed inference approaches. For video quality

evaluation, we selected SparseAttention (Zhang et al., 2025a), and Sparse-Video-Gen (SVG) (Xi

et al., 2025). Ring/Ulysses Sequence parallelism is not used for quality evaluation as it achieves

the same performance as the full attention baseline. For system performance, we compared the

generation latency for both sparse attention and distributed methods including SVG (Xi et al., 2025)

and SP-Unified (Fang & Zhao, 2024; Gu et al., 2024). As USP enables different combinations of

ring and Ulysses attention, we only kept the best results in Table 2.

Dense

DSA

(a) Prompt: A vibrant orange-and-white clownfish

darts through a sunlit coral reef, weaving gracefully

among swaying anemones and colorful corals.

Dense

DSA

(b) Prompt: A fluffy panda joyfully swings back and

forth on a brightly colored playground swing set.

Figure 6: Visualization of the generated outputs from Wan2.1-14B

5.2

VIDEO QUALITY EVALUATION

We evaluated the quality of the videos generated by different methods, and the results are summa-

rized in Table 1. We set the sparsity level to 75% for both SVG and DSA, while using a similarity

threshold of 0.6 and a CDF threshold of 0.98 for Sparse Attention. We do not report results for the

USP method, as it is lossless and produces identical results to dense attention.

According to the quantitative evaluation metrics, DSA consistently achieves performance comparable

to SVG, while outperforming MInference and SparseAttention across both the Wan and Hunyuan

models. This indicates that DSA effectively preserves the fidelity and coherence of generated video

sequences despite its use of a sparse attention mechanism.

Figure 6 presents two randomly selected prompts along with the videos generated by each method.

For both methods, we show frames sampled from the beginning, middle, and end of each video.

Visual inspection indicates that the frames produced by DSA closely resemble those generated using

dense attention, preserving high visual fidelity and temporal coherence. Additional frames for more

diverse prompts are provided in the Appendix A.1, and full video examples are included in the

supplementary materials.

Published as a conference paper at ICLR 2026

Model

Method

System Performance

# of GPUs

Generation time (s)

Speedup

Wan2.1-1.3B

Dense

402.34

SVG

310.14

1.29

USP

59.45

6.76

DSA (Ours)

54.11

7.43

Wan2.1-14B

Dense

1889.25

SVG

1221.34

1.55

USP

251.26

7.52

DSA (Ours)

175

10.79

Hunyuan-video-13B

Dense

1790.34

SVG

1340.40

1.34

USP

284.71

6.29

DSA (Ours)

189.38

9.45

Table 2: Latency and speed of different models when generating a 720p 5-second video.

Model

Strategy

Generation time (s)

Wan2.1-14B

Naive Schedule

188.92

Dynamic Schedule

180.47

Spatial Only

175

Table 3: Generation latency when adopting different strategies for attention.

5.3

SYSTEM PERFORMANCE EVALUATION

We also investigated the system performance of DSA. Unlike large language models, which typi-

cally emphasize metrics such as time to first token (TTFT) and time per output token (TPOT), video

generation models place a higher priority on overall generation latency, as the total runtime spans

the scale of minutes rather than seconds. As shown in Table 2, DSA significantly outperforms the

single-GPU method and can achieve up to 10.79x speedup. This translates to super-linear scaling

on Wan-14B and Hunyuan-13B as the speedup is greater than the proportional increase in the num-

ber of GPUs, demonstrating promising cost-effectiveness in large-scale deployment. Compared to

the distributed unified sequence parallelism, DSA can still achieve 43% improvement on Wan-14B.

However, it is noted that DSA still scales sub-linearly for Wan-1.3B, suggesting that the computation

sharding hurts the hardware utilization and reduces the computation efficiency.

5.4

ABLATION STUDIES

Scheduling Strategies. We evaluated the impact of different scheduling strategies on DSA. Un-

der na¨ıve scheduling, spatial and temporal attention are executed sequentially without overlap. In

contrast, Dynamic Attention Scheduling reorders execution based on the spatial–temporal ratio and

incorporates computation–communication overlap. As shown in Table 3, this dynamic strategy re-

duces latency by 4.7%. We further examined a spatial-only strategy, where all attention heads adopt

the spatial pattern. This configuration decreases generation latency to 175 seconds—an 8% im-

provement over na¨ıve scheduling—while incurring negligible impact on video quality (results are

put in the appendix).

Sparsity Selection In DSA, since computation for spatial and temporal patterns is decoupled, we

can assign different sparsity levels to each, unlike SVG, which enforces a uniform sparsity level

across both. To evaluate this flexibility, we sampled 20 prompts from each VBench evaluation

dimension and used Wan2.1-14B to generate videos under varying sparsity settings. Specifically, we

experimented with sparsity levels of 80%, 90%, and 95% for both spatial and temporal dimensions,

and assessed their impact on video quality. As shown in Table 4, setting spatial sparsity too high

degrades performance: when spatial sparsity is increased from 80% to 95% with temporal sparsity

fixed at 95%, the overall consistency score drops from 0.179 to 0.174. However, very high temporal

sparsity tends to yield comparable performance. For example, a temporal sparsity of 95% produces

results similar to those at lower spatial sparsity levels of 90% or 80%. This reveals that temporal

attention patterns are generally more sparse than the spatial patterns. This is because the number of

frames is generally smaller than the size of tokens in a single frame. Consequently, for a given query

token, the number of key tokens at the same spatial location but across different temporal locations

is much smaller than the number of key tokens located within the same or adjacent frames.

Published as a conference paper at ICLR 2026

Model

Spatial Sparsity

Temporal Sparsity

Overall

Subject

Spatial

Temporal

Consistency ↑

Relationship ↑

Style ↑

Wan2.1-14B

95%

0.174

0.916

0.941

0.135

90%

0.176

0.918

0.957

0.135

80%

0.177

0.918

0.957

0.134

90%

95%

0.178

0.915

0.952

0.138

90%

0.178

0.919

0.948

0.135

80%

0.178

0.920

0.950

0.134

80%

95%

0.179

0.917

0.944

0.138

90%

0.179

0.919

0.948

0.136

80%

0.177

0.921

0.956

0.135

Table 4: Sensitivity to sparsity levels for spatial and temporal attention respectively.

RELATED WORK

Diffusion models have been accelerated through several largely orthogonal approaches. One line

of work focuses on sparse attention. Although methods such as BigBird (Zaheer et al., 2020),

StreamingLLM (Xiao et al., 2024b), DuoAttention (Xiao et al., 2024a), and Native Sparse Atten-

tion (Yuan et al., 2025) demonstrate strong performance in large language models, they rely on

language-specific attention patterns and do not transfer effectively to diffusion models. More re-

cently, SpargeAttention (Zhang et al., 2025a) dynamically detects sparsity and implements an effi-

cient kernel for acceleration. SVG (Xi et al., 2025) and STA (Zhang et al., 2025c) extend sparse

attention to diffusion models by applying static sparsity patterns, among which SVG achieves the

best generation quality.

Another line of work focuses on system-level optimization, including DistriFusion (Li et al., 2024)

and PipeFusion (Fang et al., 2025). DistriFusion leverages stale latents and patch parallelism to

partition images across devices for parallel computation, while PipeFusion extends this approach

with pipeline parallelism to further reduce latency and improve hardware utilization. However, these

methods primarily target image generation. USP (Fang & Zhao, 2024) instead proposes a lossless

distributed inference framework that combines Ring Attention (Li et al., 2023; Liu et al., 2024) and

Ulysses (Jacobs et al., 2023) to improve scalability.

A third line of work explores caching mechanisms that reuse intermediate activations based on the

similarity of latent representations across denoising steps. PAB (Zhao et al., 2025) and DiTFas-

tAttn (Yuan et al., 2024) use static reuse, while AdaCache (Kahatapitiya et al., 2024) adapts caching

based on feature variance and TaylorSeer (Liu et al., 2025) predicts feature evolution via Taylor

expansion. These methods are complementary to sparse attention and distributed inference.

In contrast to prior work, our method jointly considers both the sparsity characteristics of atten-

tion patterns and distributed inference strategies. By aligning sparsity-aware computation with dis-

tributed execution, our approach improves both computational efficiency and communication effi-

ciency. Furthermore, our method is orthogonal to caching-based techniques and can be seamlessly

combined with them for additional acceleration.

CONCLUSION

In conclusion, we introduce DSA, a novel attention mechanism that integrates sparse attention with

distributed inference for diffusion-based video generation. By selecting suitable parallel strategy for

distinct sparse patterns, DSA substantially reduces computation and communication overhead. Ex-

periments demonstrate that DSA achieves significant efficiency gains: up to 10.79× faster inference

compared to the single-GPU dense attention inference while preserving the video quality.

This work explores parallelization strategies for spatial and temporal attention patterns, without

yet addressing sparse patterns that may emerge in future models.

Although dynamic attention

scheduling overlaps computation and communication, its multiple kernel launches can degrade

performance.

As future work, we plan to incorporate adaptive sparse patterns and fuse com-

pute–communication into efficient CUDA kernels using libraries such as TileLink (Zheng et al.,

2025b) and Triton-Distributed (Zheng et al., 2025a).

Published as a conference paper at ICLR 2026

REFERENCES

Andreas Blattmann, Tim Dockhorn, Sumith Kulal, Daniel Mendelevitch, Maciej Kilian, Dominik

Lorenz, Yam Levi, Zion English, Vikram Voleti, Adam Letts, Varun Jampani, and Robin Rom-

bach. Stable video diffusion: Scaling latent video diffusion models to large datasets, 2023. URL

https://arxiv.org/abs/2311.15127.

Tri Dao. FlashAttention-2: Faster attention with better parallelism and work partitioning. In Inter-

national Conference on Learning Representations (ICLR), 2024.

Ming Ding, Zhuoyi Yang, Wenyi Hong, Wendi Zheng, Chang Zhou, Da Yin, Junyang Lin, Xu Zou,

Zhou Shao, Hongxia Yang, and Jie Tang. Cogview: mastering text-to-image generation via trans-

formers. In Proceedings of the 35th International Conference on Neural Information Processing

Systems, NIPS ’21, Red Hook, NY, USA, 2021. Curran Associates Inc. ISBN 9781713845393.

Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn, Xiaohua Zhai, Thomas

Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, Jakob Uszko-

reit, and Neil Houlsby. An image is worth 16x16 words: Transformers for image recognition

at scale. ArXiv, abs/2010.11929, 2020. URL https://api.semanticscholar.org/

CorpusID:225039882.

Jiarui Fang and Shangchun Zhao. A unified sequence parallelism approach for long context gener-

ative ai. arXiv preprint arXiv:2405.07719, 2024.

Jiarui Fang, Jinzhe Pan, Xibo Sun, Aoyu Li, and Jiannan Wang. xdit: an inference engine for

diffusion transformers (dits) with massive parallelism. arXiv preprint arXiv:2411.01738, 2024.

Jiarui Fang, Jinzhe Pan, Aoyu Li, Xibo Sun, and WANG Jiannan. Pipefusion: Patch-level pipeline

parallelism for diffusion transformers inference. In The Thirty-ninth Annual Conference on Neu-

ral Information Processing Systems, 2025. URL https://openreview.net/forum?id=

5xwyxupsLL.

Diandian Gu, Peng Sun, Qinghao Hu, Ting Huang, Xun Chen, Yingtong Xiong, Guoteng Wang,

Qiaoling Chen, Shangchun Zhao, Jiarui Fang, Yonggang Wen, Tianwei Zhang, Xin Jin, and Xu-

anzhe Liu. Loongtrain: Efficient training of long-sequence llms with head-context parallelism,

2024. URL https://arxiv.org/abs/2406.18485.

Jonathan Ho, Ajay Jain, and P. Abbeel.

Denoising diffusion probabilistic models.

ArXiv,

abs/2006.11239,

2020.

URL https://api.semanticscholar.org/CorpusID:

219955663.

Wenyi Hong, Ming Ding, Wendi Zheng, Xinghan Liu, and Jie Tang. Cogvideo: Large-scale pre-

training for text-to-video generation via transformers.

In The Eleventh International Confer-

ence on Learning Representations, 2023. URL https://openreview.net/forum?id=

rB6TpjAuSRy.

Ziqi Huang, Yinan He, Jiashuo Yu, Fan Zhang, Chenyang Si, Yuming Jiang, Yuanhan Zhang, Tianx-

ing Wu, Qingyang Jin, Nattapol Chanpaisit, Yaohui Wang, Xinyuan Chen, Limin Wang, Dahua

Lin, Yu Qiao, and Ziwei Liu. VBench: Comprehensive benchmark suite for video generative

models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recogni-

tion, 2024.

Sam Ad´e Jacobs, Masahiro Tanaka, Chengming Zhang, Minjia Zhang, Leon Song, Samyam Ra-

jbhandari, and Yuxiong He.

Deepspeed ulysses: System optimizations for enabling training

of extreme long sequence transformer models. ArXiv, abs/2309.14509, 2023. URL https:

//api.semanticscholar.org/CorpusID:262826014.

Sam Ade Jacobs, Masahiro Tanaka, Chengming Zhang, Minjia Zhang, Reza Yazdani Aminad-

abi, Shuaiwen Leon Song, Samyam Rajbhandari, and Yuxiong He.

System optimizations

for enabling training of extreme long sequence transformer models.

In Proceedings of the

43rd ACM Symposium on Principles of Distributed Computing, PODC ’24, pp. 121–130, New

York, NY, USA, 2024. Association for Computing Machinery.

ISBN 9798400706684.

doi:

10.1145/3662158.3662806. URL https://doi.org/10.1145/3662158.3662806.

Published as a conference paper at ICLR 2026

Huiqiang Jiang, Yucheng Li, Chengruidong Zhang, Qianhui Wu, Xufang Luo, Surin Ahn, Zhenhua

Han, Amir H. Abdi, Dongsheng Li, Chin-Yew Lin, Yuqing Yang, and Lili Qiu.

MInference

1.0: Accelerating pre-filling for long-context LLMs via dynamic sparse attention. In The Thirty-

eighth Annual Conference on Neural Information Processing Systems, 2024. URL https://

openreview.net/forum?id=fPBACAbqSN.

Kumara Kahatapitiya, Haozhe Liu, Sen He, Ding Liu, Menglin Jia, Michael S. Ryoo, and Tian Xie.

Adaptive caching for faster video generation with diffusion transformers. ArXiv, abs/2411.02397,

2024. URL https://api.semanticscholar.org/CorpusID:273821120.

Weijie Kong, Qi Tian, Zijian Zhang, Rox Min, Zuozhuo Dai, Jin Zhou, Jiangfeng Xiong, Xin Li,

Bo Wu, Jianwei Zhang, et al. Hunyuanvideo: A systematic framework for large video generative

models. arXiv preprint arXiv:2412.03603, 2024.

Muyang Li, Tianle Cai, Jiaxin Cao, Qinsheng Zhang, Han Cai, Junjie Bai, Yangqing Jia, Ming-

Yu Liu, Kai Li, and Song Han. Distrifusion: Distributed parallel inference for high-resolution

diffusion models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern

Recognition (CVPR), 2024.

Shen Li, Yanli Zhao, Rohan Varma, Omkar Salpekar, Pieter Noordhuis, Teng Li, Adam Paszke,

Jeff Smith, Brian Vaughan, Pritam Damania, and Soumith Chintala. Pytorch distributed: Experi-

ences on accelerating data parallel training, 2020. URL https://arxiv.org/abs/2006.

15704.

Shenggui Li, Fuzhao Xue, Chaitanya Baranwal, Yongbin Li, and Yang You.

Sequence paral-

lelism: Long sequence training from system perspective. In Anna Rogers, Jordan Boyd-Graber,

and Naoaki Okazaki (eds.), Proceedings of the 61st Annual Meeting of the Association for

Computational Linguistics (Volume 1: Long Papers), pp. 2391–2404, Toronto, Canada, July

2023. Association for Computational Linguistics. doi: 10.18653/v1/2023.acl-long.134. URL

https://aclanthology.org/2023.acl-long.134/.

Bin Lin, Yunyang Ge, Xinhua Cheng, Zongjian Li, Bin Zhu, Shaodong Wang, Xianyi He, Yang Ye,

Shenghai Yuan, Liuhan Chen, et al. Open-sora plan: Open-source large video generation model.

arXiv preprint arXiv:2412.00131, 2024.

Hao Liu, Matei Zaharia, and Pieter Abbeel. Ringattention with blockwise transformers for near-

infinite context. In The Twelfth International Conference on Learning Representations, 2024.

URL https://openreview.net/forum?id=WsRHpHH4s0.

Jiacheng Liu, Chang Zou, Yuanhuiyi Lyu, Junjie Chen, and Linfeng Zhang. From reusing to fore-

casting: Accelerating diffusion models with taylorseers. arXiv preprint arXiv:2503.06923, 2025.

Ze Liu, Yutong Lin, Yue Cao, Han Hu, Yixuan Wei, Zheng Zhang, Stephen Lin, and Bain-

ing Guo.

Swin transformer: Hierarchical vision transformer using shifted windows.

2021

IEEE/CVF International Conference on Computer Vision (ICCV), pp. 9992–10002, 2021. URL

https://api.semanticscholar.org/CorpusID:232352874.

Guoqing Ma, Haoyang Huang, Kun Yan, Liangyu Chen, Nan Duan, Shengming Yin, Changyi Wan,

Ranchen Ming, Xiaoniu Song, Xing Chen, Yu Zhou, Deshan Sun, Deyu Zhou, Jian Zhou, Kai-

jun Tan, Kang An, Mei Chen, Wei Ji, Qiling Wu, Wen Sun, Xin Han, Yanan Wei, Zheng Ge,

Aojie Li, Bin Wang, Bizhu Huang, Bo Wang, Brian Li, Changxing Miao, Chen Xu, Chenfei

Wu, Chenguang Yu, Dapeng Shi, Dingyuan Hu, Enle Liu, Gang Yu, Ge Yang, Guanzhe Huang,

Gulin Yan, Haiyang Feng, Hao Nie, Haonan Jia, Hanpeng Hu, Hanqi Chen, Haolong Yan, Heng

Wang, Hongcheng Guo, Huilin Xiong, Huixin Xiong, Jiahao Gong, Jianchang Wu, Jiaoren Wu,

Jie Wu, Jie Yang, Jiashuai Liu, Jiashuo Li, Jingyang Zhang, Junjing Guo, Junzhe Lin, Kaixiang

Li, Lei Liu, Lei Xia, Liang Zhao, Liguo Tan, Liwen Huang, Liying Shi, Ming Li, Mingliang

Li, Muhua Cheng, Na Wang, Qiaohui Chen, Qinglin He, Qiuyan Liang, Quan Sun, Ran Sun,

Rui Wang, Shaoliang Pang, Shiliang Yang, Sitong Liu, Siqi Liu, Shuli Gao, Tiancheng Cao,

Tianyu Wang, Weipeng Ming, Wenqing He, Xu Zhao, Xuelin Zhang, Xianfang Zeng, Xiaojia

Liu, Xuan Yang, Yaqi Dai, Yanbo Yu, Yang Li, Yineng Deng, Yingming Wang, Yilei Wang,

Yuanwei Lu, Yu Chen, Yu Luo, Yuchu Luo, Yuhe Yin, Yuheng Feng, Yuxiang Yang, Zecheng

Published as a conference paper at ICLR 2026

Tang, Zekai Zhang, Zidong Yang, Binxing Jiao, Jiansheng Chen, Jing Li, Shuchang Zhou, Xi-

angyu Zhang, Xinhao Zhang, Yibo Zhu, Heung-Yeung Shum, and Daxin Jiang. Step-video-t2v

technical report: The practice, challenges, and future of video foundation model, 2025. URL

https://arxiv.org/abs/2502.10248.

Deepak Narayanan, Mohammad Shoeybi, Jared Casper, Patrick LeGresley, Mostofa Patwary, Vi-

jay Korthikanti, Dmitri Vainbrand, Prethvi Kashinkunti, Julie Bernauer, Bryan Catanzaro, Amar

Phanishayee, and Matei Zaharia.

Efficient large-scale language model training on gpu clus-

ters using megatron-lm. In Proceedings of the International Conference for High Performance

Computing, Networking, Storage and Analysis, SC ’21, New York, NY, USA, 2021. Associa-

tion for Computing Machinery. ISBN 9781450384421. doi: 10.1145/3458817.3476209. URL

https://doi.org/10.1145/3458817.3476209.

William S. Peebles and Saining Xie. Scalable diffusion models with transformers. 2023 IEEE/CVF

International Conference on Computer Vision (ICCV), pp. 4172–4182, 2022.

URL https:

//api.semanticscholar.org/CorpusID:254854389.

Jeff Rasley, Samyam Rajbhandari, Olatunji Ruwase, and Yuxiong He. Deepspeed: System opti-

mizations enable training deep learning models with over 100 billion parameters. In Proceedings

of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining,

KDD ’20, pp. 3505–3506, New York, NY, USA, 2020. Association for Computing Machin-

ery. ISBN 9781450379984. doi: 10.1145/3394486.3406703. URL https://doi.org/10.

1145/3394486.3406703.

Robin Rombach, A. Blattmann, Dominik Lorenz, Patrick Esser, and Bj¨orn Ommer.

High-

resolution image synthesis with latent diffusion models. 2022 IEEE/CVF Conference on Com-

puter Vision and Pattern Recognition (CVPR), pp. 10674–10685, 2021. URL https://api.

semanticscholar.org/CorpusID:245335280.

Jiaming Song, Chenlin Meng, and Stefano Ermon. Denoising diffusion implicit models. ArXiv,

abs/2010.02502,

2020.

URL https://api.semanticscholar.org/CorpusID:

222140788.

Genmo Team. Mochi 1. https://github.com/genmoai/models, 2024.

Ashish Vaswani, Noam M. Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez,

Lukasz Kaiser, and Illia Polosukhin. Attention is all you need. In Neural Information Processing

Systems, 2017. URL https://api.semanticscholar.org/CorpusID:13756489.

Team Wan, Ang Wang, Baole Ai, Bin Wen, Chaojie Mao, Chen-Wei Xie, Di Chen, Feiwu Yu,

Haiming Zhao, Jianxiao Yang, Jianyuan Zeng, Jiayu Wang, Jingfeng Zhang, Jingren Zhou, Jinkai

Wang, Jixuan Chen, Kai Zhu, Kang Zhao, Keyu Yan, Lianghua Huang, Mengyang Feng, Ningyi

Zhang, Pandeng Li, Pingyu Wu, Ruihang Chu, Ruili Feng, Shiwei Zhang, Siyang Sun, Tao Fang,

Tianxing Wang, Tianyi Gui, Tingyu Weng, Tong Shen, Wei Lin, Wei Wang, Wei Wang, Wenmeng

Zhou, Wente Wang, Wenting Shen, Wenyuan Yu, Xianzhong Shi, Xiaoming Huang, Xin Xu, Yan

Kou, Yangyu Lv, Yifei Li, Yijing Liu, Yiming Wang, Yingya Zhang, Yitong Huang, Yong Li, You

Wu, Yu Liu, Yulin Pan, Yun Zheng, Yuntao Hong, Yupeng Shi, Yutong Feng, Zeyinzi Jiang, Zhen

Han, Zhi-Fan Wu, and Ziyu Liu. Wan: Open and advanced large-scale video generative models.

arXiv preprint arXiv:2503.20314, 2025.

Haocheng Xi, Shuo Yang, Yilong Zhao, Chenfeng Xu, Muyang Li, Xiuyu Li, Yujun Lin, Han Cai,

Jintao Zhang, Dacheng Li, Jianfei Chen, Ion Stoica, Kurt Keutzer, and Song Han. Sparse video-

gen: Accelerating video diffusion transformers with spatial-temporal sparsity. In Forty-second

International Conference on Machine Learning, 2025. URL https://openreview.net/

forum?id=u8CA3qIS0V.

Guangxuan Xiao, Jiaming Tang, Jingwei Zuo, Junxian Guo, Shang Yang, Haotian Tang, Yao Fu,

and Song Han. Duoattention: Efficient long-context llm inference with retrieval and streaming

heads. arXiv, 2024a.

Guangxuan Xiao, Yuandong Tian, Beidi Chen, Song Han, and Mike Lewis. Efficient streaming

language models with attention sinks. In The Twelfth International Conference on Learning Rep-

resentations, 2024b. URL https://openreview.net/forum?id=NG7sS51zVF.

Published as a conference paper at ICLR 2026

Guangxuan Xiao, Jiaming Tang, Jingwei Zuo, junxian guo, Shang Yang, Haotian Tang, Yao Fu,

and Song Han. Duoattention: Efficient long-context LLM inference with retrieval and streaming

heads. In The Thirteenth International Conference on Learning Representations, 2025. URL

https://openreview.net/forum?id=cFu7ze7xUm.

Jingyang Yuan, Huazuo Gao, Damai Dai, Junyu Luo, Liang Zhao, Zhengyan Zhang, Zhenda Xie,

Yuxing Wei, Lean Wang, Zhiping Xiao, Yuqing Wang, Chong Ruan, Ming Zhang, Wenfeng

Liang, and Wangding Zeng. Native sparse attention: Hardware-aligned and natively trainable

sparse attention. In Wanxiang Che, Joyce Nabende, Ekaterina Shutova, and Mohammad Taher

Pilehvar (eds.), Proceedings of the 63rd Annual Meeting of the Association for Computational

Linguistics (Volume 1: Long Papers), pp. 23078–23097, Vienna, Austria, July 2025. Association

for Computational Linguistics. ISBN 979-8-89176-251-0. doi: 10.18653/v1/2025.acl-long.1126.

URL https://aclanthology.org/2025.acl-long.1126/.

Zhihang Yuan, Hanling Zhang, Lu Pu, Xuefei Ning, Linfeng Zhang, Tianchen Zhao, Shengen Yan,

Guohao Dai, and Yu Wang. DiTFastattn: Attention compression for diffusion transformer models.

In The Thirty-eighth Annual Conference on Neural Information Processing Systems, 2024. URL

https://openreview.net/forum?id=51HQpkQy3t.

Manzil Zaheer, Guru Guruganesh, Avinava Dubey, Joshua Ainslie, Chris Alberti, Santiago Ontanon,

Philip Pham, Anirudh Ravula, Qifan Wang, Li Yang, and Amr Ahmed. Big bird: transformers

for longer sequences. In Proceedings of the 34th International Conference on Neural Informa-

tion Processing Systems, NIPS ’20, Red Hook, NY, USA, 2020. Curran Associates Inc. ISBN

9781713829546.

Tao Zewei and Huang Yunpeng. Magiattention: A distributed attention towards linear scalability for

ultra-long context, heterogeneous mask training. https://github.com/SandAI-org/

MagiAttention/, 2025.

Jintao Zhang, Chendong Xiang, Haofeng Huang, Jia Wei, Haocheng Xi, Jun Zhu, and Jianfei Chen.

Spargeattn: Accurate sparse attention accelerating any model inference. In International Confer-

ence on Machine Learning (ICML), 2025a.

Peiyuan Zhang, Yongqi Chen, Haofeng Huang, Will Lin, Zhengzhong Liu, Ion Stoica, Eric Xing,

and Hao Zhang. Vsa: Faster video diffusion with trainable sparse attention, 2025b. URL https:

//arxiv.org/abs/2505.13389.

Peiyuan Zhang, Yongqi Chen, Runlong Su, Hangliang Ding, Ion Stoica, Zhengzhong Liu, and

Hao Zhang.

Fast video generation with sliding tile attention.

In Forty-second International

Conference on Machine Learning, 2025c. URL https://openreview.net/forum?id=

U74MOXPEJd.

Richard Zhang, Phillip Isola, Alexei A Efros, Eli Shechtman, and Oliver Wang. The unreasonable

effectiveness of deep features as a perceptual metric. In CVPR, 2018.

Xuanlei Zhao, Xiaolong Jin, Kai Wang, and Yang You. Real-time video generation with pyramid

attention broadcast. In The Thirteenth International Conference on Learning Representations,

2025. URL https://openreview.net/forum?id=hDBrQ4DApF.

Lianmin Zheng, Zhuohan Li, Hao Zhang, Yonghao Zhuang, Zhifeng Chen, Yanping Huang, Yida

Wang, Yuanzhong Xu, Danyang Zhuo, Eric P. Xing, Joseph E. Gonzalez, and Ion Stoica.

Alpa: Automating inter- and Intra-Operator parallelism for distributed deep learning. In 16th

USENIX Symposium on Operating Systems Design and Implementation (OSDI 22), pp. 559–

578, Carlsbad, CA, July 2022. USENIX Association. ISBN 978-1-939133-28-1. URL https:

//www.usenix.org/conference/osdi22/presentation/zheng-lianmin.

Size Zheng, Wenlei Bao, Qi Hou, Xuegui Zheng, Jin Fang, Chenhui Huang, Tianqi Li, Haojie

Duanmu, Renze Chen, Ruifan Xu, Yifan Guo, Ningxin Zheng, Ziheng Jiang, Xinyi Di, Dongyang

Wang, Jianxi Ye, Haibin Lin, Li-Wen Chang, Liqiang Lu, Yun Liang, Jidong Zhai, and Xin Liu.

Triton-distributed: Programming overlapping kernels on distributed ai systems with the triton

compiler, 2025a. URL https://arxiv.org/abs/2504.19442.