QuantWM: Temporally Consistent 2-Bit KV Cache Quantization for Video World Models
Summary
QuantWM 提出一种免训练的 2-bit KV cache 量化框架,通过量化敏感性感知聚类(QSAC)与主子空间注意力补偿(PSAC)来稳定视频世界模型的注意力 logits,缓解时间闪烁与视觉退化,并在多个基准上实现最高 6.20 倍 KV cache 内存压缩。
View Cached Full Text
Cached at: 10/05/26, 04:49 PM
Paper page - QuantWM: Temporally Consistent 2-Bit KV Cache Quantization for Video World Models
Source: https://huggingface.co/papers/2609.26425
Abstract
Videoworldmodelsachievelong-rangetemporalconsistencybystoringKVcacheduringgeneration,butthegrowingcachemakesKVcachememoryamajordeploymentbottleneck,whichmotivateslow-bitquantizationstudyforefficiency.Existing2-bitKVcachequantizationmethodscanachievenearlylosslessperformanceonVBench,however,whenappliedtovideoworldmodels,wefindtheystillcauseseveretemporalflickeringandvisualdegradation.Meanwhile,deeperinvestigatesshowthatKeyquantizationproducessmallerreconstructionerrorsthanValue,butsurprisinglyleadstolargeroutputdegradation.Wetracethisdiscrepancytoattentioninvideoworldmodels:Keyperturbationscanchangetheattentionlogits,andshiftthetemporal-spatialtokensselectedbyQueries.Theseobservationsmotivateustopreserveattentionlogitsandtemporal-spatialtokenselectionduringKVcachequantization.Toaddressthisissue,wepresentQuantWM,atraining-free2-bitKVcachequantizationframeworkforvideoworldmodels.QuantWMintroducestwocomplementarytechniquestomitigatetheattentionshifts.Firstly,quantization-sensitivity-awareclustering(QSAC)jointlyconsidershistoricalQuerysensitivityandresidualrangestoselectINT2-friendlyKeycentroids,whichreducesquantizationerrorsinchannelsthataremorecriticaltoattention.Inaddition,principal-subspaceattentioncompensation(PSAC)restorestheremainingKeyerrorsalongthedominantQuerysubspaceusinglow-rankprojections,whichprovidesadirectandefficientcorrectiontostabilizeattentionlogits.ExperimentsonLingBot-World-v2,HY-World1.5,Matrix-Game-2,Longcat-VideoandCausal-ForcingdemonstratethatQuantWMsignificantlyimprovesvisualqualityandtemporalconsistency,whileoutperformingexistingmethodsacrossbenchmarkswithupto6.20KVcachememorycompressionandlimitedadditionaloverhead.
View arXiv pageView PDFProject pageAdd to collection
Get this paper in your agent:
hf papers read 2609\.26425
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2609.26425 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2609.26425 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2609.26425 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
WUSH-KV: KV Cache Quantization with Data-Adaptive Transforms
WUSH-KV introduces a data-adaptive transform approach for low-bit KV-cache quantization, constructing separate key and value transforms from calibration data and showing near-optimality with the QuESTINT quantizer. Integrated into SGLang with OSCAR-style quantization, it matches or outperforms the OSCAR transform at 2-bit across evaluated models and tasks.
Velox: Spatial Memory Makes World Models Efficient
Velox 提出一种免训练的注意力路由器,利用相机视锥切片的几何对应关系进行区域级上下文选择,从而加速长视频生成中的 KV 缓存处理。在第 48 个 chunk 时注意力加速 4.36 倍、去噪加速 2.43 倍,且在 WBench 导航基准上几乎不损失质量。
Quantized Keys Steal Attention: Bias Correction for KV-Cache Compression in Video Diffusion
This paper identifies a bias in attention weights caused by quantizing keys in KV-cache compression for chunk-wise autoregressive video diffusion, and proposes a per-attention-score correction that removes the bias with negligible overhead, recovering near-BF16 video quality at INT2 quantization.
Quantizing MTP KV Cache = free lunch?
Quantizing the Multi-Token Prediction (MTP) KV cache to q8_0 in llama.cpp for Qwen models reduces VRAM usage without affecting inference speed or acceptance rate, effectively providing a 'free lunch' for memory-constrained setups.
Spend Bits Where Queries Look: KV Cache Vector Quantization with Attention-Preserving Transforms
This paper proposes NOVA-KV, a transform-coding approach to KV cache quantization that uses attention-preserving transforms to allocate bits where queries actually attend, improving long-context retrieval accuracy at low bit rates compared to prior methods.