Pseudoinverse Graph Convolutional Networks: Fast Filters Tailored for Large Eigengaps of Dense Graphs and Hypergraphs

TL;DR

This paper introduces a novel graph convolutional network variant that uses pseudoinverse-based filters and low-rank approximations to efficiently handle dense graphs and hypergraphs with large eigengaps, improving accuracy and speed.

Contribution

The paper presents a new GCN approach tailored for dense graphs with large eigengaps, utilizing pseudoinverse filters and low-rank approximations for enhanced efficiency and accuracy.

Findings

Improved runtime performance on dense graph datasets

Enhanced classification accuracy with the proposed method

Effective handling of hypergraphs and non-local information

Abstract

Graph Convolutional Networks (GCNs) have proven to be successful tools for semi-supervised classification on graph-based datasets. We propose a new GCN variant whose three-part filter space is targeted at dense graphs. Examples include Gaussian graphs for 3D point clouds with an increased focus on non-local information, as well as hypergraphs based on categorical data. These graphs differ from the common sparse benchmark graphs in terms of the spectral properties of their graph Laplacian. Most notably we observe large eigengaps, which are unfavorable for popular existing GCN architectures. Our method overcomes these issues by utilizing the pseudoinverse of the Laplacian. Another key ingredient is a low-rank approximation of the convolutional matrix, ensuring computational efficiency and increasing accuracy at the same time. We outline how the necessary eigeninformation can be computed efficiently in each applications and discuss the appropriate choice of the only metaparameter, the approximation rank. We finally showcase our method's performance regarding runtime and accuracy in various experiments with real-world datasets.