Decouple Graph Neural Networks: Train Multiple Simple GNNs Simultaneously Instead of One
Graph neural networks (GNN) suffer from severe inefficiency. It is mainly caused by the exponential growth of node dependency with the increase of layers. It extremely limits the application of stochastic optimization algorithms so that the training of GNN is usually time-consuming. To address this problem, we propose to decouple a multi-layer GNN as multiple simple modules for more efficient training, which is comprised of classical forward training (FT)and designed backward training (BT). Under the proposed framework, each module can be trained efficiently in FT by stochastic algorithms without distortion of graph information owing to its simplicity. To avoid the only unidirectional information delivery of FT and sufficiently train shallow modules with the deeper ones, we develop a backward training mechanism that makes the former modules perceive the latter modules. The backward training introduces the reversed information delivery into the decoupled modules as well as the forward information delivery. To investigate how the decoupling and greedy training affect the representational capacity, we theoretically prove that the error produced by linear modules will not accumulate on unsupervised tasks in most cases. The theoretical and experimental results show that the proposed framework is highly efficient with reasonable performance.
Code (1)
Tasks
Stochastic OptimizationSimilar Papers 제목 키워드 기반
Unsupervised Constrained Community Detection via Self-Expressive Graph Neural Network
Graph neural networks (GNNs) are able to achieve promising performance on multiple graph downstream tasks such as node classification and link prediction. Comparatively lesser work has been done to design GNNs which can …
ClusteringCommunity DetectionGraph Neural NetworkLink Prediction+1Exploiting Neighbor Effect: Conv-Agnostic GNNs Framework for Graphs with Heterophily
Due to the homophily assumption in graph convolution networks (GNNs), a common consensus in the graph node classification task is that GNNs perform well on homophilic graphs but may fail on heterophilic graphs with many …
Node Classificationp2pGNN: A Decentralized Graph Neural Network for Node Classification in Peer-to-Peer Networks
In this work, we aim to classify nodes of unstructured peer-to-peer networks with communication uncertainty, such as users of decentralized social networks. Graph Neural Networks (GNNs) are known to improve the accuracy …
Graph Neural NetworkNode ClassificationRethinking the Graph Polynomial Filter via Positive and Negative Coupling Analysis
Recently, the optimization of polynomial filters within Spectral Graph Neural Networks (GNNs) has emerged as a prominent research focus. Existing spectral GNNs mainly emphasize polynomial properties in filter design, int…
Node ClassificationDGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations
Graph neural networks (GNNs) demonstrate a robust capability for representation learning on graphs with complex structures, showcasing superior performance in various applications. The majority of existing GNNs employ a …
AttributeGraph EmbeddingNode ClassificationRepresentation Learning+1