Decoding in Latent Spaces for Efficient Inference in LLM-based Recommendation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914036737638400 |
|---|---|
| author | Wang, Chengbing Zhang, Yang Wang, Zhicheng Shi, Tianhao Bao, Keqin Feng, Fuli Chua, Tat-Seng |
| author_facet | Wang, Chengbing Zhang, Yang Wang, Zhicheng Shi, Tianhao Bao, Keqin Feng, Fuli Chua, Tat-Seng |
| contents | Fine-tuning large language models (LLMs) for recommendation in a generative manner has delivered promising results, but encounters significant inference overhead due to autoregressive decoding in the language space. This work explores bypassing language-space decoding by directly matching candidate items with the LLM's internal thought representations in the latent space, eliminating the time-consuming autoregressive process to reduce computational costs. Towards this, we introduce Light Latent-space Decoding (L2D), an effective and efficient latent-space decoding method. L2D represents user-preferred items by using the hidden states of test sequences reflecting the LLM's internal thought, and obtains candidate item representations from the hidden states of training sequences labeled with the corresponding candidate items. It then matches the two types of representations to decode items, achieving latent-space decoding. In this way, it enables efficient decoding without altering the LLM's generative tuning paradigm, thereby preserving performance. Extensive empirical results demonstrate that L2D is more than 10x faster than language-space decoding while maintaining or enhancing performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_11524 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Decoding in Latent Spaces for Efficient Inference in LLM-based Recommendation Wang, Chengbing Zhang, Yang Wang, Zhicheng Shi, Tianhao Bao, Keqin Feng, Fuli Chua, Tat-Seng Information Retrieval Fine-tuning large language models (LLMs) for recommendation in a generative manner has delivered promising results, but encounters significant inference overhead due to autoregressive decoding in the language space. This work explores bypassing language-space decoding by directly matching candidate items with the LLM's internal thought representations in the latent space, eliminating the time-consuming autoregressive process to reduce computational costs. Towards this, we introduce Light Latent-space Decoding (L2D), an effective and efficient latent-space decoding method. L2D represents user-preferred items by using the hidden states of test sequences reflecting the LLM's internal thought, and obtains candidate item representations from the hidden states of training sequences labeled with the corresponding candidate items. It then matches the two types of representations to decode items, achieving latent-space decoding. In this way, it enables efficient decoding without altering the LLM's generative tuning paradigm, thereby preserving performance. Extensive empirical results demonstrate that L2D is more than 10x faster than language-space decoding while maintaining or enhancing performance. |
| title | Decoding in Latent Spaces for Efficient Inference in LLM-based Recommendation |
| topic | Information Retrieval |
| url | https://arxiv.org/abs/2509.11524 |