{"total":51,"rows":[{"id":"2402.02057","title":"Break the Sequential Dependency of LLM Inference Using Lookahead Decoding","created":"2024-02-03","cited_by_count":298,"area":"inference"},{"id":"2403.09054","title":"Keyformer: KV Cache Reduction through Key Tokens Selection for Efficient Generative Inference","created":"2024-03-14","cited_by_count":126,"area":"inference"},{"id":"2312.04985","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","created":"2023-12-08","cited_by_count":119,"area":"inference"},{"id":"2402.12374","title":"Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding","created":"2024-02-19","cited_by_count":103,"area":"inference"},{"id":"2310.05424","title":"Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decoding","created":"2023-10-09","cited_by_count":80,"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":"2312.04916","title":"EE-LLM: Large-Scale Training and Inference of Early-Exit Large Language Models with 3D Parallelism","created":"2023-12-08","cited_by_count":69,"area":"inference"},{"id":"2406.14066","title":"TurboSpec: Closed-loop Speculation Control System for Optimizing LLM Serving Goodput","created":"2024-06-20","cited_by_count":37,"area":"inference"},{"id":"2402.06262","title":"On the Efficacy of Eviction Policy for Key-Value Constrained Generative Language Model Inference","created":"2024-02-09","cited_by_count":32,"area":"inference"},{"id":"2402.13720","title":"Ouroboros: Generating Longer Drafts Phrase by Phrase for Faster Speculative Decoding","created":"2024-02-21","cited_by_count":25,"area":"inference"},{"id":"2410.18351","title":"AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability","created":"2024-10-24","cited_by_count":25,"area":"inference"},{"id":"2507.10150","title":"Past-Future Scheduler for LLM Serving under SLA Guarantees","created":"2025-07-14","cited_by_count":20,"area":"inference"},{"id":"2312.05385","title":"Apparate: Rethinking Early Exits to Tame Latency-Throughput Tensions in ML Serving","created":"2023-12-08","cited_by_count":15,"area":"inference"},{"id":"2601.11580","title":"Speculative Decoding: Performance or Illusion?","created":"2025-12-31","cited_by_count":15,"area":"inference"},{"id":"2402.00518","title":"EE-Tuning: An Economical yet Scalable Solution for Tuning Early-Exit Large Language Models","created":"2024-02-01","cited_by_count":13,"area":"inference"},{"id":"2407.09722","title":"Optimized Multi-Token Joint Decoding with Auxiliary Model for LLM Inference","created":"2024-07-12","cited_by_count":11,"area":"inference"},{"id":"2411.05289","title":"SpecHub: Provable Acceleration to Multi-Draft Speculative Decoding","created":"2024-11-08","cited_by_count":10,"area":"inference"},{"id":"2501.14808","title":"HyGen: Efficient LLM Serving via Elastic Online-Offline Request Co-location","created":"2025-01-15","cited_by_count":10,"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":"2406.07368","title":"When Linear Attention Meets Autoregressive Decoding: Towards More Effective and Efficient Linearized Large Language Models","created":"2024-06-11","cited_by_count":9,"area":"inference"},{"id":"2410.14042","title":"Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles","created":"2024-10-17","cited_by_count":9,"area":"inference"},{"id":"2410.23079","title":"BUZZ: Beehive-structured Sparse KV Cache with Segmented Heavy Hitters for Efficient LLM Inference","created":"2024-10-30","cited_by_count":9,"area":"inference"},{"id":"2410.20418","title":"Inevitable Trade-off between Watermark Strength and Speculative Sampling Efficiency for Language Models","created":"2024-10-27","cited_by_count":8,"area":"inference"},{"id":"2311.08623","title":"DEED: Dynamic Early Exit on Decoder for Accelerating Encoder-Decoder Transformer Models","created":"2023-11-15","cited_by_count":7,"area":"inference"},{"id":"2404.14897","title":"Beyond the Speculative Game: A Survey of Speculative Execution in Large Language Models","created":"2024-04-23","cited_by_count":7,"area":"inference"},{"id":"2505.15774","title":"Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retention","created":"2025-05-21","cited_by_count":7,"area":"inference"},{"id":"2510.20797","title":"No Mean Feat: Simple, Strong Baselines for Context Compression","created":"2025-10-23","cited_by_count":7,"area":"inference"},{"id":"2502.08923","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","created":"2025-02-13","cited_by_count":6,"area":"inference"},{"id":"2602.13836","title":"Speculative Decoding with a Speculative Vocabulary","created":"2026-02-14","cited_by_count":6,"area":"inference"},{"id":"2503.18989","title":"A Novel Hat-Shaped Device-Cloud Collaborative Inference Framework for Large Language Models","created":"2025-03-23","cited_by_count":5,"area":"inference"},{"id":"2504.16574","title":"PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compression","created":"2025-04-23","cited_by_count":4,"area":"inference"},{"id":"2601.05724","title":"Overcoming Joint Intractability with Lossless Hierarchical Speculative Decoding","created":"2026-01-09","cited_by_count":4,"area":"inference"},{"id":"2604.07622","title":"DIVERSED: Relaxed Speculative Decoding via Dynamic Ensemble Verification","created":"2026-04-08","cited_by_count":4,"area":"inference"},{"id":"2402.15678","title":"Minions: Accelerating Large Language Model Inference with Aggregated Speculative Execution","created":"2024-02-24","cited_by_count":3,"area":"inference"},{"id":"2405.07542","title":"EMS-SD: Efficient Multi-sample Speculative Decoding for Accelerating Large Language Models","created":"2024-05-13","cited_by_count":3,"area":"inference"},{"id":"2505.17420","title":"DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policies","created":"2025-05-23","cited_by_count":3,"area":"inference"},{"id":"2511.20340","title":"Scaling LLM Speculative Decoding: Non-Autoregressive Forecasting in Large-Batch Scenarios","created":"2025-11-25","cited_by_count":3,"area":"inference"},{"id":"2607.08690","title":"A Practical Investigation of Training-free Relaxed Speculative Decoding","created":"2026-07-09","cited_by_count":3,"area":"inference"},{"id":"2608.01651","title":"Bole: Efficient Tree Speculation for Hybrid-Attention Language Models","created":"2026-08-03","cited_by_count":3,"area":"inference"},{"id":"2505.18092","title":"QwenLong-CPRS: Towards $\\infty$-LLMs with Dynamic Context Optimization","created":"2025-05-23","cited_by_count":2,"area":"inference"},{"id":"2602.01274","title":"PACER: Blockwise Pre-verification for Speculative Decoding with Adaptive Length","created":"2026-02-01","cited_by_count":2,"area":"inference"},{"id":"2604.18170","title":"Copy-as-Decode: Grammar-Constrained Parallel Prefill for LLM Editing","created":"2026-04-20","cited_by_count":1,"area":"inference"},{"id":"2607.21804","title":"Adversarial Prompts for Acceptance Collapse in Speculative Decoding","created":"2026-07-23","cited_by_count":1,"area":"inference"},{"id":"2608.24411","title":"ResiSpec: Enhancing Multi-Candidate Speculative Sampling via Residual Distribution Shaping","created":"2026-08-25","cited_by_count":1,"area":"inference"},{"id":"2609.20186","title":"To Copy or Not to Copy: Controlling Speculative Decoding via Intrinsic Model Signals","created":"2026-09-17","cited_by_count":1,"area":"inference"},{"id":"2511.07423","title":"Synera: Synergistic LLM Serving across Device and Cloud at Scale","created":"2025-10-17","cited_by_count":0,"area":"inference"},{"id":"2602.01762","title":"PRISM: Parametrically Refactoring Inference for Speculative Sampling Draft Models","created":"2026-02-02","cited_by_count":0,"area":"inference"},{"id":"2606.12243","title":"VIA-SD: Verification via Intra-Model Routing for Speculative Decoding","created":"2026-06-10","cited_by_count":0,"area":"inference"},{"id":"2608.13076","title":"SPADE: Speculative Decoding for Precise and Low Cost Distributed Edge Cloud Inference","created":"2026-08-13","cited_by_count":0,"area":"inference"},{"id":"2608.28846","title":"A rigor-matched audit of periodic-step layer skipping for efficient llm inference: conflayers versus swift, with a supplemental analysis of trained routing alternatives","created":"2026-08-28","cited_by_count":0,"area":"inference"},{"id":"2609.03235","title":"SGD-KV: Summarization Guided KV Cache Compression","created":"2026-09-03","cited_by_count":0,"area":"inference"}],"next_cursor":null}