Efficient Topology-aware Data Augmentation for High-Degree Graph Neural Networks

TL;DR

This paper introduces TADA, a novel data augmentation framework that enhances GNN performance on high-degree graphs by combining feature expansion with structure embeddings and topology-aware graph sparsification.

Contribution

TADA is the first to integrate structure-aware feature augmentation and graph sparsification specifically for high-degree GNNs, addressing over-smoothing and efficiency issues.

Findings

Significant accuracy improvements on 8 real HDGs.

Faster training and inference for GNNs on HDGs.

Effective reduction of redundant edges in complex graphs.

Abstract

In recent years, graph neural networks (GNNs) have emerged as a potent tool for learning on graph-structured data and won fruitful successes in varied fields. The majority of GNNs follow the message-passing paradigm, where representations of each node are learned by recursively aggregating features of its neighbors. However, this mechanism brings severe over-smoothing and efficiency issues over high-degree graphs (HDGs), wherein most nodes have dozens (or even hundreds) of neighbors, such as social networks, transaction graphs, power grids, etc. Additionally, such graphs usually encompass rich and complex structure semantics, which are hard to capture merely by feature aggregations in GNNs. Motivated by the above limitations, we propose TADA, an efficient and effective front-mounted data augmentation framework for GNNs on HDGs. Under the hood, TADA includes two key modules: (i) feature expansion with structure embeddings, and (ii) topology- and attribute-aware graph sparsification. The former obtains augmented node features and enhanced model capacity by encoding the graph structure into high-quality structure embeddings with our highly-efficient sketching method. Further, by exploiting task-relevant features extracted from graph structures and attributes, the second module enables the accurate identification and reduction of numerous redundant/noisy edges from the input graph, thereby alleviating over-smoothing and facilitating faster feature aggregations over HDGs. Empirically, TADA considerably improves the predictive performance of mainstream GNN models on 8 real homophilic/heterophilic HDGs in terms of node classification, while achieving efficient training and inference processes.