arXiv AI

Neutralizing Popularity Bias in LLM-based Recommendation via Counterfactual Reasoning Guidelines

The paper introduces NPRec, a model‑agnostic framework that uses counterfactual reasoning to neutralize popularity bias in large language model–based recommender systems. By generating debiased textual guidelines that separate intrinsic user interests from popularity signals, NPRec injects these guidelines at inference time to guide the LLM’s generation without updating parameters. Experiments on three real‑world datasets show improved recommendation accuracy, explanation quality, and debiasing performance.

arXiv AI
Oct 5

Reasoning with Evidence, Not Merely Rationales: Verifiable Preference Proofs for LLM-Based Recommendation

The paper introduces PROVE-REC, a two‑pass framework that generates verifiable preference proofs for large language model (LLM) recommendation systems. In Pass A, the model condenses user interaction histories into a compact proof of positive and avoidance claims linked to specific evidence entries. Pass B then uses only this proof and its evidence to predict the next item, ensuring the recommendation follows the reasoning path. Verification steps compare masked evidence and removed claims to confirm grounding and influence, while a ranking‑preservation objective retains useful historical information. Experiments on diverse real‑world datasets show PROVE‑REC outperforms strong baselines by up to 7.45%, producing claims that are both better grounded and more influential to recommendation quality.

By Yu Hou, Nathaniel Kang, Pengkai Wang, Hua Li
arXiv AI
Sep 25

Learning Better Reasoning for Generative Recommendation with Semantic IDs

The paper introduces Evo-Rec, a three‑stage framework that improves generative recommendation by learning better reasoning traces for Semantic ID (SID) generation. It first aligns SIDs with textual and behavioral contexts, then selects candidate reasoning traces that improve ground‑truth item prediction, and finally refines the reasoning policy via reinforcement learning with catalog‑constrained generation and ranking‑aware feedback. Experiments on Amazon Review datasets show Evo‑Rec consistently outperforms existing discriminative, generative, and reasoning‑enhanced recommenders across all metrics.

By Mengdan Zhu, Yufan Zhao, Sophie Di, Yao Zhao, Tao Di, Yulan Yan, Sridhar Iyer, Liang Zhao
Hugging Face Trending Papers
Sep 24

Learning Better Reasoning for Generative Recommendation with Semantic IDs

The paper introduces Evo-Rec, a three‑stage framework that improves generative recommendation by learning better reasoning traces for Semantic ID (SID) generation. First, it aligns SIDs with textual and behavioral contexts; second, it samples and selects reasoning traces that improve ground‑truth item prediction via supervised fine‑tuning; third, it refines the reasoning policy with reinforcement learning using catalog‑constrained generation and ranking‑aware feedback. Experiments on three Amazon Review datasets show Evo‑Rec consistently outperforms discriminative, generative, and other reasoning‑enhanced recommenders across all metrics.

arXiv AI
Sep 2

RPCBench: A Benchmark for Proactive Premise Critique in LLM-based Recommendation

RPCBench is a new benchmark designed to evaluate large language models’ ability to critique recommendation requests by detecting, diagnosing, and handling flawed premises. It includes evidence‑grounded test instances across five recommendation domains and ten types of premise failures, and introduces a fine‑grained evaluation framework covering detection, error localization, handling strategy, and evidence faithfulness. Experiments with 11 LLMs reveal that proactive detection is the main bottleneck, with models struggling most on underspecified‑premise errors and showing that optimal critique quality occurs at intermediate reasoning lengths.

By Zhongru Chen, Yuan Wu, Yi Chang
arXiv AI
Aug 18

Ask to Be Sure: Informative Interactions for Confident Multi-Turn LLM Recommendation

arXiv:2608. 15949v1 Announce Type: cross Abstract: Recent advances in large language models (LLMs) have enabled their use as conversational recommender systems (CRS), demonstrating strong recommendation accuracy and natural dialogue.

By Cedar Site Bai, Duanshun Li, Zhenyu Liao, Sheikh Sarwar, Huiyuan Chen, Yuan Chen, Changhe Yuan, Haiyang Zhang, Qilin Qi
Hugging Face Trending Papers
Sep 17

Reproducing Transparent and Scrutable Recommendations: Exploring Open-Weight Models via Natural-Language User Profiles

The study reproduces a prior work on recommender systems that use generated natural‑language user profiles to enhance transparency and user control. It confirms that the User Profile Recommendation (UPR) model performs competitively and that altering these profiles uniformly shifts predicted ratings without changing ranking order. Additional experiments include context ablation, multi‑seed stability, and mechanistic interpretability analysis with the nnsight framework.

Hugging Face Trending Papers
Jul 22

Personalized Recommendation Tool Learning via Autonomous Language Agents

Although large language models (LLMs) have recently gained traction in recommender systems due to their strong reasoning capabilities and extensive world knowledge, previous LLM-based agents suffer from hallucination and context-length limitations, and thus are not suitable for full-ranking recommendation tasks. To circumvent these limitations through architectural design rather than modifying the LLM itself, we propose an agent-based recommendation framework, memory-based $\textbf{P}$ersonalized $\textbf{R}$ecommendation $\textbf{T}$ool learning via autonomous language $\textbf{A}$gents (PRTA), in which an LLM acts as a central planner interacting with multiple recommendation models as tools.

arXiv AI
Sep 18

Reproducing Transparent and Scrutable Recommendations: Exploring Open-Weight Models via Natural-Language User Profiles

This reproducibility study confirms that incorporating generated natural‑language user profiles into recommender systems enhances transparency and allows users to directly intervene by correcting preferences or addressing cold‑start issues. The authors replicated the original findings and extended the evaluation with context ablation, multi‑seed stability tests, and mechanistic interpretability analysis using nnsight. Their results show that while perturbing profiles shifts predicted ratings uniformly across genres, the overall rankings remain unchanged, attributing this to the rating‑regression objective rather than the profile interface.

By Noah Mami\'e, Laurin van den Bergh
arXiv AI
Oct 28

Counterfactual Profile Perturbations for Recommendation Explanations: A Reproducibility Study

This reproducibility study investigates the counterfactual explanation method Learning to eXplain Recommendations (LXR) by extending its application beyond the top‑ranked item to other recommended items. The authors compare LXR against alternative baselines such as item popularity and latent factor similarity, noting that these baselines perform surprisingly well on certain tasks. They also analyze how item popularity affects explanation quality, finding that LXR produces shorter perturbations for less popular items, and conduct a brute‑force search to estimate a lower bound on optimal perturbation size.

By Meysam Varasteh, Elizabeth McKinnie, Robin Burke
arXiv Computation and Language
Oct 15

AdaptFuse: Training-Free Sequential Preference Inference via Externalized Bayesian Computation

arXiv:2604.03925v2 Announce Type: replace Abstract: Large language models (LLMs) struggle to accumulate evidence across multiple rounds of user interactions, failing to update their beliefs in a mann...

By Fangzhou Lin, Zilin Dai, Shuo Xing, Peiran Li, Siyuan Yang, Qianwen Ge, Kazunori Yamada, Yang Zhou, Ziming Zhang, Haichong Zhang, Zhengzhong Tu
arXiv Machine Learning
Jul 14

RecRec: Recursive Refinement for Sequential Recommendation

arXiv:2607. 10541v1 Announce Type: cross Abstract: Sequential recommender systems typically infer user preferences through single-pass encoding of interaction histories without iterative refinement, relying on increasingly deep architectures to capture complex patterns.

By Pervez Shaik, Prosenjit Biswas, Abhinav Thorat, Ravi Kolla, Niranjan Pedanekar