2019/02/19 by Felix Wu, Tianyi Zhang, Wu, Felix +10 · 246 citations
Computer Science · Mathematics · Physics and Astronomy · #Advanced Graph Neural Networks #Complex Network Analysis Techniques #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Topic Modeling #cs.LG #stat.ML
paper · pdf · doi:10.48550/arxiv.1902.07153
In ICML 2019. Code available at https://github.com/Tiiiger/SGC
openalex publication_date 2019/02/19 · arxiv created 2019/06/20 · arxiv updated 2019/06/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Graph Convolutional Networks (GCNs) and their variants have experienced significant attention and have become the de facto methods for learning graph representations. GCNs derive inspiration primarily from recent deep learning approaches, and as a result, may inherit unnecessary complexity and redundant computation. In this paper, we reduce this excess complexity through successively removing nonlinearities and collapsing weight matrices between consecutive layers. We theoretically analyze the resulting linear model and show that it corresponds to a fixed low-pass filter followed by a linear classifier. Notably, our experimental evaluation demonstrates that these simplifications do not negatively impact accuracy in many downstream applications. Moreover, the resulting model scales to larger datasets, is naturally interpretable, and yields up to two orders of magnitude speedup over FastGCN.