Sign inGet started
Paper · arXiv

Subgraph Filtering for Fair Graph Neural Networks

Graph neural networks (GNNs) can exhibit unfair behavior even when sensitive attributes are excluded from node features, because graph topology and message passing propagate group-correlated signals under sensitive homophily. Existing fairness-aware GNN methods mainly constrain representations or prediction distributions at a global level, without explicitly controlling the local structural pathways through which biased information propagates during aggregation. We propose Subgraph Filtering for Fair Graph Neural Networks (SF-GNN), a lightweight and architecture-agnostic framework that mitigates structural bias at its source. SF-GNN identifies bias-prone edges by combining sensitive homop...

AuthorsHaohui Lu, jiyuan Tian, Fangyu Zhou et al.
Primary categorycs.LG
Published26 August 2026
Last updated at source26 August 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/a6726716-d60a-4f10-b638-354bb00e08fa" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.