Efficiency Unleashed: Inference Acceleration for LLM-based Recommender Systems with Speculative Decoding
Not on the map. Why?
Abstract (arXiv)
The past few years have witnessed a growing interest in LLM-based recommender systems (RSs), although their industrial deployment remains in a preliminary stage. Most existing deployments leverage LLMs offline as feature enhancers, generating augmented knowledge for downstream tasks. However, in recommendation scenarios with numerous users and items, even offline knowledge generation with LLMs demands significant time and computational resources. This inefficiency arises from the autoregressive nature of LLMs. A promising solution is speculative decoding, a Draft-Then-Verify approach that increases the number of tokens generated per decoding step. In this work, we first identify recommendation knowledge generation as a highly fitting use case for retrieval-based speculative decoding. Then, we discern its two characteristics: (1) the vast number of items and users in RSs leads to retrieval inefficiency, and (2) RSs exhibit high diversity tolerance for LLM-generated text. Building on these insights, we introduce Lossless Acceleration via Speculative Decoding for LLM-based Recommender Systems (LASER), which features a Customized Retrieval Pool to enhance retrieval efficiency and Relaxed Verification to improve the acceptance rate of draft tokens. LASER achieves a 3-5x speedup on public datasets and saves about 67% of computational resources during the online A/B test on a large-scale advertising scenario with lossless downstream recommendation performance. Our code is available at https://github.com/YunjiaXi/LASER
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Aug 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 3; 2026: 5.
10 papers.
- 2025A Survey of LLM-based Deep Search Agents: Paradigm, Optimization, Evaluation, and Challengescited by 58
- 2024Towards Next-Generation LLM-based Recommender Systems: A Survey and Beyondcited by 26
- 2024Efficient Inference for Large Language Model-based Generative Recommendationcited by 11
- 2025NEZHA: A Zero-sacrifice and Hyperspeed Decoding Architecture for Generative Recommendationscited by 5
- 2026MoE-SpAc: Efficient MoE Inference Based on Speculative Activation Utility in Heterogeneous Edge Scenarioscited by 5
- 2025Reinforcement Speculative Decoding for Fast Rankingcited by 3
- 2026From Relevance to Authority: Authority-aware Generative Retrieval in Web Search Enginescited by 1
- 2026PRISM: Purified Representation and Integrated Semantic Modeling for Generative Sequential Recommendationcited by 0
- 2026Modular Representation Compression: Adapting LLMs for Efficient and Effective Recommendationscited by 0
- 2026Position-Aware Drafting for Inference Acceleration in LLM-Based Generative List-Wise Recommendationcited by 0
- 2026Position-Aware Drafting for Inference Acceleration in LLM-Based Generative List-Wise Recommendation30 Apr 2026
- 2026Modular Representation Compression: Adapting LLMs for Efficient and Effective Recommendations20 Apr 2026
- 2026From Relevance to Authority: Authority-aware Generative Retrieval in Web Search Engines15 Apr 2026
- 2026MoE-SpAc: Efficient MoE Inference Based on Speculative Activation Utility in Heterogeneous Edge Scenarios12 Feb 2026
- 2026PRISM: Purified Representation and Integrated Semantic Modeling for Generative Sequential Recommendation23 Jan 2026
- 2025NEZHA: A Zero-sacrifice and Hyperspeed Decoding Architecture for Generative Recommendations24 Nov 2025
- 2025A Survey of LLM-based Deep Search Agents: Paradigm, Optimization, Evaluation, and Challenges3 Aug 2025
- 2025Reinforcement Speculative Decoding for Fast Ranking23 May 2025
- 2024Towards Next-Generation LLM-based Recommender Systems: A Survey and Beyond10 Oct 2024
- 2024Efficient Inference for Large Language Model-based Generative Recommendation7 Oct 2024