Papers
arxiv:2610.24481

DuoLM: Fast and Effective Personalized Recommendation with Language Models

Published on Oct 20
· Submitted by
JW
on Oct 26
Authors:
,
,
,

Abstract

DuoLM accelerates personalized recommendation by combining a compact encoder and ranker with optimized inference, achieving high throughput with minimal quality loss.

Language models can make personalized recommendations from rich item content, user history, and feedback. However, evaluating many candidates with full-text inputs incurs substantial online computation and limits serving throughput. We introduce DuoLM, a framework for fast and effective personalized recommendation that integrates a compact recommendation model with an efficient serving runtime. An encoder LLM learns compact item representations for offline reuse, while a personalized ranker LLM combines them with user history and feedback for recommendation. We train both models end to end with recommendation supervision and teacher distillation. The runtime further accelerates inference through virtual token IDs for embedding access, shared history computation, and CUDA Graph replay. Benchmark results show that our framework achieves recommendation quality comparable to that of the expert teacher model. On a single H100, it delivers approximately 26,400 candidate scores per second, about 60times the throughput of the teacher served with vLLM and automatic prefix caching.

Community

Paper author Paper submitter
•
edited 1 day ago

Introducing DuoLM

DuoLM is a framework for fast, personalized recommendation with two jointly trained language models. An encoder turns item descriptions into compact representations that can be cached and reused across users. A ranker combines these representations with each user’s history and feedback to make personalized recommendations. Both models learn end to end from recommendation labels and guidance from a full-text teacher.

The serving runtime makes this reuse practical: item representations stay on the GPU and are accessed through virtual token IDs, multiple candidates share history computation within each request, and CUDA Graphs reduce execution overhead. Together, the model and runtime reduce repeated work throughout the recommendation process.

This is an automated message from the Librarian Bot. I found the following papers similar to this paper.

The following papers were recommended by the Semantic Scholar API

Please give a thumbs up to this comment if you found it helpful!

If you want recommendations for any Paper on Hugging Face checkout this Space

You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2610.24481
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 2

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2610.24481 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2610.24481 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.