paper-with-me

Papers

SentenceKV: Efficient LLM Inference via Sentence-Level Semantic KV Caching

2025-04-01 · Yuxuan Zhu, Ali Falahati, David H. Yang, Mohammad Mohammadi Amiri

Large language models face significant computational and memory challenges when processing long contexts. During inference, efficient management of the key-value (KV) cache, which stores intermediate activations for autoregressive generation, is critical to reducing memory overhead and improving computational efficiency. Traditional token-level efficient KV caching methods overlook semantic information, treating tokens independently without considering their semantic relationships. Meanwhile, existing semantic-preserving KV cache management approaches often suffer from substantial memory usage and high time-to-first-token. To address these limitations, we propose SentenceKV, a novel sentence-level semantic KV caching approach designed to enhance inference efficiency while preserving semantic coherence. During prefilling, SentenceKV groups tokens based on sentence-level semantic similarity, compressing sentence representations into concise semantic vectors stored directly on the GPU, while individual KV pairs are offloaded to CPU. During decoding, SentenceKV generates tokens by selectively retrieving semantically relevant sentence-level KV entries, leveraging the semantic similarity between the prefilling-stage semantic vectors and decoding-stage queries. This ensures efficient and contextually accurate predictions, minimizing the loading of redundant or irrelevant data into GPU memory and significantly reducing memory overhead while maintaining stable inference latency, even for extremely long contexts. Extensive evaluations on benchmarks including PG-19, LongBench, and Needle-In-A-Haystack demonstrate that SentenceKV significantly outperforms state-of-the-art methods in both efficiency and memory usage, without compromising model accuracy.

📄 PDF Abstract BibTeX arXiv:2504.00970

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyCPUGPUManagementSemantic SimilaritySemantic Textual SimilaritySentence

Similar Papers 제목 키워드 기반

GraphCache: Message Passing as Caching for Sentence-Level Relation Extraction

2022-01-16 · ACL ARR January 2022 1 · Anonymous

Entity types and textual context are essential properties for sentence-level relation extraction (RE). Existing work only encodes these properties within individual instances, which limits the performance of RE given the…

Graph Neural NetworkRelationRelation ExtractionSentence

GRAPHCACHE: Message Passing as Caching for Sentence-Level Relation Extraction

2022-05-08 · Findings (NAACL) 2022 7 · Yiwei Wang, Muhao Chen, Wenxuan Zhou, Yujun Cai 외

Entity types and textual context are essential properties for sentence-level relation extraction (RE). Existing work only encodes these properties within individual instances, which limits the performance of RE given the…

Graph Neural NetworkRelationRelation ExtractionSentence

LLMCache: Layer-Wise Caching Strategies for Accelerated Reuse in Transformer Inference

2025-12-18 · Harsh Vardhan Bansal arxiv

Transformer-based language models have achieved remarkable performance across a wide range of tasks, yet their high inference latency poses a significant challenge for real-timeand large-scale deployment. While existing …

Semantic Similarity

Semantic Caching for Low-Cost LLM Serving: From Offline Learning to Online Adaptation

2025-08-11 · Xutong Liu, Baran Atalar, Xiangxiang Dai, Jinhang Zuo 외 arxiv

Large Language Models (LLMs) are revolutionizing how users interact with information systems, yet their high inference cost poses serious scalability and sustainability challenges. Caching inference responses, allowing t…

Semantic Similarity

Closing the Operational Gap in Semantic Caching

2026-06-18 · Aditeya Baral, Radoslav Ralev, Iliya Sotirov Zhechev, Srijith Rajamohan 외 arxiv

Semantic caching cuts LLM inference costs by serving a cached response to semantically similar queries. Standard practice evaluates these systems using PR-AUC, a metric that only measures how well scores rank and ignores…