paper-with-me

홈 › Papers

DualKV: Shared-Prompt Flash Attention for Efficient RL Training with Large Rollouts and Long Contexts

2026-05-14 · Jiading Gai, Shuai Zhang, Xiang Song, Bernie Wang, George Karypis arxiv

Modern RL post-training methods such as GRPO and DAPO train on N response sequences of R tokens sampled from a shared prompt of P tokens, but standard FlashAttention replicates all P prompt tokens N times across both forward and backward passes -- duplicating compute and memory on identical hidden states. In large-rollout, long-context RL training (N>=16, P>=8K), this redundancy dominates the policy update cost. We observe that in decoder-only models, causal masking makes prompt representations invariant across sequences at every layer, so all per-token operations (norms, projections, MLP) and attention can process the prompt once -- a property not yet exploited at the kernel level for training. We propose DualKV, the first FlashAttention kernel variant that eliminates shared-prompt replication during RL training, via (1) fused CUDA forward and backward kernels that iterate over two disjoint KV regions -- shared context and per-sequence response -- in a single kernel launch, and (2) a data-pipeline redesign in veRL that repacks N(P+R) tokens into P+NR tokens per micro-batch, extending the token reduction from attention to the entire model by a factor rho = N(P+R)/(P+NR). DualKV is mathematically equivalent to standard attention and introduces no approximation. On Qwen3-8B GRPO training with 8xH100 GPUs (N=32, 8K-context), DualKV achieves 1.63--2.09x policy-update speedup, enables 2x larger micro-batches, and raises MFU from 36% to 76%. Similar gains hold for DAPO (2.47x speedup, 77% MFU). At 30B MoE scale on 16xH100, DualKV achieves 3.82x policy-update and 3.38x end-to-end step speedup over FlashAttention (which requires 4-way Ulysses sequence parallelism to avoid OOM). DualKV also extends to hybrid sliding/global attention with head dimension 512 (which FA2 does not support) and integrates with Ulysses sequence parallelism, demonstrated on Gemma-4-31B GRPO at 64K context.

📄 PDF Abstract BibTeX arXiv:2605.15422

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

FlashForge: Ultra-Efficient Prefix-Aware Attention for LLM Decoding

2025-05-23 · Zhibin Wang, Rui Ning, Chao Fang, Zhonghui Zhang 외

Prefix-sharing among multiple prompts presents opportunities to combine the operations of the shared prefix, while attention computation in the decode stage, which becomes a critical bottleneck with increasing context le…

DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference

2024-03-30 · Jinwei Yao, Kaiqi Chen, Kexun Zhang, Jiaxuan You 외

Large language models (LLMs) are increasingly employed for complex tasks that process multiple generation calls in a tree structure with shared prefixes of tokens, including few-shot prompting, multi-step reasoning, spec…

GPU

FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning

2023-07-17 · Tri Dao

Scaling Transformers to longer sequence lengths has been a major problem in the last several years, promising to improve performance in language modeling and high-resolution image understanding, as well as to unlock new …

GPULanguage ModelingLanguage Modelling

TyphoonMLA: A Mixed Naive-Absorb MLA Kernel For Shared Prefix

2025-09-25 · Ahmet Caner Yüzügüler, Ahmet Çelik, Jiawei Zhuang, Lukas Cavigelli arxiv

Multi-Head Latent Attention (MLA) is a recent attention mechanism adopted in state-of-the-art LLMs such as DeepSeek-v3 and Kimi K2. Thanks to its novel formulation, MLA allows two functionally equivalent but computationa…

Computational Efficiency

FastAttention: Extend FlashAttention2 to NPUs and Low-resource GPUs

2024-10-22 · Haoran Lin, Xianzhi Yu, Kang Zhao, Lu Hou 외

FlashAttention series has been widely applied in the inference of large language models (LLMs). However, FlashAttention series only supports the high-level GPU architectures, e.g., Ampere and Hopper. At present, FlashAtt…

CPUGPU