提出可扩展的评估框架,验证大模型推荐系统各组件效果
RecRankerEval: A Flexible and Extensible Framework for Top-k LLM-based Recommendation
- 构建五维评估框架,系统分析推荐模型各组件作用
- 复现原论文结果,发现点对点方法存在数据泄露导致性能虚高
- 证明改进采样、初始模型和大模型可进一步提升推荐效果
近期基于大语言模型(LLM)的推荐系统RecRanker在top-k推荐任务中表现优异。其通过聚类采样用户,使用初始推荐模型生成初步排序列表,并通过混合指令微调优化LLM以推断用户偏好。然而各核心组件的贡献仍不明确。本文复现了RecRanker全流程,发现成对与列表方法可复现原论文性能;而点对点方法虽能复现结果,但因提示中包含真实标签信息导致性能异常偏高。为此,我们提出RecRankerEval框架,涵盖用户采样策略、初始推荐模型、LLM主干、数据集选择和指令微调方法五个维度。实验表明,原结果可在ML-100K、ML-1M和Amazon-Music数据集上复现,但在BookCrossing上无法复现,因原论文缺少时间戳信息。此外,采用更优用户采样、更强初始推荐器及更强大LLM可进一步提升性能。
原文摘要 · Abstract (English)
A recent Large language model (LLM)-based recommendation model, called RecRanker, has demonstrated a superior performance in the top-k recommendation task compared to other models. In particular, RecRanker samples users via clustering, generates an initial ranking list using an initial recommendation model, and fine-tunes an LLM through hybrid instruction tuning to infer user preferences. However, the contribution of each core component remains underexplored. In this work, we inspect the reproducibility of RecRanker, and study the impact and role of its various components. We begin by reproducing the RecRanker pipeline through the implementation of all its key components. Our reproduction shows that the pairwise and listwise methods achieve a performance comparable to that reported in the original paper. For the pointwise method, while we are also able to reproduce the original paper's results, further analysis shows that the performance is abnormally high due to data leakage from the inclusion of ground-truth information in the prompts. To enable a fair and comprehensive evaluation of LLM-based top-k recommendations, we propose RecRankerEval, an extensible framework that covers five key dimensions: user sampling strategy, initial recommendation model, LLM backbone, dataset selection, and instruction tuning method. Using the RecRankerEval framework, we show that the original results of RecRanker can be reproduced on the ML-100K and ML-1M datasets, as well as the additional Amazon-Music dataset, but not on BookCrossing due to the lack of timestamp information in the original RecRanker paper. Furthermore, we demonstrate that RecRanker's performance can be improved by employing alternative user sampling methods, stronger initial recommenders, and more capable LLMs.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。