ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “cache compression”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.ARcs.DCEmpiricalRecentOct 24, 2026

ZipFusion: Fusing Lossless KV Decompression with Attention for Efficient LLM Decoding

Yuetao Chen, Peng Wang, Hong Xu

This paper presents ZipFusion, a method that enables attention to consume losslessly compressed key-value (KV) cache directly, improving model decode throughput and reducing memory-bandwidth bound.

View →
cs.CLRecentMay 29, 2026

GRKV: Global Regression for Training-Free KV Cache Compression in Long-Context LLMs

Junjie Peng, You Wu, Haoyi Wu, Jialong Han +3 more

GRKV introduces a training-free KV-cache merging method that uses global regression to distribute information from evicted tokens, solving the over-merging problem inherent in span-based retention.

View →
cs.AIRecentMay 28, 2026

Moment-KV: Momentum-Based Decode-Time KV Cache Compression for Long Generation

Soumyadeep Jana, Sagar Nishad, Sanasam Ranbir Singh

Moment-KV introduces a novel momentum-based technique to compress the Key-Value (KV) cache during the decoding phase of LLM generation, significantly improving fidelity in long-generation tasks.

View →
cs.CLRecentMay 28, 2026

Probing the Prompt KV Cache: Where It Becomes Dispensable

Vinayshekhar Bannihatti Kumar, Manoj Ghuhan Arivazhagan, Disha Makhija, Rashmi Gangadharaiah

This paper investigates the redundancy of the prompt KV cache during language model decoding, finding that the structure provided by chat templates is the primary source of redundancy, not the actual…

View →
cs.ARcs.AIEmpiricalRecentJul 30, 2026

WitCert: Sound Runtime Risk Observability and Gating for KV-Cache Quantization

Fanzhe Wei, Li Liu

This paper introduces a provably sound runtime meter for KV-cache quantization to ensure compression does not damage the served request in real-time.

View →
cs.SEcs.AIcs.ETEmpiricalRecentOct 10, 2026

TurnCost: Turns, Not Observations: Cache-Aware Loop Engineering for Coding Agents

Pramod Kumar, Raj Kumar Pandey

This paper analyzes the efficiency of AI coding agents and identifies the opportunity for reducing unnecessary turns in their loop engineering process.

View →
cs.DBcs.DSEmpiricalRecentJun 15, 2026

C^2: Cache-Conscious Succinct Tries with Adaptive Unary Path Compression

Kepan Zhang, Tiancheng Zhao, Helen Xu

This paper proposes C^2, a set of techniques to improve the spatial locality of succinct tries, resulting in faster query performance and reduced memory footprint.

View →
cs.ITcs.DSEmpiricalRecentJun 16, 2026

The 2026 Algorithmic Information Theory Data Compression Challenge

André Ribeiro, Rúben Garrido, Violeta Ramos, António Alberto +27 more

This paper presents the 2026 Algorithmic Information Theory Data Compression Challenge, evaluating lossless compressors under realistic constraints and revealing performance dependencies.

View →
cs.ITTheoreticalRecentOct 9, 2026

Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files

Tati V D N Eswar, Jithin Ravi

The paper characterizes the memory-rate trade-off for demand-private coded caching with heterogeneous file sizes and cache capacities.

View →
cs.ITcs.CCTheoreticalRecentJun 22, 2026

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco, Ricardo Gudwin +1 more

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

View →
cs.DCcs.OSEmpiricalRecentJun 15, 2026

CacheWise: Understanding Workloads and Optimizing KVCache Management for Efficiently Serving LLM Coding Agents

Shubham Tiwari, Tapan Chugh, Nash Rickert, Simon Peter +2 more

This paper presents a new KVCache management layer called CacheWise that improves performance for coding agent workloads.

View →
cs.SEcs.AIcs.PLEmpiricalRecentAug 3, 2026

Lossless Tensor Compression as Program Synthesis

Jieke Shi, Junda He, Wenjia Jiang, Weifeng Sun +10 more

Brevis compresses model checkpoints by synthesizing self-contained DSL programs that reconstruct tensors bit-exactly, reducing storage requirements and achieving high compression and decompression spe…

View →
cs.OSEmpiricalRecentOct 18, 2026

Visual Cache Reuse for Efficient Multimodal Inference

Shuheng Gao, Yuankai Fan, Jiaqiang Ma, Jiawei Shao +2 more

VisMemo is a serving system that enables approximate KV cache reuse for modern vision-language models to reduce prefill latency and memory overhead.

View →
eess.AScs.SDEmpiricalRecentJul 7, 2026

Compress the Cache, Not the Speech Embedding: KV Compression for Efficient Speech LLMs

Ke-Han Lu, Keqi Deng, Ruchao Fan, Rui Zhao +1 more

The paper proposes SpeechKV, a method to compress speech sequences inside large language models using a learned pooling, maintaining performance and delivering decoding speedup.

View →