{"total":35,"rows":[{"id":"2509.23094","title":"d$^2$Cache: Accelerating Diffusion-Based LLMs via Dual Adaptive Caching","created":"2025-09-27","cited_by_count":25,"area":"inference"},{"id":"2412.08890","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","created":"2024-12-12","cited_by_count":17,"area":"inference"},{"id":"2412.17483","title":"A Silver Bullet or a Compromise for Full Attention? A Comprehensive Study of Gist Token-based Context Compression","created":"2024-12-23","cited_by_count":17,"area":"inference"},{"id":"2504.20039","title":"AutoJudge: Judge Decoding Without Manual Annotation","created":"2025-04-28","cited_by_count":13,"area":"inference"},{"id":"2509.02718","title":"Efficient Training-Free Online Routing for High-Volume Multi-LLM Serving","created":"2025-09-02","cited_by_count":13,"area":"inference"},{"id":"2412.01380","title":"Efficient LLM Inference using Dynamic Input Pruning and Cache-Aware Masking","created":"2024-12-02","cited_by_count":11,"area":"inference"},{"id":"2507.01438","title":"EdgeLoRA: An Efficient Multi-Tenant LLM Serving System on Edge Devices","created":"2025-07-02","cited_by_count":11,"area":"inference"},{"id":"2604.09557","title":"SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding","created":"2026-02-10","cited_by_count":10,"area":"inference"},{"id":"2509.15763","title":"UniGist: Towards General and Hardware-aligned Sequence-level Long Context Compression","created":"2025-09-19","cited_by_count":9,"area":"inference"},{"id":"2607.07847","title":"When Does Continual Learning Require Learning","created":"2026-07-08","cited_by_count":7,"area":"inference"},{"id":"2608.27513","title":"DAMP: Decay-Aware Mixed-Precision Recurrent-State Quantization","created":"2026-08-27","cited_by_count":6,"area":"inference"},{"id":"2504.14775","title":"gLLM: Global Balanced Pipeline Parallelism System for Distributed LLM Serving with Token Throttling","created":"2025-04-21","cited_by_count":5,"area":"inference"},{"id":"2602.20217","title":"KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problem","created":"2026-02-23","cited_by_count":5,"area":"inference"},{"id":"2510.02329","title":"SelfJudge: Faster Speculative Decoding via Self-Supervised Judge Verification","created":"2025-09-26","cited_by_count":4,"area":"inference"},{"id":"2510.13602","title":"NOSA: Native and Offloadable Sparse Attention","created":"2025-10-15","cited_by_count":4,"area":"inference"},{"id":"2511.06174","title":"LUT-LLM: Efficient Large Language Model Inference with Memory-based Computations on FPGAs","created":"2025-11-09","cited_by_count":4,"area":"inference"},{"id":"2605.16928","title":"Full Attention Strikes Back: Transferring Full Attention into Sparse within Hundred Training Steps","created":"2026-05-16","cited_by_count":4,"area":"inference"},{"id":"2601.04766","title":"JuDi: Revisiting Judge Decoding from First Principles via Training-Free Distributional Divergence","created":"2026-01-08","cited_by_count":2,"area":"inference"},{"id":"2605.26678","title":"NestedKV: Nested Memory Routing for Long-Context KV Cache Compression","created":"2026-05-26","cited_by_count":2,"area":"inference"},{"id":"2609.35621","title":"Cartridges++: KV Cache Compression without Off-Context Derailment","created":"2026-09-28","cited_by_count":2,"area":"inference"},{"id":"2610.13778","title":"ReplaySSM: Cache SSM Inputs, Not State","created":"2026-10-09","cited_by_count":2,"area":"inference"},{"id":"2606.05742","title":"AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decoding","created":"2026-06-04","cited_by_count":1,"area":"inference"},{"id":"2608.14191","title":"KV Cache Compression Through the Lens of Transform Coding","created":"2026-08-14","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":"2511.22481","title":"OmniInfer: System-Wide Acceleration Techniques for Optimizing LLM Serving Throughput and Latency","created":"2025-11-27","cited_by_count":0,"area":"inference"},{"id":"2604.26951","title":"Turning the TIDE: Cross-Architecture Distillation for Diffusion Large Language Models","created":"2026-04-29","cited_by_count":0,"area":"inference"},{"id":"2605.04263","title":"Parallel Prefix Verification for Speculative Generation","created":"2026-05-05","cited_by_count":0,"area":"inference"},{"id":"2605.23057","title":"RequestRouter: Request-Boundary Routing for Efficient Single-GPU LLM Inference","created":"2026-05-21","cited_by_count":0,"area":"inference"},{"id":"2607.01792","title":"PARTREP: Learning What to Repeat for Decoder-only LLMs","created":"2026-07-02","cited_by_count":0,"area":"inference"},{"id":"2607.04244","title":"Quantize the Target, Quantize the Drafter: Efficient Inference with Qwen3.5-4B","created":"2026-07-05","cited_by_count":0,"area":"inference"},{"id":"2609.21172","title":"TierKV: Long-Context On-Device LLMs via Predictive Multi-Tier KV Caching","created":"2026-09-18","cited_by_count":0,"area":"inference"},{"id":"2609.29499","title":"Task-Aware Spectral Pruning: A Mixture-of-Masks Framework for Efficient LLM Inference","created":"2026-08-24","cited_by_count":0,"area":"inference"},{"id":"2610.09013","title":"Enabling Dynamic Computation in Looped LMs","created":"2026-10-06","cited_by_count":0,"area":"inference"},{"id":"2610.15509","title":"CacheLink: Functional KV Transport for Zero-Prefill Cross-Model Context Handoff","created":"2026-10-11","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}