Dimensional Reweighting Graph Convolutional Networks
Not on the map. Why?
Abstract (arXiv)
Graph Convolution Networks (GCNs) are becoming more and more popular for learning node representations on graphs. Though there exist various developments on sampling and aggregation to accelerate the training process and improve the performances, limited works focus on dealing with the dimensional information imbalance of node representations. To bridge the gap, we propose a method named Dimensional reweighting Graph Convolution Network (DrGCN). We theoretically prove that our DrGCN can guarantee to improve the stability of GCNs via mean field theory. Our dimensional reweighting method is very flexible and can be easily combined with most sampling and aggregation techniques for GCNs. Experimental results demonstrate its superior performances on several challenging transductive and inductive node classification benchmark datasets. Our DrGCN also outperforms existing models on an industrial-sized Alibaba recommendation dataset.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 0; 2023: 0; 2024: 1.
4 papers.
- 2021Graph Robustness Benchmark: Benchmarking the Adversarial Robustness of Graph Machine Learningcited by 44
- 2021Should Graph Neural Networks Use Features, Edges, Or Both?cited by 7
- 2021MGC: A Complex-Valued Graph Convolutional Network for Directed Graphscited by 7
- 2024Fast Inference of Removal-Based Node Influencecited by 2
- 2024Fast Inference of Removal-Based Node Influence13 Mar 2024
- 2021Graph Robustness Benchmark: Benchmarking the Adversarial Robustness of Graph Machine Learning8 Nov 2021
- 2021MGC: A Complex-Valued Graph Convolutional Network for Directed Graphs14 Oct 2021
- 2021Should Graph Neural Networks Use Features, Edges, Or Both?11 Mar 2021