Pith. sign in

REVIEW 2 cited by

Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.16788 v1 pith:AZLFOU5Z submitted 2023-12-28 cs.LG cs.AIcs.SI

classification cs.LGcs.AIcs.SI
keywords graphaugmentationsbiasescommunitydegreenodeslearnlearnable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Graph Neural Networks Need Cluster-Normalize-Activate Modules

    cs.LG 2024-12 conditional novelty 6.0 of 10

    A Cluster-Normalize-Activate module replaces plain activations in GNNs, limiting oversmoothing and improving accuracy with fewer parameters.

  2. Revisiting the Necessity of Graph Learning and Common Graph Benchmarks

    cs.LG 2024-12 conditional novelty 4.0 of 10

    Tuned feature-only MLPs nearly match graph neural networks on five common graph benchmarks, suggesting those benchmarks measure feature quality more than graph learning.

Pith tools