用离散扩散模型动态调整用户偏好比例,提升推荐系统表现。
Fading to Grow: Growing Preference Ratios via Preference Fading Discrete Diffusion for Recommendation
- 基于离散扩散建模物品间偏好比率,更贴合推荐任务特性。
- 通过逐步弱化偏好来模拟噪声,无需预设连续噪声分布。
- 在五个数据集上优于现有方法,理论与实证兼具。
推荐系统旨在根据用户兴趣对离散物品集合进行排序,但面临用户偏好数据极度稀疏的问题。近期扩散模型的进展启发了基于扩散的推荐方法,通过前向过程注入噪声以缓解扰动后偏好分布的坍塌。然而,现有方法主要依赖连续高斯噪声,与推荐中离散的偏好数据本质不匹配。本文基于离散扩散的最新进展,提出 PreferGrow——一种基于离散扩散的推荐系统,通过在离散物品集合上渐进地弱化和增强用户偏好来建模偏好比率。其核心创新在于:(1)离散偏好比率建模:直接建模物品对间的相对偏好比率,而非在物品表征或原始得分单纯形上操作,更契合推荐的离散与排序特性;(2)偏好弱化扰动:通过将优选物品替换为其他选项(类比负采样)实现偏好衰减,无需任何先验噪声假设;(3)偏好重建生长:通过迭代从估计比率中恢复偏好信号。PreferGrow 提供了具有马尔可夫性与可逆性理论保证的矩阵化形式,在五个基准数据集上持续超越当前最优扩散推荐方法,体现其理论严谨性与实际有效性。
原文摘要 · Abstract (English)
Recommenders aim to rank items from a discrete item corpus in line with user interests, yet suffer from extremely sparse user preference data. Recent advances in diffusion models have inspired diffusion-based recommenders, which alleviate sparsity by injecting noise during a forward process to prevent the collapse of perturbed preference distributions. However, current diffusion-based recommenders predominantly rely on continuous Gaussian noise, which is intrinsically mismatched with the discrete nature of user preference data in recommendation. In this paper, building upon recent advances in discrete diffusion, we propose PreferGrow, a discrete diffusion-based recommender system that models preference ratios by fading and growing user preferences over the discrete item corpus. PreferGrow differs from existing diffusion-based recommenders in three core aspects: (1) Discrete modeling of preference ratios: PreferGrow models relative preference ratios between item pairs, rather than operating in the item representation or raw score simplex. This formulation aligns naturally with the discrete and ranking-oriented nature of recommendation tasks. (2) Perturbing via preference fading: Instead of injecting continuous noise, PreferGrow fades user preferences by replacing the preferred item with alternatives -- physically akin to negative sampling -- thereby eliminating the need for any prior noise assumption. (3) Preference reconstruction via growing: PreferGrow reconstructs user preferences by iteratively growing the preference signals from the estimated ratios. PreferGrow offers a well-defined matrix-based formulation with theoretical guarantees on Markovianity and reversibility, and it demonstrates consistent performance gains over state-of-the-art diffusion-based recommenders across five benchmark datasets, highlighting both its theoretical soundness and empirical effectiveness.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。