Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors

In recent years, Graph Convolutional Networks (GCNs) have gained popularity for their exceptional ability to process graph-structured data. Existing GCN-based approaches typically employ a shallow model architecture due to the over-smoothing phenomenon. Current approaches to mitigating over-smoothing primarily involve adding supplementary components to GCN architectures, such as residual connections and random edge-dropping strategies. However, these improvements toward deep GCNs have achieved only limited success. In this work, we analyze the intrinsic message passing mechanism of GCNs and identify a critical issue: messages originating from high-order neighbors must traverse through low-order neighbors to reach the target node. This repeated reliance on low-order neighbors leads to redundant information aggregation, a phenomenon we term over-aggregation. Our analysis demonstrates that over-aggregation not only introduces significant redundancy but also serves as the fundamental cause of over-smoothing in GCNs.

@article{lu2025_2504.13426,
  title={ Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors },
  author={ Jielong Lu and Zhihao Wu and Zhiling Cai and Yueyang Pi and Shiping Wang },
  journal={arXiv preprint arXiv:2504.13426},
  year={ 2025 }
}