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

Gongyi Wang

dblp:372/0209 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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 · 67% Language models and text generation · 33%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › similarity search
nearest neighbor search
1.012026
KBest: Efficient Vector Search on Kunpeng CPU · KDD (1) 2026
High-performance computing
performance optimization
1.012026
KBest: Efficient Vector Search on Kunpeng CPU · KDD (1) 2026
Machine learning › Efficient and distributed learning › KV cache management
KV cache compression
0.912025
RazorAttention: Efficient KV Cache Compression Through Retrieval Heads · ICLR 2025
Natural language and speech › Language models and text generation › large language model inference
long-context inference
0.912025
RazorAttention: Efficient KV Cache Compression Through Retrieval Heads · ICLR 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
RazorAttention: Efficient KV Cache Compression Through Retrieval Heads · ICLR 2025

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

attention analysis · 0.9
YearPublicationVenuePosition
2026 KBest: Efficient Vector Search on Kunpeng CPU
Kaihao Ma, Oleg Senkevich, Daihao Xue, Dmitriy Malyshev, Yangming Lv, Shihai Xiao, Xiao Yan 0002, Alexander Radionov, Weidi Zeng, Yuanzhan Gao, Zhiyu Zou, Xin Yao 0008, Yaoyao Fu, Gongyi Wang, Gong Zhang 0001, Fei Yi, Yingfan Liu
KDD (1)19
2025 RazorAttention: Efficient KV Cache Compression Through Retrieval Heads
abstract
The memory and computational demands of Key-Value (KV) cache present significant challenges for deploying long-context language models. Previous approaches attempt to mitigate this issue by selectively dropping tokens, which irreversibly erases critical information that might be needed for future queries. In this paper, we propose a novel compression technique for KV cache that preserves all token information. Our investigation reveals that: i) Most attention heads primarily focus on the local context; ii) Only a few heads, denoted as retrieval heads, can essentially pay attention to all input tokens. These key observations motivate us to use separate caching strategy for attention heads.Therefore, we propose RazorAttention, a training-free KV cache compression algorithm, which maintains a full cache for these crucial retrieval heads and discards the remote tokens in non-retrieval heads. Furthermore, we introduce a novel mechanism involving a “compensation token” to further recover the information in the dropped tokens. Extensive evaluations across a diverse set of large language models (LLMs) demonstrate that RazorAttention achieves a reduction in KV cache size by over 70% without noticeable impacts on performance. Additionally, RazorAttention is compatible with FlashAttention, rendering it an efficient and plug-and-play solution that enhances LLM inference efficiency without overhead or retraining of the original model.
Hanlin Tang 0002, Qingsen Han, Danning Ke, Shikuan Hong, Yiwu Yao, Gongyi Wang
ICLR8