mlsanityData to 14 Oct 2026

Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures

arXiv 2312.16788 ↗First posted 28 Dec 2023cs.LG cs.AI cs.SIcited by 6

Not on the map. Why?

Abstract (arXiv)

This study utilizes community structures to address node degree biases in message-passing (MP) via learnable graph augmentations and novel graph transformers. Recent augmentation-based methods showed that MP neural networks often perform poorly on low-degree nodes, leading to degree biases due to a lack of messages reaching low-degree nodes. Despite their success, most methods use heuristic or uniform random augmentations, which are non-differentiable and may not always generate valuable edges for learning representations. In this paper, we propose Community-aware Graph Transformers, namely CGT, to learn degree-unbiased representations based on learnable augmentations and graph transformers by extracting within community structures. We first design a learnable graph augmentation to generate more within-community edges connecting low-degree nodes through edge perturbation. Second, we propose an improved self-attention to learn underlying proximity and the roles of nodes within the community. Third, we propose a self-supervised learning task that could learn the representations to preserve the global graph structure and regularize the graph augmentations. Extensive experiments on various benchmark datasets showed CGT outperforms state-of-the-art baselines and significantly improves the node degree biases. The source code is available at https://github.com/NSLab-CUK/Community-aware-Graph-Transformer.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 21 of its 32 references that are in the map. First posted on arXiv 28 Dec 2023.

Builds on

21 of 32 references.

References · 21

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2017Inductive Representation Learning on Large Graphscited by 6,320
  4. 2018How Powerful are Graph Neural Networks?cited by 4,393
  5. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  6. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  7. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  8. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
  9. 2015Image-based Recommendations on Styles and Substitutescited by 706
  10. 2020A Generalization of Transformer Networks to Graphscited by 661
  11. 2020Deep Graph Contrastive Representation Learningcited by 539
  12. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
9 more
  1. 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
  2. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
  3. 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 260
  4. 2022Structure-Aware Transformer for Graph Representation Learningcited by 194
  5. 2020Graph Clustering with Graph Neural Networkscited by 163
  6. 2022Uncovering the Structural Fairness in Graph Contrastive Learningcited by 29
  7. 2023Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similaritycited by 14
  8. 2022Relational Self-Supervised Learning on Graphscited by 11
  9. 2023Companion Animal Disease Diagnostics based on Literal-aware Medical Knowledge Graph Representation Learningcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 4; 2025: 1; 2026: 1.

6 papers.