GG-SSMs: Graph-Generating State Space Models
Nikola Zubi\'c, Davide Scaramuzza

TL;DR
GG-SSMs introduce a dynamic graph-based approach to state space models, enabling better modeling of complex dependencies in high-dimensional sequential data across diverse applications.
Contribution
The paper presents Graph-Generating State Space Models (GG-SSMs), a novel framework that dynamically constructs graphs based on feature relationships to enhance modeling capabilities.
Findings
Achieves state-of-the-art performance on 11 datasets.
Surpasses existing SSMs in accuracy and efficiency.
Demonstrates versatility across vision and time series tasks.
Abstract
State Space Models (SSMs) are powerful tools for modeling sequential data in computer vision and time series analysis domains. However, traditional SSMs are limited by fixed, one-dimensional sequential processing, which restricts their ability to model non-local interactions in high-dimensional data. While methods like Mamba and VMamba introduce selective and flexible scanning strategies, they rely on predetermined paths, which fails to efficiently capture complex dependencies. We introduce Graph-Generating State Space Models (GG-SSMs), a novel framework that overcomes these limitations by dynamically constructing graphs based on feature relationships. Using Chazelle's Minimum Spanning Tree algorithm, GG-SSMs adapt to the inherent data structure, enabling robust feature propagation across dynamically generated graphs and efficiently modeling complex dependencies. We validate GG-SSMs on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference
MethodsMamba: Linear-Time Sequence Modeling with Selective State Spaces
