Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches
cs.LG, cs.CL, cs.DC
Submitted: 2026-09-15
Updated: 2026-09-18
Comments: 19 pages, 11 figures, 21 tables. Code and results: https://github.com/vivekkalyanarangan30/fathom
Code: https://github.com/vivekkalyanarangan30/fathom
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval
- The Llama 3 Herd of Models
- Qwen3 Technical Report
- Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache
- Post-Training Sparse Attention with Double Sparsity
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks