VC-Attention: Value Smoothing and Softmax Casting for Low-bit Attention
Xingyang Li, Dongyun Zou, Shining Zhang, Jiacheng Chen, Haocheng Xi, Lvmin Zhang, Jun-Yan Zhu, Song Han and 3 others
Nunchux AI · MIT · CMU · UC Berkeley · Stanford · NVIDIA
Published September 14, 2026 · on the feed September 17, 2026 · ▲ 50 · arXiv 2609.15810
The abstract
Diffusion Transformers deliver state-of-the-art video generation, but their long spatiotemporal sequences make attention the dominant deployment cost, and a deployable low-bit kernel must be accurate and fast. Accuracy is limited by outliers: a block's quantization scale is set by its largest entries, leaving typical entries confined to a narrow range of representable values. Prior work smooths queries and keys, but value outliers follow no fixed channel or spatiotemporal structure and remain the dominant source of output error. Speed is limited by softmax: low-bit Tensor Cores accelerate only the two matrix multiplications, so the high-precision exponential between them becomes the longest pipeline stage on datacenter GPUs. We propose VC-Attention, a training-free low-bit attention framework that addresses both by pairing Value smoothing with a fused probability Cast. V-Smooth reorders value tokens by lightweight online clustering, so the tokens in a hardware block quantize well together. It quantizes only the residual after subtracting the block mean, and restores that mean from the row sum the online softmax already maintains. ExpCast-FP8 maps log-domain scores directly to E4M3 probability codes with one fused multiply-add, eliminating the FP32 exponential and the format conversion. We implement VC-Attention for B200, B300, H200, RTX PRO 6000, and RTX 5090. Across Wan2.2, LongCat-Video, HunyuanVideo-1.5, and MiniMax-H3, VC-Attention improves fidelity over low-bit baselines, speeds up the attention kernel over BF16 FlashAttention-4 by 1.46-1.59x on datacenter Blackwell and Hopper and by 2.3-3.6x on workstation cards, and generates a clip 1.13-1.19x and 1.36-1.70x faster end to end.
The Brief
3:09A short podcast summary of the paper. Written and voiced by AI.
Transcript
VC-Attention. Value Smoothing and Softmax Casting for Low-bit Attention. By Xingyang Li and ten others, from Nunchux AI, MIT, and four other institutions. Published on the fourteenth of September. No code repository is linked to it.
Diffusion Transformers give state-of-the-art video generation, but their long spatiotemporal sequences make attention the dominant cost of deploying them. A low-bit attention kernel that can actually be deployed has to be both accurate and fast, and each goal has its own obstacle.
Accuracy is limited by outliers. A block's quantization scale is set by its largest entries, which leaves the typical entries squeezed into a narrow range of representable values. Earlier work smooths the queries and keys, but outliers in the values follow no fixed pattern across channels or across space and time, and they remain the main source of output error. Speed is limited by softmax. Low-bit Tensor Cores speed up only the two matrix multiplications, so the high-precision exponential between them becomes the longest stage of the pipeline on datacenter GPUs.
VC-Attention is a low-bit attention framework, needing no training, that tackles both obstacles at once. The V stands for value smoothing, aimed at the accuracy problem. The C stands for a fused probability cast, aimed at the speed problem. Both halves work inside the attention kernel itself, which is why nothing about the model has to be retrained.
V-Smooth reorders the value tokens using lightweight online clustering, so that the tokens sharing a hardware block quantize well together. It then quantizes only the residual left after subtracting the block's mean, and restores that mean afterwards from the row sum that online softmax already keeps. The correction costs almost nothing extra, because the quantity it needs is already being computed.
ExpCast-FP8 maps scores in the log domain directly to E4M3 probability codes with a single fused multiply-add. That removes both the FP32 exponential and the format conversion that would otherwise follow it. The expensive step is not made faster; it is replaced, and the probabilities come out already in the low-bit form the next multiplication wants.
VC-Attention is implemented for B200, B300, H200, RTX PRO 6000, and RTX 5090. It was tested on Wan2.2, LongCat-Video, HunyuanVideo-1.5, and MiniMax-H3, and it improves fidelity over other low-bit baselines.
Against BF16 FlashAttention-4, the attention kernel runs one point four six to one point five nine times faster on datacenter Blackwell and Hopper, and two point three to three point six times faster on workstation cards. End to end, a whole clip is generated one point one three to one point one nine times faster in one setting, and one point three six to one point seven times faster in the other.
Each half of the name answers one half of the problem. Clustering and mean subtraction make the values easy to quantize, reusing a sum softmax already keeps. A single fused instruction removes the exponential that had become the slowest stage. Neither half requires retraining the video model it accelerates.
Paper Quest · 7 chapters · about 40 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
Every quest starts with a wall. Here there are two: an accuracy wall and a speed wall.
You serve a video diffusion transformer. Its long sequences of space-time tokens make attention the main cost, so you want a low-bit attention kernel that is both accurate and fast.
The road ahead
- 1 · The problem ~7 min Low-bit attention for video models must be both accurate and fast, but value outliers hurt accuracy and the softmax exponential limits speed.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Put similar value tokens in the same block, quantize only what differs from the block mean, and write softmax probabilities straight as FP8 codes.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Cluster and reorder values, demean and quantize each block, write probabilities as E4M3 codes, then add the mean back via the row sum.
- 6 · The experiment ~6 min You’ll guess: On workstation cards, at best, how much faster did VC-Attention run the attention kernel than BF16 FlashAttention-4?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.