Search arXivSearch

arXiv · 2508.01101

Fast and Flexible Probabilistic Forecasting of Dynamical Systems using Flow Matching and Physical Perturbation

Abstract

Learning dynamical systems from incomplete or noisy data is inherently ill-posed, as a single observation may correspond to multiple plausible futures. While physics-based ensemble forecasting relies on perturbing initial states to capture uncertainty, standard Gaussian or uniform perturbations often yield unphysical initial states in high-dimensional systems. Existing machine learning approaches address this via diffusion models, which rely on inference via computationally expensive stochastic differential equations (SDEs). We introduce a novel framework that decouples perturbation generation from propagation. First, we propose a flow matching-based generative approach to learn physically consistent perturbations of the initial conditions, avoiding artifacts caused by Gaussian noise. Second, we employ deterministic flow matching models with Ordinary Differential Equation (ODE) integrators for efficient ensemble propagation with fewer integration steps. We validate our method on nonlinear dynamical system benchmarks, including the Lotka-Volterra Predator-Prey system, MovingMNIST, and high-dimensional WeatherBench data (5.625$^\circ$). Our approach achieves state-of-the-art probabilistic scoring, as measured by the Continuous Ranked Probability Score (CRPS), and physical consistency, while offering significantly faster inference than diffusion-based baselines.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Siddharth Rout, Eldad Haber, Stephane Gaudreault. 2026-02-26. Fast and Flexible Probabilistic Forecasting of Dynamical Systems using Flow Matching and Physical Perturbation. https://arxiv.org/abs/2508.01101

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG