Continuous Product Graph Neural Networks

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Einizade, Aref, Malliaros, Fragkiskos D., Giraldo, Jhony H.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912094835703808
author Einizade, Aref
Malliaros, Fragkiskos D.
Giraldo, Jhony H.
author_facet Einizade, Aref
Malliaros, Fragkiskos D.
Giraldo, Jhony H.
contents Processing multidomain data defined on multiple graphs holds significant potential in various practical applications in computer science. However, current methods are mostly limited to discrete graph filtering operations. Tensorial partial differential equations on graphs (TPDEGs) provide a principled framework for modeling structured data across multiple interacting graphs, addressing the limitations of the existing discrete methodologies. In this paper, we introduce Continuous Product Graph Neural Networks (CITRUS) that emerge as a natural solution to the TPDEG. CITRUS leverages the separability of continuous heat kernels from Cartesian graph products to efficiently implement graph spectral decomposition. We conduct thorough theoretical analyses of the stability and over-smoothing properties of CITRUS in response to domain-specific graph perturbations and graph spectra effects on the performance. We evaluate CITRUS on well-known traffic and weather spatiotemporal forecasting datasets, demonstrating superior performance over existing approaches. The implementation codes are available at https://github.com/ArefEinizade2/CITRUS.
format Preprint
id arxiv_https___arxiv_org_abs_2405_18877
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Continuous Product Graph Neural Networks
Einizade, Aref
Malliaros, Fragkiskos D.
Giraldo, Jhony H.
Machine Learning
Artificial Intelligence
Processing multidomain data defined on multiple graphs holds significant potential in various practical applications in computer science. However, current methods are mostly limited to discrete graph filtering operations. Tensorial partial differential equations on graphs (TPDEGs) provide a principled framework for modeling structured data across multiple interacting graphs, addressing the limitations of the existing discrete methodologies. In this paper, we introduce Continuous Product Graph Neural Networks (CITRUS) that emerge as a natural solution to the TPDEG. CITRUS leverages the separability of continuous heat kernels from Cartesian graph products to efficiently implement graph spectral decomposition. We conduct thorough theoretical analyses of the stability and over-smoothing properties of CITRUS in response to domain-specific graph perturbations and graph spectra effects on the performance. We evaluate CITRUS on well-known traffic and weather spatiotemporal forecasting datasets, demonstrating superior performance over existing approaches. The implementation codes are available at https://github.com/ArefEinizade2/CITRUS.
title Continuous Product Graph Neural Networks
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2405.18877