DuoLM is introduced, a framework for fast and effective personalized recommendation that integrates a compact recommendation model with an efficient serving runtime that accelerates inference through virtual token IDs for embedding access, shared history computation, and CUDA Graph replay.
Abstract
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 $60\times$ the throughput of the teacher served with vLLM and automatic prefix caching.
Experiments on five real-world datasets show that \textsc{DS-Frame} consistently improves representative sequential recommendation backbones, with larger gains on challenging groups and effective accuracy--efficiency trade-offs, highlighting the potential of adaptive inference for more efficient and robust recommendati...
Zi-Chen Yuan, Xiao-Xuan Dong, Linkun Dai et al.· 0 citations
Large language models (LLMs) have demonstrated strong capabilities in recommendation tasks such as item, sequence, conversational recommendation, and explanation generation. However, LLM weights are typically shared across all users. Adapting these models to individual users remains a fundamental challenge that require...
Kanishka Dandeniya, C. Dasanayaka, Daswin de Silva et al.· Proceedings of the 20th ACM...· 0 citations
LSNR encodes each article independently and constructs a sparse user vector by combining learned, attention-based weighting of the per-article sparse representations with a dense-projected expansion at the user level, which confirms that learned attention-based aggregation outperforms simpler pooling alternatives.
KuaFu is a unified behavior-compression layer whose minimal unit is one behavior item, with fidelity-oriented four-stage training and layered intermediate evaluation, which matches or exceeds uncompressed single-task production models on all five headline metrics, raises per-GPU throughput by 37%-350%, and saves 190 GP...
Jia-Hao Hui, Lin Zhu, Beng-Siang Tan et al.· 0 citations
This work introduces ENOUGH, a method that iteratively appends behavioral records or emits STOP to construct profiles with adaptive lengths, which consistently outperforms strong heuristic and retrieval-augmented baselines in both effectiveness and efficiency.
Ming-Hang Liu, Qiang Qiu, Yuan-Zhuo Wang et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.