{"total":32,"rows":[{"id":"2601.17668","title":"Fast KVzip: Efficient and Accurate LLM Inference with Gated KV Eviction","created":"2026-01-25","cited_by_count":16,"area":"inference"},{"id":"2601.07891","title":"KVzap: Fast, Adaptive, and Faithful KV Cache Pruning","created":"2026-01-12","cited_by_count":15,"area":"inference"},{"id":"2604.19572","title":"A Self-Evolving Framework for Efficient Terminal Agents via Observational Context Compression","created":"2026-04-21","cited_by_count":15,"area":"inference"},{"id":"2602.08005","title":"ResidualKV: Residual-Based KV Cache Compression for Efficient Long-Context Inference","created":"2026-02-08","cited_by_count":9,"area":"inference"},{"id":"2604.26779","title":"Accelerating RL Post-Training Rollouts via System-Integrated Speculative Decoding","created":"2026-04-29","cited_by_count":9,"area":"inference"},{"id":"2606.23050","title":"Unlimited OCR Works","created":"2026-06-22","cited_by_count":8,"area":"inference"},{"id":"2605.25475","title":"IndexMem: Learned KV-Cache Eviction with Latent Memory for Long-Context LLM Inference","created":"2026-05-25","cited_by_count":7,"area":"inference"},{"id":"2607.07847","title":"When Does Continual Learning Require Learning","created":"2026-07-08","cited_by_count":7,"area":"inference"},{"id":"2604.20920","title":"Simplified Sparse Attention via Gist Tokens","created":"2026-04-22","cited_by_count":6,"area":"inference"},{"id":"2602.05191","title":"Double-P: Hierarchical Top-P Sparse Attention for Long-Context LLMs","created":"2026-02-05","cited_by_count":5,"area":"inference"},{"id":"2602.07397","title":"Scout Before You Attend: Sketch-and-Walk Sparse Attention for Efficient LLM Inference","created":"2026-02-07","cited_by_count":4,"area":"inference"},{"id":"2608.07009","title":"HiSparse: Scaling Sparse-Attention Decoding with Hierarchical KV Cache Management","created":"2026-08-07","cited_by_count":3,"area":"inference"},{"id":"2602.18196","title":"RAT+: Train Dense, Infer Sparse -- Recurrence Augmented Attention for Dilated Inference","created":"2026-02-20","cited_by_count":2,"area":"inference"},{"id":"2606.06467","title":"You Only Index Once: Cross-Layer Sparse Attention with Shared Routing","created":"2026-06-04","cited_by_count":2,"area":"inference"},{"id":"2606.19746","title":"SAC: Disaggregated KV Cache System for Sparse Attention LLMs with CXL","created":"2026-06-18","cited_by_count":2,"area":"inference"},{"id":"2606.31519","title":"RaBitQCache: Rotated Binary Quantization for KVCache in Long Context LLM Inference","created":"2026-06-30","cited_by_count":2,"area":"inference"},{"id":"2602.01778","title":"Data Distribution Matters: A Data-Centric Perspective on Context Compression for Large Language Model","created":"2026-02-02","cited_by_count":1,"area":"inference"},{"id":"2603.12038","title":"Slow-Fast Inference: Training-Free Inference Acceleration via Within-Sentence Support Stability","created":"2026-03-12","cited_by_count":1,"area":"inference"},{"id":"2604.00368","title":"TENT: A Declarative Slice Spraying Engine for Performant and Resilient Data Movement in Disaggregated LLM Serving","created":"2026-04-01","cited_by_count":1,"area":"inference"},{"id":"2606.01502","title":"Move the Query, Not the Cache: Characterizing Cross-Instance Latent Attention Redistribution Across GPU Fabrics","created":"2026-05-31","cited_by_count":1,"area":"inference"},{"id":"2609.02737","title":"Language Models Can Control Their Own Attention","created":"2026-09-02","cited_by_count":1,"area":"inference"},{"id":"2609.26368","title":"HySparse2: Hybrid Sparse Attention with Two-Level KV Sharing","created":"2026-09-22","cited_by_count":1,"area":"inference"},{"id":"2609.36835","title":"ARC-KV: Amortizing Anchor Search for Reconstruction-Based KV Cache Compaction","created":"2026-09-29","cited_by_count":1,"area":"inference"},{"id":"2607.05876","title":"Think Before You Grid-Search: Floor-First Triage for LLM Serving","created":"2026-07-07","cited_by_count":0,"area":"inference"},{"id":"2608.03555","title":"Heterogeneous LLM Serving with General-Purpose Processing-Near-Memory for Retrieval-Based Sparse Attention","created":"2026-08-04","cited_by_count":0,"area":"inference"},{"id":"2609.37626","title":"SPLASH: Switching Parallel Layouts of Attention with Seamless Handoff for LLM Serving","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2610.00418","title":"CommunityKV: Efficient Long-Context Decoding via Graph Partitioning","created":"2026-09-30","cited_by_count":0,"area":"inference"},{"id":"2610.04313","title":"MOIRA: Mass-Oriented Indexing with Ragged Attention for Long-Context Decoding","created":"2026-10-03","cited_by_count":0,"area":"inference"},{"id":"2610.09025","title":"SPIN: Shadow Predictive Indexer for Sparse Attention","created":"2026-10-06","cited_by_count":0,"area":"inference"},{"id":"2610.13708","title":"Adaptive DHiSparse: Speculative Decoding over a Load-Adaptive KV Hierarchy","created":"2026-10-09","cited_by_count":0,"area":"inference"},{"id":"2610.17202","title":"MLAfication: Efficiently Enabling High-Fidelity MLA for Modern LLMs","created":"2026-10-12","cited_by_count":0,"area":"inference"},{"id":"2610.18654","title":"Kwai Summary Attention V2 Technical Report","created":"2026-10-13","cited_by_count":0,"area":"inference"}],"next_cursor":null}