arXiv Machine Learning

Operator learning for solving Fokker-Planck equations with various initial conditions

arXiv:2606. 09434v1 Announce Type: new Abstract: The Fokker-Planck equation (FPE) plays a pivotal role in describing the time evolution of probability density functions (PDFs) for systems governed by stochastic dynamics.

arXiv Machine Learning
Jun 30

Neural Galerkin Normalizing Flow for Transition Probability Density Functions of Diffusion Models

arXiv:2603. 18907v2 Announce Type: replace Abstract: We propose a new Neural Galerkin Normalizing Flow framework to approximate the transition probability density function of a diffusion process by solving the corresponding Fokker-Planck equation with an atomic initial distribution, parametrically with respect to the location of the initial mass.

By Riccardo Saporiti, Fabio Nobile
Hugging Face Trending Papers
Jun 3

Neural Galerkin Normalizing Flows for Bayesian Inference of Diffusions with Inaccessible Boundaries

One of the primary challenges in Bayesian inference on the parameters of a diffusion model from discrete observations is the unavailability of an analytical expression for the transition density function between consecutive observation times, which is needed to derive the likelihood function. Extending previous studies that solve Fokker-Planck (FP) type partial differential equations with Normalizing Flows, we propose a new Normalizing Flow architecture to learn the transition density function of the diffusion process between two observation times.

arXiv Machine Learning
Aug 20

Self-supervised In-context Operator Learning for Stochastic Mean-Field Control

The paper introduces a mesh‑free, self‑supervised neural operator—called the Normalizing Flow Invertible Solution Transformer (NFIST)—for stochastic mean‑field control (MFC). By reformulating the controlled Fokker–Planck dynamics as a deterministic continuity equation via a probability‑flow ODE and an invertible normalizing‑flow transformer, the authors enable closed‑form score evaluation with linear cost per particle. The resulting operator learns from task prompts (distribution parameters or particle clouds) and can solve unseen MFC tasks in a single forward pass, achieving zero‑shot generalization across applications such as stochastic optimal control, Schrödinger bridges, systemic‑risk control, and obstacle‑avoiding path planning.

By Suyi Gao, Mo Zhou, Rongjie Lai
arXiv Machine Learning
Jun 4

Neural Galerkin Normalizing Flows for Bayesian Inference of Diffusions with Inaccessible Boundaries

arXiv:2606. 04324v1 Announce Type: new Abstract: One of the primary challenges in Bayesian inference on the parameters of a diffusion model from discrete observations is the unavailability of an analytical expression for the transition density function between consecutive observation times, which is needed to derive the likelihood function.

By Riccardo Saporiti, Fabio Nobile
arXiv Machine Learning
Jul 22

Neural Kolmogorov Equations: Parallelizable Learning of Stochastic Dynamics under General Noise

arXiv:2607. 19173v1 Announce Type: new Abstract: Neural stochastic differential equations (SDEs) have emerged as powerful tools for learning noisy or stochastic dynamics directly from data; however, existing approaches largely assume uncoupled and continuous noise, limiting their applicability to realistic stochastic drivers, and often scale poorly in time, requiring expensive autoregressive training.

By Arthur Bizzi, Olga Fink
arXiv Machine Learning
Aug 27

Data-driven Effective Modeling of Stochastic Chemical Reaction Networks

The paper introduces a data-driven effective model for stochastic chemical reaction networks that bypasses the high computational cost of the Stochastic Simulation Algorithm (SSA). By approximating the finite-time transition kernel of the SSA-induced continuous-time Markov chain with a generative machine learning model, the method operates on a user-defined coarse time step independent of microscopic reaction events. Using a conditional normalizing flow as the stochastic propagator, the trained model recursively generates statistically consistent trajectories, achieving significant computational savings while maintaining accuracy, as demonstrated through numerous numerical examples.

By Yuan Chen, Weize Mao, Dongbin Xiu