{"total":33,"rows":[{"id":"2406.16858","title":"EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees","created":"2024-06-24","cited_by_count":370,"area":"inference"},{"id":"2305.09781","title":"SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification","created":"2023-05-16","cited_by_count":365,"area":"inference"},{"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":"2402.16363","title":"LLM Inference Unveiled: Survey and Roofline Model Insights","created":"2024-02-26","cited_by_count":152,"area":"inference"},{"id":"2310.15141","title":"SpecTr: Fast Speculative Decoding via Optimal Transport","created":"2023-10-23","cited_by_count":129,"area":"inference"},{"id":"2402.02082","title":"GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding","created":"2024-02-03","cited_by_count":75,"area":"inference"},{"id":"2405.19715","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","created":"2024-05-30","cited_by_count":75,"area":"inference"},{"id":"2404.18911","title":"Kangaroo: Lossless Self-Speculative Decoding via Double Early Exiting","created":"2024-04-29","cited_by_count":58,"area":"inference"},{"id":"2410.04466","title":"Large Language Model Inference Acceleration: A Comprehensive Hardware Perspective","created":"2024-10-06","cited_by_count":38,"area":"inference"},{"id":"2312.12728","title":"Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracy","created":"2023-12-20","cited_by_count":37,"area":"inference"},{"id":"2403.09919","title":"Recurrent Drafter for Fast Speculative Decoding in Large Language Models","created":"2024-03-14","cited_by_count":37,"area":"inference"},{"id":"2403.10444","title":"Block Verification Accelerates Speculative Decoding","created":"2024-03-15","cited_by_count":30,"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":"2502.19732","title":"Speculative Decoding and Beyond: An In-Depth Survey of Techniques","created":"2025-02-27","cited_by_count":23,"area":"inference"},{"id":"2410.05589","title":"ParallelSpec: Parallel Drafter for Efficient Speculative Decoding","created":"2024-10-08","cited_by_count":22,"area":"inference"},{"id":"2502.18779","title":"Towards Optimal Multi-draft Speculative Decoding","created":"2025-02-26","cited_by_count":19,"area":"inference"},{"id":"2405.00263","title":"Clover: Regressive Lightweight Speculative Decoding with Sequential Knowledge","created":"2024-05-01","cited_by_count":10,"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":"2402.04838","title":"PaDeLLM-NER: Parallel Decoding in Large Language Models for Named Entity Recognition","created":"2024-02-07","cited_by_count":6,"area":"inference"},{"id":"2405.13019","title":"A Comprehensive Survey of Accelerated Generation Techniques in Large Language Models","created":"2024-05-15","cited_by_count":5,"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":"2510.13847","title":"DynaSpec: Context-aware Dynamic Speculative Sampling for Large-Vocabulary Language Models","created":"2025-10-11","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":"2601.00644","title":"FlexSpec: Frozen Drafts Meet Evolving Targets in Edge-Cloud Collaborative LLM Speculative Decoding","created":"2026-01-02","cited_by_count":3,"area":"inference"},{"id":"2411.05894","title":"SSSD: Simply-Scalable Speculative Decoding","created":"2024-11-08","cited_by_count":2,"area":"inference"},{"id":"2502.17139","title":"FastCoder: Accelerating Repository-level Code Generation via Efficient Retrieval and Verification","created":"2025-02-24","cited_by_count":2,"area":"inference"},{"id":"2505.13254","title":"HeteroSpec: Leveraging Contextual Heterogeneity for Efficient Speculative Decoding","created":"2025-05-19","cited_by_count":2,"area":"inference"},{"id":"2509.21689","title":"SpecMER: Fast Protein Generation with K-mer Guided Speculative Decoding","created":"2025-09-25","cited_by_count":2,"area":"inference"},{"id":"2604.02047","title":"Goose: Anisotropic Speculation Trees for Training-Free Speculative Decoding","created":"2026-04-02","cited_by_count":2,"area":"inference"},{"id":"2601.23180","title":"TriSpec: Ternary Speculative Decoding via Lightweight Proxy Verification","created":"2026-01-30","cited_by_count":1,"area":"inference"},{"id":"2606.00021","title":"SENSE: Semantic Embedding Navigation with Soft-gated Evaluation for Retrieval-based Speculative Decoding","created":"2026-04-14","cited_by_count":1,"area":"inference"},{"id":"2609.30474","title":"Mentored Decoding: Faster Inference meets Boosting","created":"2026-09-24","cited_by_count":0,"area":"inference"},{"id":"2610.10929","title":"Speedbumps: Rejection Attacks on Speculative Decoding","created":"2026-10-07","cited_by_count":0,"area":"inference"}],"next_cursor":null}