FAROS: Fair Graph Generation via Attribute Switching Mechanisms
Abdennacer Badaoui, Oussama Kharouiche, Hatim Mrabet, Daniele Malitesta, Fragkiskos D. Malliaros

TL;DR
FAROS introduces a novel method for fair graph generation by dynamically switching node attributes during the diffusion process, effectively balancing fairness and accuracy without retraining the model.
Contribution
The paper presents FAROS, a new framework that enforces fairness in graph generation through attribute switching during diffusion, avoiding retraining and improving fairness-accuracy trade-offs.
Findings
Reduces fairness discrepancies in generated graphs.
Maintains or improves accuracy compared to baselines.
Achieves better fairness-accuracy trade-offs under Pareto optimality.
Abstract
Recent advancements in graph diffusion models (GDMs) have enabled the synthesis of realistic network structures, yet ensuring fairness in the generated data remains a critical challenge. Existing solutions attempt to mitigate bias by re-training the GDMs with ad-hoc fairness constraints. Conversely, with this work, we propose FAROS, a novel FAir graph geneRatiOn framework leveraging attribute Switching mechanisms and directly running in the generation process of the pre-trained GDM. Technically, our approach works by altering nodes' sensitive attributes during the generation. To this end, FAROS calculates the optimal fraction of switching nodes, and selects the diffusion step to perform the switch by setting tailored multi-criteria constraints to preserve the node-topology profile from the original distribution (a proxy for accuracy) while ensuring the edge independence on the sensitive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
