Towards a Unified Framework for Fair and Stable Graph Representation Learning
원문 초록
As the representations output by Graph Neural Networks (GNNs) are increasingly employed in real-world applications, it becomes important to ensure that these representations are fair and stable. In this work, we establish a key connection between counterfactual fairness and stability and leverage it to propose a novel framework, NIFTY (uNIfying Fairness and stabiliTY), which can be used with any GNN to learn fair and stable representations. We introduce a novel objective function that simultaneously accounts for fairness and stability and develop a layer-wise weight normalization using the Lipschitz constant to enhance neural message passing in GNNs. In doing so, we enforce fairness and stability both in the objective function as well as in the GNN architecture. Further, we show theoretically that our layer-wise weight normalization promotes counterfactual fairness and stability in the resulting representations. We introduce three new graph datasets comprising of high-stakes decisions in criminal justice and financial lending domains. Extensive experimentation with the above datasets demonstrates the efficacy of our framework.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Diffusion Counterfactual Generation with Semantic Abduction
Positional Encoding meets Persistent Homology on Graphs
Permutation Equivariant Neural Controlled Differential Equations for Dynamic Graph Representation Learning
Quantifying Fairness in LLMs Beyond Tokens: A Semantic and Statistical Perspective
Towards Fairness Assessment of Dutch Hate Speech Detection
Wasserstein Hypergraph Neural Network
토론
이 논문과 연결된 포럼 글이 아직 없습니다.