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.

通过消除GCN中的不必要的非线性和权重矩阵，我们提出了一种线性模型，它对应于一个固定的低通滤波器，然后是一个线性分类器。 在许多下游应用中，我们的实验评估表明这种简化并不会对精度产生负面影响。 此外，由于我们的模型简化减少了计算量，因此我们的模型在更大的数据集上具有可扩展性，并且具有更快的推理速度。

简化图卷积网络