Mitigating Bias in Graph Hyperdimensional Computing

• URL: http://arxiv.org/abs/2512.07433v1
• Date: Mon, 08 Dec 2025 11:09:24 GMT
• Title: Mitigating Bias in Graph Hyperdimensional Computing
• Abstract summary: Graph hyperdimensional computing (HDC) has emerged as a promising paradigm for cognitive tasks.<n>We study fairness in graph HDC, where biases in data representation and decision rules can lead to unequal treatment of different groups.<n>We propose a fairness-aware training framework, FairGHDC, to mitigate such biases.
• Score: 15.864328671840612
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph hyperdimensional computing (HDC) has emerged as a promising paradigm for cognitive tasks, emulating brain-like computation with high-dimensional vectors known as hypervectors. While HDC offers robustness and efficiency on graph-structured data, its fairness implications remain largely unexplored. In this paper, we study fairness in graph HDC, where biases in data representation and decision rules can lead to unequal treatment of different groups. We show how hypervector encoding and similarity-based classification can propagate or even amplify such biases, and we propose a fairness-aware training framework, FairGHDC, to mitigate them. FairGHDC introduces a bias correction term, derived from a gap-based demographic-parity regularizer, and converts it into a scalar fairness factor that scales the update of the class hypervector for the ground-truth label. This enables debiasing directly in the hypervector space without modifying the graph encoder or requiring backpropagation. Experimental results on six benchmark datasets demonstrate that FairGHDC substantially reduces demographic-parity and equal-opportunity gaps while maintaining accuracy comparable to standard GNNs and fairness-aware GNNs. At the same time, FairGHDC preserves the computational advantages of HDC, achieving up to about one order of magnitude ($\approx 10\times$) speedup in training time on GPU compared to GNN and fairness-aware GNN baselines.

Related papers

• FairGC: Fairness-aware Graph Condensation [11.416044011065017]
  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.
  arXiv  Detail & Related papers  (2026-03-30T11:46:05Z)
• VS-Graph: Scalable and Efficient Graph Classification Using Hyperdimensional Computing [0.4497860392054933]
  We propose VS-Graph, a vector-symbolic graph learning framework that narrows the gap between the efficiency of HDC and the expressive power of message passing.<n>Our method achieves competitive accuracy with modern GNNs, outperforming the prior HDC baseline by 4-5% on standard benchmarks.<n>It also matches or exceeds the performance of the GNN baselines on several datasets while accelerating the training by a factor of up to 450x.
  arXiv  Detail & Related papers  (2025-12-03T03:03:44Z)
• Improving Fairness in Graph Neural Networks via Counterfactual Debiasing [4.984092292992338]
  Graph Neural Networks (GNNs) have been successful in modeling graph-structured data.<n>GNNs can exhibit bias in predictions based on attributes like race and gender.<n>We present a novel approach utilizing counterfactual data augmentation for bias mitigation.
  arXiv  Detail & Related papers  (2025-08-20T12:59:05Z)
• FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning [15.383535436798065]
  Recent studies have highlighted significant fairness issues in Graph Transformer (GT) models.<n>GTs are computationally intensive and memory-demanding, limiting their application to large-scale graphs.<n>We propose Graph Partitioning (FairGP) which partitions the graph to minimize the negative impact of higher-order nodes.
  arXiv  Detail & Related papers  (2024-12-14T04:15:32Z)
• Endowing Pre-trained Graph Models with Provable Fairness [49.8431177748876]
  We propose a novel adapter-tuning framework that endows pre-trained graph models with provable fairness (called GraphPAR) Specifically, we design a sensitive semantic augmenter on node representations, to extend the node representations with different sensitive attribute semantics for each node. With GraphPAR, we quantify whether the fairness of each node is provable, i.e., predictions are always fair within a certain range of sensitive attribute semantics.
  arXiv  Detail & Related papers  (2024-02-19T14:16:08Z)
• 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)
• Learning to Reweight for Graph Neural Network [63.978102332612906]
  Graph Neural Networks (GNNs) show promising results for graph tasks. Existing GNNs' generalization ability will degrade when there exist distribution shifts between testing and training graph data. We propose a novel nonlinear graph decorrelation method, which can substantially improve the out-of-distribution generalization ability.
  arXiv  Detail & Related papers  (2023-12-19T12:25:10Z)
• Towards Fair Graph Neural Networks via Graph Counterfactual [38.721295940809135]
  Graph neural networks (GNNs) have shown great ability in representation (GNNs) learning on graphs, facilitating various tasks. Recent works show that GNNs tend to inherit and amplify the bias from training data, causing concerns of the adoption of GNNs in high-stake scenarios. We propose a novel framework CAF, which can select counterfactuals from training data to avoid non-realistic counterfactuals.
  arXiv  Detail & Related papers  (2023-07-10T23:28:03Z)
• A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking [124.21408098724551]
  Large-scale graph training is a notoriously challenging problem for graph neural networks (GNNs) We present a new ensembling training manner, named EnGCN, to address the existing issues. Our proposed method has achieved new state-of-the-art (SOTA) performance on large-scale datasets.
  arXiv  Detail & Related papers  (2022-10-14T03:43:05Z)
• Generalizing Graph Neural Networks on Out-Of-Distribution Graphs [51.33152272781324]
  Graph Neural Networks (GNNs) are proposed without considering the distribution shifts between training and testing graphs. In such a setting, GNNs tend to exploit subtle statistical correlations existing in the training set for predictions, even though it is a spurious correlation. We propose a general causal representation framework, called StableGNN, to eliminate the impact of spurious correlations.
  arXiv  Detail & Related papers  (2021-11-20T18:57:18Z)
• Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training data [52.771780951404565]
  Shift-Robust GNN (SR-GNN) is designed to account for distributional differences between biased training data and the graph's true inference distribution. We show that SR-GNN outperforms other GNN baselines by accuracy, eliminating at least (40%) of the negative effects introduced by biased training data.
  arXiv  Detail & Related papers  (2021-08-02T18:00:38Z)

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.