DG-Mamba: Robust and Efficient Dynamic Graph Structure Learning with Selective State Space Models
Haonan Yuan, Qingyun Sun, Zhaonan Wang, Xingcheng Fu, Cheng Ji,, Yongjian Wang, Bo Jin, Jianxin Li

TL;DR
DG-Mamba introduces a robust, efficient framework for dynamic graph structure learning that reduces complexity and enhances global dependency capture using state space models and self-supervision, outperforming existing methods in robustness and efficiency.
Contribution
The paper proposes DG-Mamba, a novel dynamic graph structure learning method combining kernelized message passing and state space models for improved robustness and efficiency.
Findings
Reduces quadratic complexity to linear in structure learning.
Enhances robustness against adversarial attacks.
Outperforms state-of-the-art baselines in experiments.
Abstract
Dynamic graphs exhibit intertwined spatio-temporal evolutionary patterns, widely existing in the real world. Nevertheless, the structure incompleteness, noise, and redundancy result in poor robustness for Dynamic Graph Neural Networks (DGNNs). Dynamic Graph Structure Learning (DGSL) offers a promising way to optimize graph structures. However, aside from encountering unacceptable quadratic complexity, it overly relies on heuristic priors, making it hard to discover underlying predictive patterns. How to efficiently refine the dynamic structures, capture intrinsic dependencies, and learn robust representations, remains under-explored. In this work, we propose the novel DG-Mamba, a robust and efficient Dynamic Graph structure learning framework with the Selective State Space Models (Mamba). To accelerate the spatio-temporal structure learning, we propose a kernelized dynamic…
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.
Code & Models
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks
