GRAMA: Adaptive Graph Autoregressive Moving Average Models

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Eliasof, Moshe, Gravina, Alessio, Ceni, Andrea, Gallicchio, Claudio, Bacciu, Davide, Schönlieb, Carola-Bibiane
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929684041695232
author Eliasof, Moshe
Gravina, Alessio
Ceni, Andrea
Gallicchio, Claudio
Bacciu, Davide
Schönlieb, Carola-Bibiane
author_facet Eliasof, Moshe
Gravina, Alessio
Ceni, Andrea
Gallicchio, Claudio
Bacciu, Davide
Schönlieb, Carola-Bibiane
contents Graph State Space Models (SSMs) have recently been introduced to enhance Graph Neural Networks (GNNs) in modeling long-range interactions. Despite their success, existing methods either compromise on permutation equivariance or limit their focus to pairwise interactions rather than sequences. Building on the connection between Autoregressive Moving Average (ARMA) and SSM, in this paper, we introduce GRAMA, a Graph Adaptive method based on a learnable Autoregressive Moving Average (ARMA) framework that addresses these limitations. By transforming from static to sequential graph data, GRAMA leverages the strengths of the ARMA framework, while preserving permutation equivariance. Moreover, GRAMA incorporates a selective attention mechanism for dynamic learning of ARMA coefficients, enabling efficient and flexible long-range information propagation. We also establish theoretical connections between GRAMA and Selective SSMs, providing insights into its ability to capture long-range dependencies. Extensive experiments on 14 synthetic and real-world datasets demonstrate that GRAMA consistently outperforms backbone models and performs competitively with state-of-the-art methods.
format Preprint
id arxiv_https___arxiv_org_abs_2501_12732
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle GRAMA: Adaptive Graph Autoregressive Moving Average Models
Eliasof, Moshe
Gravina, Alessio
Ceni, Andrea
Gallicchio, Claudio
Bacciu, Davide
Schönlieb, Carola-Bibiane
Machine Learning
Graph State Space Models (SSMs) have recently been introduced to enhance Graph Neural Networks (GNNs) in modeling long-range interactions. Despite their success, existing methods either compromise on permutation equivariance or limit their focus to pairwise interactions rather than sequences. Building on the connection between Autoregressive Moving Average (ARMA) and SSM, in this paper, we introduce GRAMA, a Graph Adaptive method based on a learnable Autoregressive Moving Average (ARMA) framework that addresses these limitations. By transforming from static to sequential graph data, GRAMA leverages the strengths of the ARMA framework, while preserving permutation equivariance. Moreover, GRAMA incorporates a selective attention mechanism for dynamic learning of ARMA coefficients, enabling efficient and flexible long-range information propagation. We also establish theoretical connections between GRAMA and Selective SSMs, providing insights into its ability to capture long-range dependencies. Extensive experiments on 14 synthetic and real-world datasets demonstrate that GRAMA consistently outperforms backbone models and performs competitively with state-of-the-art methods.
title GRAMA: Adaptive Graph Autoregressive Moving Average Models
topic Machine Learning
url https://arxiv.org/abs/2501.12732