解决生成式推荐中的热门物品偏见问题
CRAB: Codebook Rebalancing for Bias Mitigation in Generative Recommendation
- 通过重新平衡语义编码本,缓解热门项过度聚集问题
- 在真实数据集上显著提升冷门物品推荐效果
- 适合关注推荐公平性与多样性研究的学者
生成式推荐(GeneRec)将物品表示为离散语义标记,并以生成方式预测物品。尽管其在多个推荐任务中表现优异,但现有方法仍存在严重的流行度偏见,甚至可能加剧该问题。本文通过系统实证分析揭示两大根源:1)不平衡的标记化会继承并放大历史交互中的流行度偏见;2)当前训练过程过度偏向热门标记,忽视标记间的语义关联,从而强化偏见。基于此,我们提出后处理去偏策略CRAB,通过拆分过热标记并保持其层级语义结构,实现编码本重平衡。在此基础上,引入树形正则化项,增强语义一致性,使冷门标记在训练中获得更丰富的表征。在真实数据集上的实验表明,CRAB能有效缓解流行度偏见,显著提升推荐性能。
原文摘要 · Abstract (English)
Generative recommendation (GeneRec) has introduced a new paradigm that represents items as discrete semantic tokens and predicts items in a generative manner. Despite its strong performance across multiple recommendation tasks, existing GeneRec approaches still suffer from severe popularity bias and may even exacerbate it. In this work, we conduct a comprehensive empirical analysis to uncover the root causes of this phenomenon, yielding two core insights: 1) imbalanced tokenization inherits and can further amplify popularity bias from historical item interactions; 2) current training procedures disproportionately favor popular tokens while neglecting semantic relationships among tokens, thereby intensifying popularity bias. Building on these insights, we propose CRAB, a post-hoc debiasing strategy for GeneRec that alleviates popularity bias by mitigating frequency imbalance among semantic tokens. Specifically, given a well-trained model, we first rebalance the codebook by splitting over-popular tokens while preserving their hierarchical semantic structure. Based on the adjusted codebook, we further introduce a tree-structured regularizer to enhance semantic consistency, encouraging more informative representations for unpopular tokens during training. Experiments on real-world datasets demonstrate that CRAB significantly improves recommendation performance by effectively alleviating popularity bias.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。