Table of Contents
Fetching ...

Tensor-view Topological Graph Neural Network

Tao Wen, Elynn Chen, Yuzhou Chen

TL;DR

The paper tackles the limitation of conventional GNNs that rely on local neighborhoods by proposing TTG-NN, which fuses persistent-homology-based multi-filtration topology with tensor learning. It introduces two parallel modules, TT-CL for local topological features and TG-CL for global structure, connected through the Tensor Transformation Layer (TTL) that exploits Tucker/CP/TT low-rank decompositions to reduce complexity. The authors provide non-asymptotic, high-probability bounds on both in-sample and out-of-sample mean-squared error under Tucker low-rankness and validate the approach on diverse graph classification benchmarks, achieving state-of-the-art performance and favorable computational efficiency. Overall, TTG-NN substantially improves the integration of topology and tensor-based representations in graphs, with strong empirical gains and solid theoretical guarantees, and offers a flexible framework for further extensions to spatiotemporal and community detection tasks.

Abstract

Graph classification is an important learning task for graph-structured data. Graph neural networks (GNNs) have recently gained growing attention in graph learning and have shown significant improvements in many important graph problems. Despite their state-of-the-art performances, existing GNNs only use local information from a very limited neighborhood around each node, suffering from loss of multi-modal information and overheads of excessive computation. To address these issues, we propose a novel Tensor-view Topological Graph Neural Network (TTG-NN), a class of simple yet effective topological deep learning built upon persistent homology, graph convolution, and tensor operations. This new method incorporates tensor learning to simultaneously capture Tensor-view Topological (TT), as well as Tensor-view Graph (TG) structural information on both local and global levels. Computationally, to fully exploit graph topology and structure, we propose two flexible TT and TG representation learning modules that disentangle feature tensor aggregation and transformation and learn to preserve multi-modal structure with less computation. Theoretically, we derive high probability bounds on both the out-of-sample and in-sample mean squared approximation errors for our proposed Tensor Transformation Layer (TTL). Real data experiments show that the proposed TTG-NN outperforms 20 state-of-the-art methods on various graph benchmarks.

Tensor-view Topological Graph Neural Network

TL;DR

The paper tackles the limitation of conventional GNNs that rely on local neighborhoods by proposing TTG-NN, which fuses persistent-homology-based multi-filtration topology with tensor learning. It introduces two parallel modules, TT-CL for local topological features and TG-CL for global structure, connected through the Tensor Transformation Layer (TTL) that exploits Tucker/CP/TT low-rank decompositions to reduce complexity. The authors provide non-asymptotic, high-probability bounds on both in-sample and out-of-sample mean-squared error under Tucker low-rankness and validate the approach on diverse graph classification benchmarks, achieving state-of-the-art performance and favorable computational efficiency. Overall, TTG-NN substantially improves the integration of topology and tensor-based representations in graphs, with strong empirical gains and solid theoretical guarantees, and offers a flexible framework for further extensions to spatiotemporal and community detection tasks.

Abstract

Graph classification is an important learning task for graph-structured data. Graph neural networks (GNNs) have recently gained growing attention in graph learning and have shown significant improvements in many important graph problems. Despite their state-of-the-art performances, existing GNNs only use local information from a very limited neighborhood around each node, suffering from loss of multi-modal information and overheads of excessive computation. To address these issues, we propose a novel Tensor-view Topological Graph Neural Network (TTG-NN), a class of simple yet effective topological deep learning built upon persistent homology, graph convolution, and tensor operations. This new method incorporates tensor learning to simultaneously capture Tensor-view Topological (TT), as well as Tensor-view Graph (TG) structural information on both local and global levels. Computationally, to fully exploit graph topology and structure, we propose two flexible TT and TG representation learning modules that disentangle feature tensor aggregation and transformation and learn to preserve multi-modal structure with less computation. Theoretically, we derive high probability bounds on both the out-of-sample and in-sample mean squared approximation errors for our proposed Tensor Transformation Layer (TTL). Real data experiments show that the proposed TTG-NN outperforms 20 state-of-the-art methods on various graph benchmarks.
Paper Structure (16 sections, 1 theorem, 15 equations, 1 figure, 5 tables)

This paper contains 16 sections, 1 theorem, 15 equations, 1 figure, 5 tables.

Key Result

Theorem 3.2

Assume tensor feature ${\boldsymbol{{\cal X}}}$ is a $D_1\times\cdots\times D_M$ tensor with low Tucker rank $(R_1, \cdots, R_M)$, $R = \prod_{m=1}^M R_m$. Then with probability at least $1-3\exp(-t)$, for large enough $n$, we have for a universal constant $C$ that only depends on $c$ and constants. The components in the error bounds are, respectively: NN approximation error Stochastic error T

Figures (1)

  • Figure 1: The architecture of TTG-NN.

Theorems & Definitions (2)

  • Definition 3.1: Deep ReLU Tensor Network Class
  • Theorem 3.2