SALS (KV-cache compression): current frontier — recent, not yet superseded in the knowledge base. 0 paper(s) critique it, 0 beat it on benchmarks — not ranked as a superseded baseline. Sub-problem: cluster led by Palu. Newer alternatives in the same sub-problem include ArborKV, RDKV, EchoKV, VQKV, Self-Indexing KVCache.

KV-cache compression

SALS

SALS: Sparse Attention in Latent Space for KV cache Compression

On the frontierfirst seen Oct 28, 2025

Current frontier — recent, not yet superseded in the knowledge base

0 papers critique it · 0 beat it on benchmarks

What to use instead

Recent methods in the same sub-problem, not yet superseded in the knowledge base — arXiv benchmark leaders, not vetted production recommendations.

ArborKVArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning
May 21, 2026
RDKVRDKV: Rate-Distortion Bit Allocation for Joint Eviction and Quantization of the KV Cache
May 8, 2026
EchoKVEchoKV: Efficient KV Cache Compression via Similarity-Based Reconstruction
Mar 24, 2026
VQKVVQKV: High-Fidelity and High-Ratio Cache Compression via Vector-Quantization
Mar 17, 2026
Self-Indexing KVCacheSelf-Indexing KVCache: Predicting Sparse Attention from Compressed Keys
Mar 15, 2026
KV-CoREKV-CoRE: Benchmarking Data-Dependent Low-Rank Compressibility of KV-Caches in LLMs
Feb 5, 2026
StiefAttentionDon't be so Stief! Learning KV Cache low-rank approximation over the Stiefel manifold
Jan 29, 2026
GPU-ccelerated INT8 quantization for KV cache compressionGPU-Accelerated INT8 Quantization for KV Cache Compression in Large Language Models
Jan 8, 2026
STA-AttentionUnlocking the Address Book: Dissecting the Sparse Semantic Structure of LLM Key-Value Caches via Sparse Autoencoders
Dec 11, 2025
SWANSWAN: Sparse Winnowed Attention for Reduced Inference Memory via Decompression-Free KV-Cache Compression
Nov 24, 2025
SALSSALS: Sparse Attention in Latent Space for KV cache Compression
Oct 28, 2025
OjaKVOjaKV: Context-Aware Online Low-Rank KV Cache Compression with Oja's Rule
Sep 25, 2025