Can LLMs Outshine Conventional Recommenders? A Comparative Evaluation

Yong Liu (Tsinghua University, Tsinghua University) · Kun Wang (Nanyang Technological University) · Jieming Zhu (Huawei Noah's Ark Lab) · Wei Guo (Huawei Noah's Ark Lab) · Qijiong Liu (Hong Kong Polytechnic University) · Lu Fan (NetEase, Inc.) · Hengchang Hu (National University of Singapore) · Xiao-Ming Wu (The Hong Kong Polytechnic University)
auc improvementclick-through rate predictiondataset diversityexperimental resultsinference efficiencyitem representationmodel comparisonndcg@10performance evaluationreal-time recommendersrecommender systemssemantic embeddingsequential recommendation

Integrating large language models (LLMs) into recommender systems has created new opportunities for improving recommendation quality. However, a comprehensive benchmark is needed to thoroughly evaluate and compare the recommendation capabilities of LLMs with traditional recommender systems. In this paper, we introduce \recbench{}, which systematically investigates various item representation forms (including unique identifier, text, semantic embedding, and semantic identifier) and evaluates two primary recommendation tasks, i.e., click-through rate prediction (CTR) and sequential recommendation (SeqRec). Our extensive experiments cover up to 17 large models and are conducted across five diverse datasets from fashion, news, video, books, and music domains. Our findings indicate that LLM-based recommenders outperform conventional recommenders, achieving up to a 5% AUC improvement in CTR and up to a 170% NDCG@10 improvement in SeqRec. However, these substantial performance gains come at the expense of significantly reduced inference efficiency, rendering LLMs impractical as real-time recommenders. We have released our code and data to enable other researchers to reproduce and build upon our experimental results.