Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Quantong Qiu

dblp:407/9569 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0006-6811-2115ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › memory optimization
inference memory reduction
0.912025
Accurate KV Cache Quantization with Outlier Tokens Tracing · ACL (1) 2025
Machine learning › Efficient and distributed learning › model compression › quantization
KV cache quantization
0.912025
Accurate KV Cache Quantization with Outlier Tokens Tracing · ACL (1) 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
Accurate KV Cache Quantization with Outlier Tokens Tracing · ACL (1) 2025

Methods — techniques the papers use, named apart from their topics

token-wise quantization · 0.9channel-wise quantization · 0.9
YearPublicationVenuePosition
2025 Accurate KV Cache Quantization with Outlier Tokens Tracing
abstract
The impressive capabilities of Large Language Models (LLMs) come at the cost of substantial computational resources during deployment. While KV Cache can significantly reduce recomputation during inference, it also introduces additional memory overhead. KV Cache quantization presents a promising solution, striking a good balance between memory usage and accuracy. Previous research has shown that the Keys are distributed by channel, while the Values are distributed by token. Consequently, the common practice is to apply channel-wise quantization to the Keys and token-wise quantization to the Values. However, our further investigation reveals that a small subset of unusual tokens exhibit unique characteristics that deviate from this pattern, which can substantially impact quantization accuracy. To address this, we develop a simple yet effective method to identify these tokens accurately during the decoding process and exclude them from quantization as outlier tokens, significantly improving overall accuracy. Extensive experiments show that our method achieves significant accuracy improvements under 2-bit quantization and can deliver a 6.4 times reduction in memory usage and a 2.3 times increase in throughput.
Yi Su 0006, Yuechi Zhou, Quantong Qiu, Juntao Li 0005, Qingrong Xia, Ping Li 0016, Xinyu Duan, Zhefeng Wang 0001, Min Zhang 0005
ACL (1)3