{"total":30,"rows":[{"id":"2401.07851","title":"Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding","created":"2024-01-15","cited_by_count":269,"area":"inference"},{"id":"2310.07240","title":"CacheGen: KV Cache Compression and Streaming for Fast Large Language Model Serving","created":"2023-10-11","cited_by_count":203,"area":"inference"},{"id":"2311.08252","title":"REST: Retrieval-Based Speculative Decoding","created":"2023-11-14","cited_by_count":150,"area":"inference"},{"id":"2411.10666","title":"SAM Decoding: Speculative Decoding via Suffix Automaton","created":"2024-11-16","cited_by_count":39,"area":"inference"},{"id":"2506.04997","title":"Towards Storage-Efficient Visual Document Retrieval: An Empirical Study on Reducing Patch-Level Embeddings","created":"2025-06-05","cited_by_count":26,"area":"inference"},{"id":"2405.19325","title":"Nearest Neighbor Speculative Decoding for LLM Generation and Attribution","created":"2024-05-29","cited_by_count":25,"area":"inference"},{"id":"2410.05589","title":"ParallelSpec: Parallel Drafter for Efficient Speculative Decoding","created":"2024-10-08","cited_by_count":22,"area":"inference"},{"id":"2503.05096","title":"AdaSpec: Adaptive Speculative Decoding for Fast, SLO-Aware Large Language Model Serving","created":"2025-03-07","cited_by_count":18,"area":"inference"},{"id":"2405.18628","title":"Hardware-Aware Parallel Prompt Decoding for Memory-Efficient Acceleration of LLM Inference","created":"2024-05-28","cited_by_count":16,"area":"inference"},{"id":"2510.08907","title":"Autoencoding-Free Context Compression for LLMs via Contextual Semantic Anchors","created":"2025-10-10","cited_by_count":14,"area":"inference"},{"id":"2505.24196","title":"CLaSp: In-Context Layer Skip for Self-Speculative Decoding","created":"2025-05-30","cited_by_count":11,"area":"inference"},{"id":"2408.15562","title":"Boosting Lossless Speculative Decoding via Feature Sampling and Partial Alignment Distillation","created":"2024-08-28","cited_by_count":10,"area":"inference"},{"id":"2505.12398","title":"Traversal Verification for Speculative Tree Decoding","created":"2025-05-18","cited_by_count":9,"area":"inference"},{"id":"2512.04550","title":"AdmTree: Compressing Lengthy Context with Adaptive Semantic Trees","created":"2025-12-04","cited_by_count":8,"area":"inference"},{"id":"2410.04139","title":"From Reading to Compressing: Exploring the Multi-document Reader for Prompt Compression","created":"2024-10-05","cited_by_count":7,"area":"inference"},{"id":"2502.15572","title":"DReSD: Dense Retrieval for Speculative Decoding","created":"2025-02-21","cited_by_count":6,"area":"inference"},{"id":"2606.17034","title":"KVEraser: Learning to Steer KV Cache for Efficient Localized Context Erasing","created":"2026-06-15","cited_by_count":6,"area":"inference"},{"id":"2408.00264","title":"Clover-2: Accurate Inference for Regressive Lightweight Speculative Decoding","created":"2024-08-01","cited_by_count":5,"area":"inference"},{"id":"2502.05609","title":"Lossless Acceleration of Large Language Models with Hierarchical Drafting based on Temporal Locality in Speculative Decoding","created":"2025-02-08","cited_by_count":4,"area":"inference"},{"id":"2605.07068","title":"WiCER: Wiki-memory Compile, Evaluate, Refine Iterative Knowledge Compilation for LLM Wiki Systems","created":"2026-05-08","cited_by_count":4,"area":"inference"},{"id":"2503.00784","title":"DuoDecoding: Hardware-aware Heterogeneous Speculative Decoding with Dynamic Multi-Sequence Drafting","created":"2025-03-02","cited_by_count":3,"area":"inference"},{"id":"2504.11765","title":"Shared Disk KV Cache Management for Efficient Multi-Instance Inference in RAG-Powered LLMs","created":"2025-04-16","cited_by_count":3,"area":"inference"},{"id":"2504.09775","title":"MIST: A Co-Design Framework for Heterogeneous, Multi-Stage LLM Inference","created":"2025-04-14","cited_by_count":2,"area":"inference"},{"id":"2504.12778","title":"Towards Lossless Token Pruning in Late-Interaction Retrieval Models","created":"2025-04-17","cited_by_count":2,"area":"inference"},{"id":"2603.19635","title":"BEAVER: A Training-Free Hierarchical Prompt Compression Method via Structure-Aware Page Selection","created":"2026-03-20","cited_by_count":2,"area":"inference"},{"id":"2510.26527","title":"Polybasic Speculative Decoding Through a Theoretical Perspective","created":"2025-10-30","cited_by_count":1,"area":"inference"},{"id":"2605.04543","title":"UniVer: A Unified Perspective for Multi-step and Multi-draft Speculative Decoding","created":"2026-05-06","cited_by_count":1,"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":"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.24260","title":"KAP: Bridging the Knowledge Selection-Runtime Consumption Gap in LLM Systems","created":"2026-07-27","cited_by_count":0,"area":"inference"}],"next_cursor":null}