Two papers propose token-adaptive KV cache compression for long-context LLMs
Two arXiv papers from July 7, 2026 introduce token-adaptive KV cache compression methods for long-context LLM inference. DepthWeave-KV factorizes key/value states across neighboring layers using shared low-rank bases with token-specific residuals. FreqDepthKV uses shared low-frequency depth components and sparse high-frequency residuals, with an online probe assigning attention heads to different cache modes. Both aim to reduce memory bandwidth while preserving retrieval and reasoning quality.
Entities
Related
User seeks to extend Qwen 3.6 27B context window beyond 100k tokens
A user reports running Qwen 3.6 27B (Q8_0) at 100k context length but finds reliability insufficient. They ask the community for techniques beyond KV cache quantization to improve stability at longer contexts.
Software engineer publishes final part of LLM-from-scratch series covering inference and decoding
A software engineer published the fourth and final part of a blog series explaining LLMs from the ground up, focusing on token-by-token generation, KV cache, and decoding strategies (temperature, top-k, top-p). The series aims to help other software engineers understand the internals of LLMs.
New model with 500K-token context and $2/$6 pricing shifts cost calculus
A model offering a 500,000-token context window at $2 per million input tokens and $6 per million output tokens has been released, drawing attention for its cost-effectiveness. The pricing and context length are seen as significant for applications requiring long-context processing, potentially changing the competitive landscape before benchmark comparisons are even made.
Researchers identify modality interference as root cause of full-duplex SLM degradation
A new paper on arXiv (July 7, 2026) presents a fine-grained analysis of optimization dynamics in full-duplex Spoken Language Models (SLMs), identifying severe modality interference as the root cause of knowledge degradation and compromised semantic integrity. The work aims to enable more natural and intelligent full-duplex SLMs.
SLORR: Simple and Efficient In-Training Low-Rank Regularization
Researchers introduced SLORR, a simple, stateless, and architecture-preserving framework for in-training low-rank regularization. It avoids SVDs of large weight matrices, additional trainable parameters, and stateful cached quantities, addressing key limitations of existing methods. This could enable more aggressive compression of modern neural networks without significant accuracy loss.