SONIC: Segmented Optimized Nexus for Information Compression in Key-Value Caching
Hong Chen, Xiang Liu, Bo Wang, Yuxuan Fan, Yuanlin Chu, Zongluo Li, Xiaowen Chu, Xuming Hu
TL;DR
SONIC tackles the memory bottleneck of the Key-Value cache in multi-turn LLM inference by compressing historical turns into learnable Nexus tokens. It employs a turn-aware Nexus insertion, a hierarchical visibility mask, and an adaptive budget training regime, supported by multi-level distillation and reconstruction objectives to preserve semantic fidelity. The approach yields strong gains on MTBench101 and long-context benchmarks, with significant reductions in inference time and memory usage across 0.6B–4B Qwen models. This framework enables flexible, efficient deployment of long-context dialogue systems without retraining, representing a practical path toward scalable multi-turn LLM applications.
Abstract
The linear growth of Key-Value (KV) cache remains a bottleneck for multi-turn LLM deployment. Existing KV cache compression methods often fail to account for the structural properties of multi-turn dialogues, relying on heuristic eviction that risks losing critical context. We propose \textbf{SONIC}, a learning-based framework that compresses historical segments into compact and semantically rich \textbf{Nexus} tokens. By integrating dynamic budget training, SONIC allows flexible adaptation to varying memory constraints without retraining. Experiments show that at compression ratios of 80\% and 50\%, SONIC consistently outperforms baselines such as H2O and StreamingLLM on four diverse multi-turn benchmarks. Specifically, on the widely used MTBench101 benchmark, SONIC achieves an average score improvement of 35.55\% over state-of-the-art baselines, validating its effectiveness in sustaining coherent multi-turn dialogues. Furthermore, SONIC enhances deployment efficiency, accelerating the overall inference process by 50.1\% compared to full-context generation.
