CLMANov 27, 2025

Q-KVComm: Efficient Multi-Agent Communication Via Adaptive KV Cache Compression

arXiv:2512.17914v12 citations
Originality Highly original
AI Analysis

This addresses bandwidth and computational inefficiencies for multi-agent LLM systems, representing a new paradigm rather than an incremental improvement.

The paper tackled the bottleneck of redundant contextual information transmission in multi-agent LLM systems by introducing Q-KVComm, a protocol for direct transmission of compressed KV cache representations, achieving 5-6x compression ratios while maintaining semantic fidelity with coherence scores above 0.77.

Multi-agent Large Language Model (LLM) systems face a critical bottleneck: redundant transmission of contextual information between agents consumes excessive bandwidth and computational resources. Traditional approaches discard internal semantic representations and transmit raw text, forcing receiving agents to recompute similar representations from scratch. We introduce Q-KVComm, a new protocol that enables direct transmission of compressed key-value (KV) cache representations between LLM agents. Q-KVComm combines three key innovations: (1) adaptive layer-wise quantization that allocates variable bit-widths based on sensitivity profiling, (2) hybrid information extraction that preserves critical facts across content domains, and (3) heterogeneous model calibration establishing cross-architecture communication. Extensive experiments across three diverse question-answering datasets demonstrate that Q-KVComm achieves 5-6x compression ratios while maintaining semantic fidelity, with coherence quality scores above 0.77 across all scenarios. The protocol exhibits robust performance across model sizes (1.1B-1.5B parameters) and adapts to real-world applications including conversational QA and multi-hop reasoning. Our work establishes a new paradigm for LLM agent communication, shifting from text-based to representation-based information exchange.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes