arXiv Machine Learning By Arturo P\'erez-Peralta, Sandra Ben\'itez-Pe\~na, Blas Kolic, Rosa E. Lillo

Geometrical fairness in graph neural networks

Read the original on arXiv Machine Learning →

arXiv:2606. 17684v1 Announce Type: cross Abstract: Graph-based learning methods have become increasingly prominent due to their strong performance across diverse applications.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 28

Subgraph Filtering for Fair Graph Neural Networks

Subgraph Filtering for Fair Graph Neural Networks (SF‑GNN) is a lightweight, architecture‑agnostic framework that reduces structural bias in GNNs by identifying and filtering bias‑prone edges during message passing. It combines sensitive homophily with structural propagation amplifiers such as hub participation and triadic closure to detect problematic edges, then applies stochastic edge filtering to downweight or remove them while preserving the rest of the graph. Experiments on five benchmark datasets demonstrate that SF‑GNN consistently improves fairness while maintaining competitive predictive performance, achieving a better fairness–accuracy trade‑off than recent fairness‑aware GNN baselines.

By Haohui Lu, jiyuan Tian, Fangyu Zhou, Shahadat Uddin