挑战链接预测公平性旧范式,提出更精准的评估与纠偏方法
Breaking the Dyadic Barrier: Rethinking Fairness in Link Prediction Beyond Demographic Parity
- 突破传统成对公平性框架,改用更细致的子群体分析
- 新方法在保持预测性能前提下显著降低偏差,优于现有最先进模型
- 适合关注算法公平性的研究者与工业界应用开发者
链接预测是图机器学习中的基础任务,广泛应用于社交推荐和知识图谱补全。在该任务中,公平性至关重要,因为偏差预测可能加剧社会不平等。以往工作采用成对公平性定义,通过组内与组间链接预测的群体均等来实现公平性。然而我们发现,这种成对框架可能掩盖子群体间的深层差异,使系统性偏见难以被察觉。此外,我们认为群体均等并不适用于链接预测这类排序任务的公平性评估。本文形式化了现有公平性评估的局限性,并提出一个更具表达力的评估框架。同时,我们设计了一种轻量级后处理方法,结合解耦链接预测器,有效缓解偏差,实现了当前最优的公平性-效用权衡。
原文摘要 · Abstract (English)
Link prediction is a fundamental task in graph machine learning with applications, ranging from social recommendation to knowledge graph completion. Fairness in this setting is critical, as biased predictions can exacerbate societal inequalities. Prior work adopts a dyadic definition of fairness, enforcing fairness through demographic parity between intra-group and inter-group link predictions. However, we show that this dyadic framing can obscure underlying disparities across subgroups, allowing systemic biases to go undetected. Moreover, we argue that demographic parity does not meet desired properties for fairness assessment in ranking-based tasks such as link prediction. We formalize the limitations of existing fairness evaluations and propose a framework that enables a more expressive assessment. Additionally, we propose a lightweight post-processing method combined with decoupled link predictors that effectively mitigates bias and achieves state-of-the-art fairness-utility trade-offs.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。