Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fairness-aware Message Passing for Graph Neural Networks (2306.11132v1)

Published 19 Jun 2023 in cs.LG

Abstract: Graph Neural Networks (GNNs) have shown great power in various domains. However, their predictions may inherit societal biases on sensitive attributes, limiting their adoption in real-world applications. Although many efforts have been taken for fair GNNs, most existing works just adopt widely used fairness techniques in machine learning to graph domains and ignore or don't have a thorough understanding of the message passing mechanism with fairness constraints, which is a distinctive feature of GNNs. To fill the gap, we propose a novel fairness-aware message passing framework GMMD, which is derived from an optimization problem that considers both graph smoothness and representation fairness. GMMD can be intuitively interpreted as encouraging a node to aggregate representations of other nodes from different sensitive groups while subtracting representations of other nodes from the same sensitive group, resulting in fair representations. We also provide a theoretical analysis to justify that GMMD can guarantee fairness, which leads to a simpler and theory-guided variant GMMD-S. Extensive experiments on graph benchmarks show that our proposed framework can significantly improve the fairness of various backbone GNN models while maintaining high accuracy.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. Graph neural networks for social recommendation. In The world wide web conference, pages 417–426, 2019.
  2. Graph convolutional neural networks for web-scale recommender systems. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pages 974–983, 2018.
  3. Inductive representation learning on large graphs. Advances in neural information processing systems, 30, 2017.
  4. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016.
  5. Knowledge transfer for out-of-knowledge-base entities: A graph neural network approach. arXiv preprint arXiv:1706.05674, 2017.
  6. Cross-lingual knowledge graph alignment via graph convolutional networks. In Proceedings of the 2018 conference on empirical methods in natural language processing, pages 349–357, 2018.
  7. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997, 2018.
  8. Towards deeper graph neural networks. In Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pages 338–348, 2020.
  9. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining, pages 680–688, 2021.
  10. Edits: Modeling and mitigating data bias for graph neural networks. In Proceedings of the ACM Web Conference 2022, pages 1259–1269, 2022.
  11. Improving fairness in graph neural networks via mitigating sensitive attribute leakage. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 1938–1948, 2022.
  12. Ensuring fairness in machine learning to advance health equity. Annals of internal medicine, 169(12):866–872, 2018.
  13. Certifying and removing disparate impact. In proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, pages 259–268, 2015.
  14. A survey on bias and fairness in machine learning. ACM Computing Surveys (CSUR), 54(6):1–35, 2021.
  15. Learning fair graph representations via automated data augmentations. In The Eleventh International Conference on Learning Representations, 2023.
  16. Compositional fairness constraints for graph embeddings. In International Conference on Machine Learning, pages 715–724. PMLR, 2019.
  17. Fair node representation learning via adaptive data augmentation. arXiv preprint arXiv:2201.08549, 2022.
  18. Neural message passing for quantum chemistry. In International conference on machine learning, pages 1263–1272. PMLR, 2017.
  19. A unified view on graph neural networks as graph signal denoising. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pages 1202–1211, 2021.
  20. A unified framework for convolution-based graph neural networks. 2020.
  21. Interpreting and unifying graph neural networks with an optimization framework. In Proceedings of the Web Conference 2021, pages 1215–1226, 2021.
  22. Graph unrolling networks: Interpretable neural networks for graph signal denoising. IEEE Transactions on Signal Processing, 69:3699–3713, 2021.
  23. Implicit graph neural networks. Advances in Neural Information Processing Systems, 33:11984–11995, 2020.
  24. Understanding graph neural networks from graph signal denoising perspectives. arXiv preprint arXiv:2006.04386, 2020.
  25. The graph neural network model. IEEE transactions on neural networks, 20(1):61–80, 2008.
  26. Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203, 2013.
  27. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems, 29, 2016.
  28. Bernnet: Learning arbitrary graph spectral filters via bernstein approximation. Advances in Neural Information Processing Systems, 34:14239–14251, 2021.
  29. A new perspective on the effects of spectrum in graph neural networks. In International Conference on Machine Learning, pages 25261–25279. PMLR, 2022.
  30. How powerful are spectral graph neural networks. In International Conference on Machine Learning, pages 23341–23362. PMLR, 2022.
  31. Convolutional neural networks on graphs with chebyshev approximation, revisited. arXiv preprint arXiv:2202.03580, 2022.
  32. Graph attention networks. arXiv preprint arXiv:1710.10903, 2017.
  33. A comprehensive survey on trustworthy graph neural networks: Privacy, robustness, fairness, and explainability. arXiv preprint arXiv:2204.08570, 2022.
  34. Fairwalk: towards fair graph embedding. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, pages 3289–3295, 2019.
  35. Subgroup generalization and fairness of graph neural networks. Advances in Neural Information Processing Systems, 34:1048–1061, 2021.
  36. Individual fairness for graph neural networks: A ranking based approach. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pages 300–310, 2021.
  37. On dyadic fairness: Exploring and mitigating bias in graph connections. In International Conference on Learning Representations, 2021.
  38. Fairnorm: Fair and fast graph neural network training. arXiv preprint arXiv:2205.09977, 2022.
  39. Towards a unified framework for fair and stable graph representation learning. In Uncertainty in Artificial Intelligence, pages 2114–2124. PMLR, 2021.
  40. Fmp: Toward fair graph message passing against topology bias. arXiv preprint arXiv:2202.04187, 2022.
  41. Topology matters in fair graph learning: a theoretical pilot study. 2023.
  42. A kernel method for the two-sample-problem. Advances in neural information processing systems, 19, 2006.
  43. Injective hilbert space embeddings of probability measures. In 21st Annual Conference on Learning Theory (COLT 2008), pages 111–122. Omnipress, 2008.
  44. The variational fair autoencoder. arXiv preprint arXiv:1511.00830, 2015.
  45. Exploiting mmd and sinkhorn divergences for fair and transferable representation learning. Advances in Neural Information Processing Systems, 33:15360–15370, 2020.
  46. Recycling privileged learning and distribution matching for fairness. Advances in neural information processing systems, 30, 2017.
  47. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018.
  48. Fairness definitions explained. In Proceedings of the international workshop on software fairness, pages 1–7, 2018.
  49. Learning adversarially fair and transferable representations. In International Conference on Machine Learning, pages 3384–3393. PMLR, 2018.
  50. Beyond homophily in graph neural networks: Current limitations and effective designs. NeurIPS, pages 7793–7804, 2020.
  51. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Huaisheng Zhu (13 papers)
  2. Guoji Fu (14 papers)
  3. Zhimeng Guo (9 papers)
  4. Zhiwei Zhang (76 papers)
  5. Teng Xiao (40 papers)
  6. Suhang Wang (118 papers)
Citations (6)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now