arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.14432cs.LGeess.SP

公平性感知的最优图滤波器设计

Fairness-aware Optimal Graph Filter Design

University of California Irvine(加州大学欧文分校);University of Rochester(罗切斯特大学)

O. Deniz Kose, Yanning Shen, Gonzalo Mateos

AI总结:

本文针对基于图的机器学习中的偏见放大问题,提出在ML管道中引入预设计的图滤波器,通过将其最优设计转化为图谱域中的凸问题或线性规划问题来最小化敏感属性与图连通性间的相关性,在保持效用的同时显著提升了公平性。

摘要:

图是可用于表示复杂现实世界互联系统(如金融市场和社交网络)的数学工具。因此,基于图的机器学习(ML)近来引起了广泛关注。然而,已有研究表明,由于在带有偏见的图结构上进行信息聚合,基于图的ML在各种决策问题中放大了对某些代表性不足群体的既有偏见。面对这一挑战,本文通过借鉴图信号处理的见解,重新审视基于图学习中的偏见缓解问题。我们的想法是在ML管道中引入预先设计的图滤波器,以减少一种新颖的无监督偏见度量,即敏感属性与底层图连通性之间的相关性。我们证明,所述滤波器的最优设计可被转化为图谱域中的凸问题。我们还基于理论偏见分析提出了一个线性规划(LP)问题,该问题能获得闭式解,并得到一种高效的公平性感知图滤波器。最后,对于自由度与输入图大小无关的设计,我们在多项式图卷积滤波器族上最小化该偏见度量。我们的最优滤波器设计提供了互补的优势,以探索有利的公平性-效用-复杂性权衡。在性能评估方面,我们在真实世界网络上进行了广泛且可复现的节点分类实验。结果表明,与最先进的公平性感知基线相比,所提出的框架在获得相似效用的同时,实现了更好的公平性度量。

英文摘要:

Graphs are mathematical tools that can be used to represent complex real-world interconnected systems, such as financial markets and social networks. Hence, machine learning (ML) over graphs has attracted significant attention recently. However, it has been demonstrated that ML over graphs amplifies the already existing bias towards certain under-represented groups in various decision-making problems due to the information aggregation over biased graph structures. Faced with this challenge, here we take a fresh look at the problem of bias mitigation in graph-based learning by borrowing insights from graph signal processing. Our idea is to introduce predesigned graph filters within an ML pipeline to reduce a novel unsupervised bias measure, namely the correlation between sensitive attributes and the underlying graph connectivity. We show that the optimal design of said filters can be cast as a convex problem in the graph spectral domain. We also formulate a linear programming (LP) problem informed by a theoretical bias analysis, which attains a closed-form solution and leads to a more efficient fairness-aware graph filter. Finally, for a design whose degrees of freedom are independent of the input graph size, we minimize the bias metric over the family of polynomial graph convolutional filters. Our optimal filter designs offer complementary strengths to explore favorable fairness-utility-complexity tradeoffs. For performance evaluation, we conduct extensive and reproducible node classification experiments over real-world networks. Our results show that the proposed framework leads to better fairness measures together with similar utility compared to state-of-the-art fairness-aware baselines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑