Table of Contents
Fetching ...

Topological Deep Learning with State-Space Models: A Mamba Approach for Simplicial Complexes

Marco Montagna, Simone Scardapane, Lev Telyatnikov

TL;DR

This work proposes a novel architecture designed to operate with simplicial complexes, utilizing the Mamba state-space model as its backbone, and achieves competitive performance compared to state-of-the-art models developed for simplicial complexes.

Abstract

Graph Neural Networks based on the message-passing (MP) mechanism are a dominant approach for handling graph-structured data. However, they are inherently limited to modeling only pairwise interactions, making it difficult to explicitly capture the complexity of systems with $n$-body relations. To address this, topological deep learning has emerged as a promising field for studying and modeling higher-order interactions using various topological domains, such as simplicial and cellular complexes. While these new domains provide powerful representations, they introduce new challenges, such as effectively modeling the interactions among higher-order structures through higher-order MP. Meanwhile, structured state-space sequence models have proven to be effective for sequence modeling and have recently been adapted for graph data by encoding the neighborhood of a node as a sequence, thereby avoiding the MP mechanism. In this work, we propose a novel architecture designed to operate with simplicial complexes, utilizing the Mamba state-space model as its backbone. Our approach generates sequences for the nodes based on the neighboring cells, enabling direct communication between all higher-order structures, regardless of their rank. We extensively validate our model, demonstrating that it achieves competitive performance compared to state-of-the-art models developed for simplicial complexes.

Topological Deep Learning with State-Space Models: A Mamba Approach for Simplicial Complexes

TL;DR

This work proposes a novel architecture designed to operate with simplicial complexes, utilizing the Mamba state-space model as its backbone, and achieves competitive performance compared to state-of-the-art models developed for simplicial complexes.

Abstract

Graph Neural Networks based on the message-passing (MP) mechanism are a dominant approach for handling graph-structured data. However, they are inherently limited to modeling only pairwise interactions, making it difficult to explicitly capture the complexity of systems with -body relations. To address this, topological deep learning has emerged as a promising field for studying and modeling higher-order interactions using various topological domains, such as simplicial and cellular complexes. While these new domains provide powerful representations, they introduce new challenges, such as effectively modeling the interactions among higher-order structures through higher-order MP. Meanwhile, structured state-space sequence models have proven to be effective for sequence modeling and have recently been adapted for graph data by encoding the neighborhood of a node as a sequence, thereby avoiding the MP mechanism. In this work, we propose a novel architecture designed to operate with simplicial complexes, utilizing the Mamba state-space model as its backbone. Our approach generates sequences for the nodes based on the neighboring cells, enabling direct communication between all higher-order structures, regardless of their rank. We extensively validate our model, demonstrating that it achieves competitive performance compared to state-of-the-art models developed for simplicial complexes.
Paper Structure (21 sections, 14 equations, 1 figure, 5 tables)

This paper contains 21 sections, 14 equations, 1 figure, 5 tables.

Figures (1)

  • Figure 1: Scheme showing how our model updates the vector of node A. First, the neighboring cells of the target node are selected and then ordered by rank. A single vector for each rank is obtained by aggregating the cells with the same rank. Mamba is used on the resulting sequence which is then summed to obtain the new node representation.

Theorems & Definitions (3)

  • Definition 1
  • Definition 2
  • Definition 3