Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.12033 v1 pith:ADGI7GQE submitted 2024-09-18 cs.LG cs.AI

classification cs.LGcs.AI
keywords complexeshigher-ordermodelingsimplicialapproachinteractionsmodelssequence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. HOPSE: Scalable Higher-Order Positional and Structural Encoder for Combinatorial Representations

    cs.LG 2025-05 conditional novelty 6.0 of 10

    HOPSE encodes higher-order topological data by applying graph positional and structural encoders to Hasse graph decompositions, matching or exceeding message-passing models on benchmarks with up to 7x faster training.

  2. Topological Data Analysis and Topological Deep Learning Beyond Persistent Homology -- A Review

    math.HO 2025-07 conditional novelty 3.0 of 10

    A survey organizing recent TDA and TDL methods beyond persistent homology and connecting them to data structures and vectorization.

Pith tools