FairGC: Fairness-aware Graph Condensation

• URL: http://arxiv.org/abs/2603.28321v1
• Date: Mon, 30 Mar 2026 11:46:05 GMT
• Title: FairGC: Fairness-aware Graph Condensation
• Abstract summary: We introduce FairGC, a unified framework that embeds fairness directly into the graph distillation process.<n>We show that FairGC provides a superior balance between accuracy and fairness.<n>Our results confirm that FairGC significantly reduces disparity in Statistical Parity and Equal Opportunity.
• Score: 11.416044011065017
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph condensation (GC) has become a vital strategy for scaling Graph Neural Networks by compressing massive datasets into small, synthetic node sets. While current GC methods effectively maintain predictive accuracy, they are primarily designed for utility and often ignore fairness constraints. Because these techniques are bias-blind, they frequently capture and even amplify demographic disparities found in the original data. This leads to synthetic proxies that are unsuitable for sensitive applications like credit scoring or social recommendations. To solve this problem, we introduce FairGC, a unified framework that embeds fairness directly into the graph distillation process. Our approach consists of three key components. First, a Distribution-Preserving Condensation module synchronizes the joint distributions of labels and sensitive attributes to stop bias from spreading. Second, a Spectral Encoding module uses Laplacian eigen-decomposition to preserve essential global structural patterns. Finally, a Fairness-Enhanced Neural Architecture employs multi-domain fusion and a label-smoothing curriculum to produce equitable predictions. Rigorous evaluations on four real-world datasets, show that FairGC provides a superior balance between accuracy and fairness. Our results confirm that FairGC significantly reduces disparity in Statistical Parity and Equal Opportunity compared to existing state-of-the-art condensation models. The codes are available at https://github.com/LuoRenqiang/FairGC.

Related papers

• PLGC: Pseudo-Labeled Graph Condensation [11.1647744418267]
  Large graph datasets make training graph neural networks (GNNs) computationally costly.<n>Existing approaches rely on clean, supervised labels, which limits their reliability when labels are scarce, noisy, or inconsistent.<n>We propose Pseudo-Labeled Graph Condensation (PLGC), a self-supervised framework that constructs latent pseudo-labels from node embeddings.
  arXiv  Detail & Related papers  (2026-01-15T13:02:31Z)
• FairGE: Fairness-Aware Graph Encoding in Incomplete Social Networks [21.123569802490724]
  FairGE (Fair Graph) is a fairness-aware framework for GTs in incomplete social networks.<n>It encodes fairness directly through spectral graph theory.<n>It achieves at least 16% improvement in both statistical parity and equality of opportunity compared with state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-01-14T11:33:05Z)
• Estimating Fair Graphs from Graph-Stationary Data [58.94389691379349]
  We consider group and individual fairness for graphs corresponding to group- and node-level definitions.<n>To evaluate the fairness of a given graph, we provide multiple bias metrics, including novel measurements in the spectral domain.<n>One variant of FairSpecTemp exploits commutativity properties of graph stationarity while directly constraining bias.<n>The other implicitly encourages fair estimates by restricting bias in the graph spectrum and is thus more flexible.
  arXiv  Detail & Related papers  (2025-10-08T20:51:57Z)
• ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions [64.17845687013434]
  We propose ReDiSC, a structured diffusion model for structured node classification.<n>We show that ReDiSC achieves superior or highly competitive performance compared to state-of-the-art GNN, label propagation, and diffusion-based baselines.<n> Notably, ReDiSC scales effectively to large-scale datasets on which previous structured diffusion methods fail due to computational constraints.
  arXiv  Detail & Related papers  (2025-07-19T04:46:53Z)
• Towards Unbiased Federated Graph Learning: Label and Topology Perspectives [30.103014192157115]
  Federated Graph Learning (FGL) enables privacy-preserving, distributed training of graph neural networks without sharing raw data.<n>We propose FairFGL, a novel framework that enhances fairness through fine-grained graph mining and collaborative learning.
  arXiv  Detail & Related papers  (2025-04-14T08:00:20Z)
• Rethinking Fair Graph Neural Networks from Re-balancing [26.70771023446706]
  We find that simple re-balancing methods can easily match or surpass existing fair GNN methods. We propose FairGB, Fair Graph Neural Network via re-Balancing, which mitigates the unfairness of GNNs by group balancing.
  arXiv  Detail & Related papers  (2024-07-16T11:39:27Z)
• Chasing Fairness in Graphs: A GNN Architecture Perspective [73.43111851492593]
  We propose textsfFair textsfMessage textsfPassing (FMP) designed within a unified optimization framework for graph neural networks (GNNs) In FMP, the aggregation is first adopted to utilize neighbors' information and then the bias mitigation step explicitly pushes demographic group node presentation centers together. Experiments on node classification tasks demonstrate that the proposed FMP outperforms several baselines in terms of fairness and accuracy on three real-world datasets.
  arXiv  Detail & Related papers  (2023-12-19T18:00:15Z)
• Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning [56.45977379288308]
  Masked autoencoder (MAE) learns to reconstruct masked graph edges or node features. Contrastive Learning (CL) maximizes the similarity between augmented views of the same graph. We propose graph contrastive masked autoencoder (GCMAE) framework to unify MAE and CL.
  arXiv  Detail & Related papers  (2023-10-24T05:06:06Z)
• Analyzing the Effect of Sampling in GNNs on Individual Fairness [79.28449844690566]
  Graph neural network (GNN) based methods have saturated the field of recommender systems. We extend an existing method for promoting individual fairness on graphs to support mini-batch, or sub-sample based, training of a GNN. We show that mini-batch training facilitate individual fairness promotion by allowing for local nuance to guide the process of fairness promotion in representation learning.
  arXiv  Detail & Related papers  (2022-09-08T16:20:25Z)
• Explainable Sparse Knowledge Graph Completion via High-order Graph Reasoning Network [111.67744771462873]
  This paper proposes a novel explainable model for sparse Knowledge Graphs (KGs) It combines high-order reasoning into a graph convolutional network, namely HoGRN. It can not only improve the generalization ability to mitigate the information insufficiency issue but also provide interpretability.
  arXiv  Detail & Related papers  (2022-07-14T10:16:56Z)
• DECAF: Generating Fair Synthetic Data Using Causally-Aware Generative Networks [71.6879432974126]
  We introduce DECAF: a GAN-based fair synthetic data generator for tabular data. We show that DECAF successfully removes undesired bias and is capable of generating high-quality synthetic data. We provide theoretical guarantees on the generator's convergence and the fairness of downstream models.
  arXiv  Detail & Related papers  (2021-10-25T12:39:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.