Adaptive Mass-Segmented KV Compression for Long-Context Reasoning
The paper presents a new framework called Adaptive Mass-Segmented KV Compression aimed at improving long-context reasoning in large language models. It addresses the limitations of existing key-value compression methods by ensuring that important reasoning segments are preserved during inference. The proposed method has been shown to enhance model performance across various tasks while being compatible with existing systems.
- ▪Adaptive Mass-Segmented KV Compression mitigates the bottleneck of linear growth in KV cache during long-form LLM inference.
- ▪The framework shifts from token-level competition to region-aware quota allocation, ensuring vital reasoning segments receive guaranteed memory.
- ▪Extensive experiments demonstrate that AMS reduces structural fragmentation and improves performance in tasks like mathematical reasoning and code completion.
arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv cs.AI |
| Canonical URL | https://arxiv.org/abs/2605.23200 |
| Publication time | Mon, 25 May 2026 00:00:00 -0400 |
| Retrieval time | 2026-05-25T04:07:35.648Z |
| Last seen | 2026-05-25T04:07:35.648Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | eRAMvPy8guNr |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Machine Learning arXiv:2605.23200 (cs) [Submitted on 22 May 2026] Title:Adaptive Mass-Segmented KV Compression for Long-Context Reasoning Authors:Junzhe Yang, Xiaoyu Shen View a PDF of the paper titled Adaptive Mass-Segmented KV Compression for Long-Context Reasoning, by Junzhe Yang and 1 other authors View PDF HTML (experimental) Abstract:The linear growth of the Key-Value (KV) cache is a critical bottleneck in long-form LLM inference. Existing KV compression methods mitigate this by evicting tokens based on importance scores. However, we show that their reliance on global Top-k selection triggers Region Wipe-out: the severe eviction of contiguous reasoning blocks that derails logical coherence.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.