LLMRec: Benchmarking Large Language Models on Recommendation Task
Authors: Junling Liu, Chao Liu, Peilin Zhou, Qichen Ye, Dading Chong, Kang Zhou, Yueqi Xie, Yuwei Cao, +3 more
Organizations: Alibaba Group · Ant Group · The Hong Kong University of Science and Technology (Guangzhou) · School of Electronic and Computer Engineering, Peking University · The Hong Kong University of Science and Technology · Department of Computer Science, University of Illinois Chicago · Data Science Institute,University of Technology Sydney · Department of Electrical Engineering, Yale University
Recently, the fast development of Large Language Models (LLMs) such as ChatGPT has significantly advanced NLP tasks by enhancing the capabilities of conversational models. However, the application of LLMs in the recommendation domain has not been thoroughly investigated. To bridge this gap, we propose LLMRec, a LLM-based recommender system designed for benchmarking LLMs on various recommendation tasks. Specifically, we benchmark several popular off-the-shelf LLMs, such as ChatGPT, LLaMA, ChatGLM, on five recommendation tasks, including rating prediction, sequential recommendation, direct recommendation, explanation generation, and review summarization. Furthermore, we investigate the effectiveness of supervised finetuning to improve LLMs' instruction compliance ability. The benchmark results indicate that LLMs displayed only moderate proficiency in accuracy-based tasks such as sequential and direct recommendation. However, they demonstrated comparable performance to state-of-the-art methods in explainability-based tasks. We also conduct qualitative evaluations to further evaluate the quality of contents generated by different models, and the results show that LLMs can truly understand the provided information and generate clearer and more reasonable results. We aspire that this benchmark will serve as an inspiration for researchers to delve deeper into the potential of LLMs in enhancing recommendation performance. Our codes, processed data and benchmark results are available at https://github.com/williamliujl/LLMRec.
Figures & tables
Figure 1: The overall architecture of LLMRec.
Figure 2: Finetuning prompts for five recommendation tasks.
Methods
BLUE4
ROUGE1
ROUGE2
ROUGEL
Attn2Seq
0.7889
12.6590
1.6820
9.7481
NRT
0.8295
12.7815
1.8543
9.9477
PETER
1.1541
14.8497
2.1413
11.4143
P5-B
0.9742
16.4530
1.8858
11.8765
PETER+
3.2606
25.5541
5.9668
19.7168
ChatGPT
0.1266
6.4060
0.3347
5.1458
Table 1: Performance comparison on explanation generation (%).
Methods
BLUE4
ROUGE1
ROUGE2
ROUGEL
T0
1.2871
1.2750
0.3904
0.9592
GPT-2
0.5879
3.3844
0.6756
1.3956
P5-B
2.1225
8.4205
1.6676
7.5476
ChatGPT
0.3121
4.7177
0.6924
4.2557
ChatGLM w/o SFT
0.2472
4.3544
0.6306
3.2348
LLaMA w/o SFT
0.4306
3.9954
0.8280
1.9456
Table 2: Performance comparison on review summarization (%).
Methods
RMSE
MAE
MF
1.1973
0.9461
MLP
1.3078
0.9597
ChatGPT
1.4913
1.2836
ChatGLM w/o SFT
N/A
N/A
LLaMA w/o SFT
N/A
N/A
Alpaca w/o SFT
N/A
N/A
Table 3: Performance comparison on rating prediction.
Methods
HR@5
NDCG@5
HR@10
NDCG@10
Caser
0.0205
0.0131
0.0347
0.0176
HGN
0.0325
0.0206
0.0512
0.0266
GRU4Rec
0.0164
0.0099
0.0283
0.0137
BERT4Rec
0.0203
0.0124
0.0347
0.0170
FDSA
0.0267
0.0163
0.0407
0.0208
SASRec
0.0387
0.0249
0.0605
0.0318
Table 4: Performance comparison on sequential recommendation.
Methods
HR@5
NDCG@5
HR@10
NDCG@10
BPR-MF
0.1426
0.0857
0.2573
0.1224
BPR-MLP
0.1392
0.0848
0.2542
0.1215
SimpleX
0.2247
0.1441
0.3090
0.1711
P5-B
0.1564
0.1096
0.2300
0.1332
ChatGPT
0.0217
0.0111
0.0652
0.0252
ChatGLM w/o SFT
N/A
N/A
N/A
N/A
Table 5: Performance comparison on direct recommendation.
Figure 3: Example summarization results of different LLMs.
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 4: Case study of N/A results.
Figure 5: Example explanation results of different LLMs.
Large language models are increasingly used as interactive recommender assistants. Their evaluation should therefore go beyond plausible item recommendation and test whether they can recognize flawed recommendation requests. Existing recommender benchmarks mainly assess ranking, generation, or preference satisfaction, while existing error-detection benchmarks are usually not grounded in recommendation-specific user and candidate evidence. To address this gap, we introduce RPCBench, a benchmark for evaluating Recommender-Premise Critique: the ability to detect, diagnose, and properly handle faulty premises in natural-language recommendation requests. RPCBench contains evidence-grounded test instances from five recommendation domains and covers ten types of premise failures. Each instance provides a visible recommendation context and a corrupted user query. We further design a fine-grained evaluation framework that measures proactive detection, error localization, post-detection handling strategy, and evidence faithfulness. Through a systematic evaluation of 11 LLMs, we find that proactive detection is the main bottleneck in Recommender-Premise Critique, and models perform worst on underspecified-premise errors. We also observe that target-critical information density matters more than redundant evidence, and that longer reasoning does not monotonically improve critique quality: performance peaks at intermediate reasoning length, while overly long reasoning is accompanied by an overthinking penalty. The code is available at https://github.com/ZhongruChen/RPCBench.
Zhongru Chen, Yuan Wu, Yi Chang
School of Artificial Intelligence, Jilin University · Engineering Research Center of Knowledge-Driven Human-Machine Intelligence, MOE, China · International Center of Future Science, Jilin University
Current Large Language Models (LLMs) are gradually exploited in practically valuable agentic workflows such as Deep Research, E-commerce recommendation, and job recruitment. In these applications, LLMs need to select some optimal solutions from massive candidates, which we term as LLM-as-a-Recommender paradigm. However, the reliability of using LLM agents for recommendations is underexplored. In this work, we introduce a BiasRecommendation Benchmark (BiasRecBench) to highlight the critical vulnerability of such agents to biases in high-value real-world tasks. The benchmark includes three practical domains: paper review, e-commerce, and job recruitment. We construct a Bias Synthesis Pipeline with Calibrated Quality Margins that 1) synthesizes evaluation data by controlling the quality gap between optimal and sub-optimal options to provide a calibrated testbed to elicit the vulnerability to biases; 2) injects contextual biases that are logical and suitable for option contexts. Extensive experiments on both SOTA (Gemini-{2.5,3}-pro, GPT-4o, DeepSeek-R1) and small-scale LLMs reveal that agents frequently succumb to injected biases despite having sufficient reasoning capabilities to identify the ground truth. These findings expose a significant reliability bottleneck in current agentic workflows, calling for specialized alignment strategies for LLM-as-a-Recommender. The complete code and evaluation datasets will be made publicly available shortly.
Zichen Tang, Zirui Zhang, Qian Wang +3
The Hong Kong University of Science and Technology · National University of Singapore · The Hong Kong University of Science and Technology (Guangzhou)
With the rise of LLMs, there is an increasing need for intelligent recommendation assistants that can handle complex queries and provide personalized, reasoning-driven recommendations. LLM-based recommenders show potential but face challenges in multi-step reasoning, underscoring the need for reasoning-augmented systems. To address this gap, we propose ReRec, a novel reinforcement fine-tuning (RFT) framework designed to improve LLM reasoning in complex recommendation tasks. Our framework introduces three key components: (1) Dual-Graph Enhanced Reward Shaping, integrating recommendation metrics like NDCG@K with Query Alignment and Preference Alignment Scores to provide fine-grained reward signals for LLM optimization; (2) Reasoning-aware Advantage Estimation, which decomposes LLM outputs into reasoning segments and penalizes incorrect steps to enhance reasoning of recommendation; and (3) Online Curriculum Scheduler, dynamically assess query difficulty and organize training curriculum to ensure stable learning during RFT. Experiments demonstrate that ReRec outperforms state-of-the-art baselines and preserves core abilities like instruction-following and general knowledge. Our codes are available at https://github.com/jiani-huang/ReRec.