{"total":36,"rows":[{"id":"2403.02310","title":"Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Serve","created":"2024-03-04","cited_by_count":526,"area":"inference"},{"id":"2310.06839","title":"LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression","created":"2023-10-10","cited_by_count":453,"area":"inference"},{"id":"2404.14294","title":"A Survey on Efficient Inference for Large Language Models","created":"2024-04-22","cited_by_count":205,"area":"inference"},{"id":"2308.16369","title":"SARATHI: Efficient LLM Inference by Piggybacking Decodes with Chunked Prefills","created":"2023-08-31","cited_by_count":193,"area":"inference"},{"id":"2312.15234","title":"Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systems","created":"2023-12-23","cited_by_count":102,"area":"inference"},{"id":"2407.18003","title":"Keep the Cost Down: A Review on Methods to Optimize LLM' s KV-Cache Consumption","created":"2024-07-25","cited_by_count":97,"area":"inference"},{"id":"2402.09398","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","created":"2024-02-14","cited_by_count":75,"area":"inference"},{"id":"2412.10319","title":"SCBench: A KV Cache-Centric Analysis of Long-Context Methods","created":"2024-12-13","cited_by_count":60,"area":"inference"},{"id":"2407.01527","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","created":"2024-07-01","cited_by_count":42,"area":"inference"},{"id":"2503.10568","title":"Autoregressive Image Generation with Randomized Parallel Decoding","created":"2025-03-13","cited_by_count":20,"area":"inference"},{"id":"2512.03324","title":"Cache What Lasts: Token Retention for Memory-Bounded KV Cache in LLMs","created":"2025-12-03","cited_by_count":19,"area":"inference"},{"id":"2407.12077","title":"GoldFinch: High Performance RWKV/Transformer Hybrid with Linear Pre-Fill and Extreme KV-Cache Compression","created":"2024-07-16","cited_by_count":18,"area":"inference"},{"id":"2503.16163","title":"SpeCache: Speculative Key-Value Caching for Efficient Generation of LLMs","created":"2025-03-20","cited_by_count":9,"area":"inference"},{"id":"2403.14919","title":"Hierarchical Skip Decoding for Efficient Autoregressive Text Generation","created":"2024-03-22","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":"2510.20787","title":"Alleviating Forgetfulness of Linear Attention by Hybrid Sparse Attention and Contextualized Learnable Token Eviction","created":"2025-10-23","cited_by_count":3,"area":"inference"},{"id":"2605.19049","title":"KVBuffer: IO-aware Serving for Linear Attention","created":"2026-05-18","cited_by_count":3,"area":"inference"},{"id":"2504.19191","title":"WuNeng: Hybrid State with Attention","created":"2025-04-27","cited_by_count":2,"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":"2603.02188","title":"Multi-Head Low-Rank Attention","created":"2026-03-02","cited_by_count":2,"area":"inference"},{"id":"2605.06221","title":"UniPrefill: Universal Long-Context Prefill Acceleration via Block-wise Dynamic Sparsification","created":"2026-05-07","cited_by_count":2,"area":"inference"},{"id":"2605.13784","title":"Attention Once Is All You Need: Efficient Streaming Inference with Stateful Transformers","created":"2026-05-13","cited_by_count":2,"area":"inference"},{"id":"2605.22884","title":"Tensor Cache: Eviction-conditioned Associative Memory for Transformers","created":"2026-05-21","cited_by_count":2,"area":"inference"},{"id":"2606.02775","title":"AURA: Action-Gated Memory for Robot Policies at Constant VRAM","created":"2026-06-01","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":"2608.19758","title":"FlashPrefill V2: Block-Sparse Prefill Attention for Long-Context LLM Serving","created":"2026-08-20","cited_by_count":2,"area":"inference"},{"id":"2608.28444","title":"Sliding-window beats linear attention","created":"2026-08-28","cited_by_count":2,"area":"inference"},{"id":"2512.09238","title":"Training-free Context-adaptive Attention for Efficient Long Context Modeling","created":"2025-12-10","cited_by_count":1,"area":"inference"},{"id":"2608.15533","title":"DeltaLog: Deferred Materialization of Recurrent States for Linear Attention Decoding","created":"2026-08-16","cited_by_count":1,"area":"inference"},{"id":"2505.20698","title":"Sparsified State-Space Models are Efficient Highway Networks","created":"2025-05-27","cited_by_count":0,"area":"inference"},{"id":"2511.04686","title":"Stateful KV Cache Management for LLMs: Balancing Space, Time, Accuracy, and Positional Fidelity","created":"2025-10-23","cited_by_count":0,"area":"inference"},{"id":"2607.02574","title":"From Tensor Buffer to Distributed Memory Hierarchy: A Survey of KV Cache Management for LLM Serving","created":"2026-06-30","cited_by_count":0,"area":"inference"},{"id":"2607.11897","title":"Semidirect Fourier Delta Attention: Phase-Controlled Delta Memory with Constructive Chunk-WY Kernels","created":"2026-06-12","cited_by_count":0,"area":"inference"},{"id":"2608.03036","title":"LLM Serving in the Wild: An Empirical Study of Frameworks, Methods, and System Designs","created":"2026-08-04","cited_by_count":0,"area":"inference"},{"id":"2609.38169","title":"STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization","created":"2026-09-29","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}