Stable Filters for Generative Modeling of Graph Signals

arXiv:2609.18759 · eess.SP, cs.LG, stat.ML · Submitted 2026-09-16 · Read on arXiv

eess.SP, cs.LG, stat.ML

Submitted: 2026-09-16

Updated: 2026-09-16

Comments: 5 pages, submitted to ICASSP'27

Code: https://github.com/mschmi21/stable

License: http://creativecommons.org/licenses/by/4.0/

The gist: Generating signals on graphs requires permutation-equivariant models that exhibit stability with respect to relative structural perturbations.

Terminology

Abstract

Generating signals on graphs requires permutation-equivariant models that exhibit stability with respect to relative structural perturbations. While recent graph-aware Schrödinger bridge models incorporate topology information directly into their reference dynamics, it is unclear how perturbations of the graph propagate through these dynamics and affect the resulting generated distributions. In this paper, we analyze the structural stability of graph-aware continuous-time generative models whose drift combines a graph filter with a learned graph neural network. We derive explicit Wasserstein stability bounds that quantify the effect of relative graph perturbations on the generated distributions. Motivated by these bounds, we introduce a principled framework for designing stable graph filters that preserve the smoothing behavior of graph heat diffusion, while boosting structural stability. Experiments on synthetic and fMRI signals show our stable filters enhance structural robustness while matching or exceeding the generative quality of the heat equation baseline.

Sources

Related papers