Topological Schrödinger Bridge Matching

Given two boundary distributions, the Schrödinger Bridge (SB) problem seeks the "most likely" random evolution between them with respect to a reference process. It has revealed rich connections to recent machine learning methods for generative modeling and distribution matching. While these methods perform well in Euclidean domains, they are not directly applicable to topological domains such as graphs and simplicial complexes, which are crucial for data defined over network entities, such as node signals and edge flows. In this work, we propose the Topological Schrödinger Bridge problem (T SBP) for matching signal distributions on a topological domain, where we set the reference process to follow some linear tractable topology-aware stochastic dynamics such as topological heat diffusion. For the case of Gaussian boundary distributions, we derive a closed-form Gaussian topological SB in terms of its time-marginal and stochastic differential. In the general case, leveraging the well-known result, we show that the optimal process follows the forward-backward topological dynamics governed by some unknowns. Building on these results, we develop T SB-based models for matching topological signals by parameterizing the unknowns in the optimal process as (topological) neural networks and learning them through likelihood training. We validate the theoretical results and demonstrate the practical applications of T SBbased models on both synthetic and real-world networks, emphasizing the role of topology. Additionally, we discuss the connections of T SB-based models to other emerging models, and outline future directions for topological signal matching.