Telegrapher's Generative Model via Kac Flows
Richard Duong, Jannis Chemseddine, Peter K. Friz, Gabriele Steidl
TL;DR
The paper introduces a telegrapher's equation–based generative model (Kac flow) as a bounded-velocity alternative to diffusion for flow-based generation. It proves Lipschitz regularity of the probability flow in Wasserstein space, derives analytic conditional velocity fields for 1D Dirac starts, and shows convergence to diffusion in appropriate limits; it further extends to multi-D via independent coordinate-wise Kac processes with explicit velocity decompositions. A neural network is trained via conditional flow matching to approximate the velocity fields, leveraging the decomposed structure for scalable learning and sampling. Numerical experiments demonstrate robustness to velocity explosions, improved recovery of Dirac-like modes in 2D, and competitive image generation on CIFAR-10, highlighting practical advantages over diffusion-based methods. Overall, the framework provides a principled, physics-inspired, and scalable approach to flow-based generations with bounded velocities and explicit velocity-field structure.
Abstract
We break the mold in flow-based generative modeling by proposing a new model based on the damped wave equation, also known as telegrapher's equation. Similar to the diffusion equation and Brownian motion, there is a Feynman-Kac type relation between the telegrapher's equation and the stochastic Kac process in 1D. The Kac flow evolves stepwise linearly in time, so that the probability flow is Lipschitz continuous in the Wasserstein distance and, in contrast to diffusion flows, the norm of the velocity is globally bounded. Furthermore, the Kac model has the diffusion model as its asymptotic limit. We extend these considerations to a multi-dimensional stochastic process which consists of independent 1D Kac processes in each spatial component. We show that this process gives rise to an absolutely continuous curve in the Wasserstein space and compute the conditional velocity field starting in a Dirac point analytically. Using the framework of flow matching, we train a neural network that approximates the velocity field and use it for sample generation. Our numerical experiments demonstrate the scalability of our approach, and show its advantages over diffusion models.
