大模型
arxiv.org ·
OmniKVQuant:面向全模态大语言模型的 KV 缓存量化
该论文分析旋转式 KV 缓存量化方法 TurboQuant 在多模态缓存上的两个问题:时间维度的 key 漂移与不同模态间 value 几何分布异质。为此提出免训练框架 OmniKVQuant,按输入流的短窗口设定 key 量化范围,并按模态分别旋转 value。在 Qwen2.5-Omni 和 Qwen3-Omni 上支持 2-bit KV 缓存,并在七个音视频基准上保持性能;同时提供融合 Triton 解码内核,在注意力计算中直接解包 2-bit 缓存,避免构建密集 FP16 缓存。
AI推荐理由 arXiv 新论文,针对全模态 LLM 的 KV 缓存量化这一尚未被探索的方向,指出 TurboQuant 在多模态缓存上的两个具体问题(temporal key drift、heterogeneous value geometry),提出免训练框架 OmniKVQuant,并在 Qwen2.5-Omni 与 Qwen3-Omni 上实现 2-bit KV 缓存、跨七个音视频基准保持性能,还提供融合 Triton 解码内核。信息密度高、方法具体、有可验证的模型与基准,但结果均为作者自述,尚无第三方复现或代码可用性证据。
78
正文
Computer Science > Computer Vision and Pattern Recognition
arXiv:2609.11582 (cs)
[Submitted on 10 Sep 2026]
Title:OmniKVQuant: KV Cache Quantization for Omni-LLMs
Authors:Suho Yoo, Hyunjong Ok, Jongmin Choi, Jihoo Jung, Joon Son Chung
View a PDF of the paper titled OmniKVQuant: KV Cache Quantization for Omni-LLMs, by Suho Yoo and 4 other authors
View PDF
HTML (experimental)
Abstract:As Omni-modal large language models (Omni-LLMs) take in audio, video and text together, their KV cache memory cost grows. KV cache quantization is the de facto approach in text-only LLMs, but its application to Omni-LLMs remains unexplored. In this paper, we analyze how TurboQuant, a representative rotation-based KV cache quantization method, behaves on multimodal caches and identify two critical issues: temporal key drift and heterogeneous value geometry. To address these, we propose OmniKVQuant, a training-free framework that (i) sets the key quantization range over each short window of the input stream; and (ii) rotates values separately per modality. On Qwen2.5-Omni and Qwen3-Omni, OmniKVQuant enables 2-bit KV caches while substantially preserving performance across seven audio-visual benchmarks. We further provide a fused Triton decode kernel that unpacks the 2-bit cache during attention, so no dense FP16 cache is ever built. Code: this https URL
Comments:
Subjects:
Computer Vision and Pattern Recognition (cs.CV)
Cite as:
arXiv:2609.11582 [cs.CV]
(or
arXiv:2609.11582v1 [cs.CV] for this version)
https://doi.org/10.48550/arXiv.2609.11582
Focus to learn more
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Suho Yoo [view email]
[v1]
Thu, 10 Sep 2026 14:14:12 UTC (605 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled OmniKVQuant: KV Cache Quantization for Omni-LLMs, by Suho Yoo and 4 other authors
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.CV
new
|
recent
| 2026-09
Change to browse by:
cs
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
export BibTeX citation
Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? |
Disable MathJax (What is MathJax?)