通过动态图对比学习提升推荐系统公平性,避免依赖不切实际的假设。
FairDgcl: Fairness-aware Recommendation with Dynamic Graph Contrastive Learning
- 设计对抗式对比网络,自动生成公平的数据增强策略。
- 提出可学习的动态模型,自动优化增强方案以平衡不同用户群体。
- 理论证明方法同时提升公平性与准确率,适合注重公平性的推荐场景。
随着可信AI的发展,推荐系统中的公平性问题日益受到关注。当推荐系统根据用户敏感属性(如年龄、性别)对不同用户群体产生不平等结果时,即被认为不公平。现有基于数据增强的方法虽能缓解用户层面的不公平,但常依赖与现实不符的公平性假设,可能降低数据质量并影响模型性能。为此,本文提出FairDgcl,一种基于动态图对抗对比学习的公平推荐框架。该框架通过对抗式对比网络(包含视图生成器与视图判别器)学习生成公平的数据增强策略;进一步设计两个动态可学习模型,在对比学习中自动调整增强策略。理论上证明,FairDgcl可同时生成兼具公平性与准确性的增强表示。在四个真实数据集上的全面实验验证了其有效性。
原文摘要 · Abstract (English)
As trustworthy AI continues to advance, the fairness issue in recommendations has received increasing attention. A recommender system is considered unfair when it produces unequal outcomes for different user groups based on user-sensitive attributes (e.g., age, gender). Some researchers have proposed data augmentation-based methods aiming at alleviating user-level unfairness by altering the skewed distribution of training data among various user groups. Despite yielding promising results, they often rely on fairness-related assumptions that may not align with reality, potentially reducing the data quality and negatively affecting model effectiveness. To tackle this issue, in this paper, we study how to implement high-quality data augmentation to improve recommendation fairness. Specifically, we propose FairDgcl, a dynamic graph adversarial contrastive learning framework aiming at improving fairness in recommender system. First, FairDgcl develops an adversarial contrastive network with a view generator and a view discriminator to learn generating fair augmentation strategies in an adversarial style. Then, we propose two dynamic, learnable models to generate contrastive views within contrastive learning framework, which automatically fine-tune the augmentation strategies. Meanwhile, we theoretically show that FairDgcl can simultaneously generate enhanced representations that possess both fairness and accuracy. Lastly, comprehensive experiments conducted on four real-world datasets demonstrate the effectiveness of the proposed FairDgcl.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。