Source-linked AI summary
Towards Next-Generation Recommender Systems: A Benchmark for Personalized Recommendation Assistant with LLMs
Jiani Huang, Shijie Wang, Liang-bo Ning, Wenqi Fan, Shuaiqiang Wang, Dawei Yin, Qing Li
TL;DR
Existing recommendation and assistant benchmarks leave a gap in evaluating LLMs as personalized recommendation assistants, while realistic queries can be difficult to generate from intricate item-attribute relations. RecBench+ offers a benchmark for varied recommendation needs; evaluations show different LLMs lead on different metrics and reasoning-heavy queries.
Problem
Existing recommendation and assistant evaluations leave a gap in assessing LLMs as personalized recommendation assistants, while item-attribute relations make realistic, diverse queries challenging to generate.
Source: §1.2 · p. 4, §3 · p. 9Method
RecBench+ is a benchmark with five designed query types, used to evaluate a diverse set of LLMs and explore fine-tuning strategies.
Source: §4 · p. 9Results
GPT-4o achieves the highest Precision and second-highest CMR average on both movie and book datasets, while DeepSeek-R1 ranks first in Recall and excels on reasoning queries.
Source: §2.2 · p. 6Takeaways & Limitations
The benchmark presents 11 observations about LLM strengths and limitations as personalized recommendation assistants.
Source: §4 · p. 9
Abstract
from arXiv · showhide
Recommender systems (RecSys) are widely used across various modern digital platforms and have garnered significant attention. Traditional recommender systems usually focus only on fixed and simple recommendation scenarios, making it difficult to generalize to new and unseen recommendation tasks in an interactive paradigm. Recently, the advancement of large language models (LLMs) has revolutionized the foundational architecture of RecSys, driving their evolution into more intelligent and interactive personalized recommendation assistants. However, most existing studies rely on fixed task-specific prompt templates to generate recommendations and evaluate the performance of personalized assistants, which limits the comprehensive assessments of their capabilities. This is because commonly used datasets lack high-quality textual user queries that reflect real-world recommendation scenarios, making them unsuitable for evaluating LLM-based personalized recommendation assistants. To address this gap, we introduce RecBench+, a new dataset benchmark designed to access LLMs' ability to handle intricate user recommendation needs in the era of LLMs. RecBench+ encompasses a diverse set of queries that span both hard conditions and soft preferences, with varying difficulty levels. We evaluated commonly used LLMs on RecBench+ and uncovered below findings: 1) LLMs demonstrate preliminary abilities to act as recommendation assistants, 2) LLMs are better at handling queries with explicitly stated conditions, while facing challenges with queries that require reasoning or contain misleading information. Our dataset has been released at https://github.com/jiani-huang/RecBench.git.
1 The RecBench+ Benchmark
RecBench+ evaluates personalized recommendation assistants across condition-driven requests and profile-based preferences, using Amazon-Book and MovieLens-1M. Its query types distinguish explicit, implicit, and misinformed conditions from interest- and demographics-based requests.
1.1 Overview
- RecBench+ uses Amazon-Book and MovieLens-1M to evaluate condition-based and user profile-based recommendation queries.MovieLens-1M includes essential user demographic data.Source: §1.1 · p. 3, §1.1.1 · p. 3
1.1.1 Condition-based Query.
- Condition-based queries test constraint satisfaction through explicit conditions, implicit conditions requiring inference, and misinformed conditions containing errors.Explicit constraints are directly stated; implicit ones require multi-hop reasoning to infer the target condition.Source: §1.1.1 · p. 3
1.1.2 User Profile-based Query.
- User Profile-based queries assess personalization from interests or demographics rather than specific filtering conditions.Interests represent dynamic preferences, while demographics capture more stable attributes such as gender or occupation.Source: §1.1.2 · pp. 3–4
1.2 Condition-based Query Construction
Condition-based queries are constructed by linking item attributes in a knowledge graph to user interaction histories. Shared relations from those histories become explicit, implicit, or deliberately misinformed query conditions, which an LLM turns into natural-language queries.
1.2 Condition-based Query Construction
- Knowledge graphs connect items to attributes and interdependencies, supporting realistic, diverse condition-based queries from user behavior.The construction pipeline builds an item KG, extracts shared relations, then uses an LLM to simulate users and generate queries; qualifying items provide ground truth.Source: §1.2 · p. 4
1.2.1 Item KG Construction.
- Movie KGs use Wikipedia attributes, while book KGs use Amazon Book Dataset metadata; both are combined with recommendation datasets.The movie graph covers seven attributes, including directors, actors, composers, and genres.Source: §1.2.1 · p. 4
1.2.2 Shared Relation Extraction.
- KG retrieval finds subsets of a user’s history sharing attributes, represented as relation-type and target-value pairs that become query conditions.Examples include items sharing a director or actor.Source: §1.2.2 · p. 4
1.2.3 Query Generation.
- Explicit conditions use extracted relations directly, implicit conditions replace values with references to related items, and misinformed conditions add false relations before GPT-4o generates queries.For misinformed conditions, selected KG items do not actually have the specified relation to the target value.Source: §1.2.3 · p. 5
- Each generated sample pairs a query with interaction history excluding qualifying items and the ground-truth items that satisfy its conditions.Item attributes are represented in the KG.Source: §1.2.3 · p. 5
1.3 User Profile-based Query Construction
User Profile-based Query construction targets personalized recommendations from profile information without explicit filtering conditions, using interest- and demographics-based queries. The interest branch infers shared preferences from interaction histories, while the demographic branch uses group attributes and popular items.
1.3 User Profile-based Query Construction
- User Profile-based Queries generate personalized recommendations from profile information without requiring specific filtering conditions.They comprise Interest-based and Demographics-based queries.Source: §1.3 · p. 5
1.3.1 Interest-based Query.
- Interest-based queries use frequent consecutive item sequences and the sequences immediately preceding them in user histories to represent shared interests.An LLM analyzes these patterns to infer the reasoning behind common interests and generate queries reflecting item context and those interests.Source: §1.3.1 · p. 5
1.3.2 Demographics-based Query.
- Demographics-based queries group users by attribute permutations, identify their top-consumed items, and use an LLM to synthesize group-specific queries.The identified popular items serve as ground truth for evaluation.Source: §1.3.2 · pp. 5–6
1.4 Data Filtering and Selection
Data filtering uses string matching for Condition-based Queries and manual review for User Profile-based Queries.
- Condition-based queries are filtered out when string matching finds that the query omits provided information, such as an actor or director.Source: §1.4 · p. 6
- User Profile-based queries are manually checked, and those deemed too broad or unreasonable are removed.Source: §1.4 · p. 6
2 Experiments
The experiments evaluate widely used LLMs and fine-tuned smaller models on condition-based and user-profile queries, using recommendation-quality, condition-adherence, and failure-to-recommend metrics. Models generally handle explicit conditions better than implicit or misleading ones, while user-history and fine-tuning effects vary across query types.
2.1.1 Baselines.
- The evaluation includes GPT-4o, GPT-4o-mini, Llama, Gemini, Claude, DeepSeek-V3, and DeepSeek-R1, plus SFT and GRPO-based RFT of two smaller models.The main testing prompts do not specify a fixed number of recommendations; the evaluation uses Precision, Recall, CMR, and FTR.Source: §2.1.1 · p. 6, §2.1.2 · p. 6
2.2 Results on Condition-based Query
- GPT-4o achieves the highest Precision and second-highest CMR average, while DeepSeek-R1 leads Recall and performs best on implicit-condition queries; explicit queries are easier and misinformed queries hardest.Misinformed-condition queries have the lowest Recall and CMR, while higher FTR may indicate that models detect incorrect information and avoid inaccurate recommendations.Source: §2.2 · pp. 6–7
- More query conditions improve Precision and Recall, but CMR falls for explicit queries and rises for implicit and misinformed queries as added context affects constraint satisfaction differently.Additional conditions narrow the candidate pool; for explicit queries, however, satisfying all constraints becomes harder.Source: §2.2 · p. 7
- User-item history improves Precision across condition-query types, but may introduce distractors that reduce strict condition adherence.A history-based genre preference can prompt a recommendation that fails the query’s stated constraint.Source: §2.2 · p. 7
- With fixed K=5, performance still declines from explicit to implicit to misinformed condition queries; two-stage SFT+RFT reaches Recall 0.410 on movie explicit queries.That Recall exceeds SFT-only at 0.391 and RFT-only at 0.178; RFT alone performs worse than SFT, while SFT warm-up followed by RFT further improves performance.Source: §2.2 · pp. 7–8, Table 3 · p. 7
2.3 Results on User Profile-based Query
- For user-profile queries, demographic-based queries generally have lower Recall than interest-based queries, and models perform better on widely shared interests except for books.For books, popular titles can have more editions or publishers, making exact matches harder; less popular titles may have fewer variants.Source: §2.3 · p. 8
- Demographic-query performance varies by user group: models show higher accuracy for female users and higher Recall for ages 50–55 than for users aged 56 and above.The paper suggests older users may be harder to model because of less online activity and less training data.Source: §2.3 · p. 8
- All fine-tuned user-profile models outperform their base models, with SFT+RFT strongest overall and SFT close behind.For Qwen-2.5-3B demographics queries, RFT achieves Recall 0.228 versus SFT’s 0.154.Source: Table 6 · p. 8, §2.3 · p. 9
3 Related Work
Existing benchmarks evaluate traditional recommendation tasks, recommendation-specific behaviors, and general or domain-specific assistant capabilities. RecBench+ addresses the remaining gap of evaluating LLMs as personalized recommendation assistants.
3 Related Work
- Traditional benchmarks such as LLMRec [18] evaluate rating prediction and sequential recommendation, comparing LLMs with classical methods.Other recommendation benchmarks assess utility, novelty, history-length sensitivity, hallucination [13], or personalization accuracy [29].Source: §3 · p. 9
- Assistant benchmarks include general-purpose Gaia [20] and domain-specific VoiceBench [5] and Mobile-Bench [3].The paper identifies evaluation of personalized recommendation assistants as a remaining gap.Source: §3 · p. 9
4 Conclusion
The paper introduces RecBench+ to evaluate LLMs as personalized recommendation assistants and reports experiments and observations on their capabilities. It also explores fine-tuning strategies for recommendation performance.
4 Conclusion
- RecBench+ is a benchmark dataset for evaluating LLMs as personalized recommendation assistants.The paper frames it as a new paradigm for next-generation recommender systems.Source: §4 · p. 9
- The benchmark contains five query types designed to assess handling of complex user queries in real-world scenarios.Source: §4 · p. 9
- Experiments with diverse LLMs, including models with advanced reasoning capabilities, yield 11 observations about assistants’ strengths and limitations.Source: §4 · p. 9
- The paper also explores the impact of different fine-tuning strategies on recommendation performance.Source: §4 · p. 9
A Prompts for Model Testing
The testing prompts ask models to recommend items directly from a user query, with an alternate version that incorporates interaction history and preferences.
A Prompts for Model Testing
- Without interaction history, the prompt asks the model to recommend movies directly from the user's query.Source: A Prompts for Model Testing · p. 9
- With interaction history, the prompt includes watched movies or reading history and asks for recommendations satisfying both the query and user preferences.Source: A Prompts for Model Testing · p. 9
- The history-based prompt is phrased for movies or books, while the no-history prompt is shown for movies.Source: A Prompts for Model Testing · p. 9
B Case Study
A case study contrasts DeepSeek-V3 and DeepSeek-R1 on a query seeking films with the same cinematographer as two named films. The models differ in how they handle the mistaken cinematographer attribution.
B Case Study
- DeepSeek-R1 verifies the cinematographer, identifies Owen Roizman, and gives accurate recommendations, while DeepSeek-V3 incorrectly lists films by Scott Ambrozy.The example query asks for movies sharing the cinematographer of two given films.Source: B Case Study · p. 9
Ethical Considerations
The authors report using an LLM and public recommendation datasets to generate queries, then having human annotators check all dataset data for harmful content. They state that the dataset poses no potential harm to human society.
Ethical Considerations
- Human annotators checked all dataset data for harmful content; the authors state that the dataset poses no potential harm to human society.The dataset was generated using an LLM and public recommendation datasets.Source: Ethical Considerations · p. 10
Related papers
This paper cites
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning2025
- Gemini: A Family of Highly Capable Multimodal Models2023
- DeepSeek-V3 Technical Report2024
- Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context2024
- LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation2020