Preference Diffusion for Recommendation
Shuo Liu, An Zhang, Guoqing Hu, Hong Qian, Tat-seng Chua

TL;DR
PreferDiff introduces a novel personalized ranking objective for diffusion model-based recommenders, improving ranking accuracy, convergence speed, and preference alignment through a tailored generative approach.
Contribution
It is the first to design a personalized ranking loss specifically for diffusion model recommenders, enhancing their performance and stability.
Findings
Superior recommendation performance across three benchmarks.
Faster convergence compared to traditional methods.
Effective preference alignment via generative modeling.
Abstract
Recommender systems predict personalized item rankings based on user preference distributions derived from historical behavior data. Recently, diffusion models (DMs) have gained attention in recommendation for their ability to model complex distributions, yet current DM-based recommenders often rely on traditional objectives like mean squared error (MSE) or recommendation objectives, which are not optimized for personalized ranking tasks or fail to fully leverage DM's generative potential. To address this, we propose PreferDiff, a tailored optimization objective for DM-based recommenders. PreferDiff transforms BPR into a log-likelihood ranking objective and integrates multiple negative samples to better capture user preferences. Specifically, we employ variational inference to handle the intractability through minimizing the variational upper bound and replaces MSE with cosine error to…
Peer Reviews
Decision·ICLR 2025 Poster
+ The intuition of incorporating ranking loss into the DM recommender makes sense. The development of the proposed method looks reasonable and (to my knowledge) correct. + The paper is clearly presented and easy to follow. + Experiments and ablation studies are mostly solid.
- There is essentially only 1 data set being used (amazon review), no matter how many categories you include, this data set may not be representative enough which may raise concerns regarding the generalizability of your findings - Some of the questions remain unanswered (or observations without explanation) , e.g,: 1) what caused PreferDiff to be faster than DreamRec? 2) why diffusion models are more sensitive to d_model? - Novelty seems to be minimum, the overall approach makes sense but is
- Innovative Objective Design: PreferDiff introduces a log-likelihood ranking objective tailored to diffusion models, marking a significant advancement in personalized ranking for DM-based recommenders. - Comprehensive Negative Sampling: The incorporation of multiple negative samples enhances user preference understanding, leading to better separation between positive and negative items and improved recommendation performance. - Effective Performance and Convergence: PreferDiff demonstrates sup
1.Limited Originality: The formulation of PreferDiff shows considerable overlap with Direct Preference Optimization (DPO), as several of its mathematical expressions and objective functions appear directly inspired or derived from DPO's original framework. This raises concerns about the novelty of PreferDiff's contribution to preference learning within diffusion models, as the paper does not introduce substantial modifications or unique approaches that deviate meaningfully from DPO's foundation
1. The paper is well-written and easy to follow. It is well-structured and provides a detailed description of the experimental setup, which will aid the community in reimplementation. 2. The authors conducted experiments under various settings to validate the effectiveness of their method.
1. The evaluation difference between the full-ranking approach and the leave-one-out method is not clearly described. There is no mention of a full-ranking approach in [1]. The 'leave-one-out' evaluation setting is the most mainstream approach. The authors need to provide a justification for using the full-ranking manner as the primary evaluation setting in the main text. Additionally, do these two evaluation methods affect the ranking of different approaches? 2. Performance of other recommender
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques
MethodsSoftmax · Attention Is All You Need · Variational Inference · Diffusion · ALIGN
