dorsal/arxiv
View SchemaData-driven stochastic reduced-order modeling of parametrized dynamical systems
| Authors | Andrew F. Ilersich, Kevin Course, Prasanth B. Nair |
|---|---|
| Categories | |
| ArXiv ID | 2601.10690vv1 |
| URL | https://arxiv.org/abs/2601.10690 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Modeling complex dynamical systems under varying conditions is computationally intensive, often rendering high-fidelity simulations intractable. Although reduced-order models (ROMs) offer a promising solution, current methods often struggle with stochastic dynamics and fail to quantify prediction uncertainty, limiting their utility in robust decision-making contexts. To address these challenges, we introduce a data-driven framework for learning continuous-time stochastic ROMs that generalize across parameter spaces and forcing conditions. Our approach, based on amortized stochastic variational inference, leverages a reparametrization trick for Markov Gaussian processes to eliminate the need for computationally expensive forward solvers during training. This enables us to jointly learn a probabilistic autoencoder and stochastic differential equations governing the latent dynamics, at a computational cost that is independent of the dataset size and system stiffness. Additionally, our approach offers the flexibility of incorporating physics-informed priors if available. Numerical studies are presented for three challenging test problems, where we demonstrate excellent generalization to unseen parameter combinations and forcings, and significant efficiency gains compared to existing approaches.
{
"annotation_id": "efef09b4-737c-4ccf-a2e3-58a84eb1be52",
"date_created": "2026-02-17T05:53:26.431000Z",
"date_modified": "2026-02-17T05:53:26.431000Z",
"file_hash": "5206249581f866a94be83d13019ae0aa347c46df3e250520f1c92922647aadf7",
"private": false,
"record": {
"abstract": "Modeling complex dynamical systems under varying conditions is computationally intensive, often rendering high-fidelity simulations intractable. Although reduced-order models (ROMs) offer a promising solution, current methods often struggle with stochastic dynamics and fail to quantify prediction uncertainty, limiting their utility in robust decision-making contexts. To address these challenges, we introduce a data-driven framework for learning continuous-time stochastic ROMs that generalize across parameter spaces and forcing conditions. Our approach, based on amortized stochastic variational inference, leverages a reparametrization trick for Markov Gaussian processes to eliminate the need for computationally expensive forward solvers during training. This enables us to jointly learn a probabilistic autoencoder and stochastic differential equations governing the latent dynamics, at a computational cost that is independent of the dataset size and system stiffness. Additionally, our approach offers the flexibility of incorporating physics-informed priors if available. Numerical studies are presented for three challenging test problems, where we demonstrate excellent generalization to unseen parameter combinations and forcings, and significant efficiency gains compared to existing approaches.",
"arxiv_id": "2601.10690",
"authors": [
"Andrew F. Ilersich",
"Kevin Course",
"Prasanth B. Nair"
],
"categories": [
"cs.LG"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Data-driven stochastic reduced-order modeling of parametrized dynamical systems",
"url": "https://arxiv.org/abs/2601.10690",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "2f6a1225-7e89-4c17-b765-7191fe630857",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}