Koopman Reduced Order Modeling with Confidence Bounds
Ryan Mohr, Maria Fonoberova, Igor Mezic
TL;DR
Koopman Reduced Order Modeling with Confidence Bounds introduces a data-driven ROM that splits the Koopman evolution into a deterministic modal reconstruction and a stochastic residual, enabling distributional forecasts with confidence bounds. By modeling the residual as a Gaussian modal component within the retained subspace and an orthogonal innovation, the method constructs prediction intervals around the deterministic prediction and provides a criterion to select the minimum number of modes via a normality test. The approach is demonstrated on a linear modal system, a network of switched anharmonic oscillators, and a noisy Kuramoto model, showing that the true trajectories largely lie within the predicted bounds and that the modal count governs the bias-variance trade-off. This work offers a practical uncertainty quantification framework for data-driven Koopman ROMs, with potential applications to systems experiencing changing topology and stochastic perturbations.
Abstract
This paper introduces a reduced order modeling technique based on Koopman operator theory that gives confidence bounds on the model's predictions. It is based on a data-driven spectral decomposition of the Koopman operator. The reduced order model is constructed using a finite number of Koopman eigenvalues and modes, while the rest of spectrum is treated as a noise process. This noise process is used to extract the confidence bounds. Additionally, we propose a heuristic algorithm to choose the number of deterministic modes to keep in the model.
