Dynestyx: A Probabilistic Programming Library for Dynamical Systems
- URL: http://arxiv.org/abs/2606.16985v1
- Date: Mon, 15 Jun 2026 17:23:30 GMT
- Title: Dynestyx: A Probabilistic Programming Library for Dynamical Systems
- Abstract summary: State-space models (SSMs) are the standard formalism for Bayesian treatment of dynamical systems.<n>We introduce dynestyx, a probabilistic programming library with first-class support for SSMs.
- Score: 3.956533305348252
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: State-space models (SSMs) are the standard formalism for Bayesian treatment of dynamical systems, with natural applications in statistics, signal processing, and machine learning. Despite their importance in both theory and application, dynamical systems have proven difficult to incorporate in modern probabilistic programming languages (PPLs), making state-of-the-art methods less accessible to practitioners and introducing friction in following the "Bayesian workflow." We introduce dynestyx, a probabilistic programming library with first-class support for SSMs, including state-of-the-art methods in the estimation of both states and parameters. Through a single, unified interface, users may specify arbitrary priors for discrete-time or continuous-time dynamical systems, perform inference over mixed-effect data, and make state and parameter estimates with principled uncertainty quantification.
Related papers
- Data-driven stochastic reduced-order modeling of parametrized dynamical systems [3.5684665108045377]
We introduce a data-driven framework for learning continuous-time ROMs that generalize across parameter spaces and forcing conditions.<n>We demonstrate excellent generalization to unseen parameter combinations and forcings, and significant efficiency gains compared to existing approaches.
arXiv Detail & Related papers (2026-01-15T18:50:18Z) - Reinforcement learning based data assimilation for unknown state model [3.032674692886751]
We propose a novel method that integrates reinforcement learning with ensemble-based Bayesian ffltering methods.<n>The proposed framework accommodates a wide range of observation scenarios, including nonlinear and partially observed measurement models.<n>A few numerical examples demonstrate that the proposed method achieves superior accuracy and robustness in high-dimensional settings.
arXiv Detail & Related papers (2025-11-04T05:58:37Z) - Efficient Parametric SVD of Koopman Operator for Stochastic Dynamical Systems [51.54065545849027]
The Koopman operator provides a principled framework for analyzing nonlinear dynamical systems.<n>VAMPnet and DPNet have been proposed to learn the leading singular subspaces of the Koopman operator.<n>We propose a scalable and conceptually simple method for learning the top-$k$ singular functions of the Koopman operator.
arXiv Detail & Related papers (2025-07-09T18:55:48Z) - Efficient Transformed Gaussian Process State-Space Models for Non-Stationary High-Dimensional Dynamical Systems [49.819436680336786]
We propose an efficient transformed Gaussian process state-space model (ETGPSSM) for scalable and flexible modeling of high-dimensional, non-stationary dynamical systems.<n>Specifically, our ETGPSSM integrates a single shared GP with input-dependent normalizing flows, yielding an expressive implicit process prior that captures complex, non-stationary transition dynamics.<n>Our ETGPSSM outperforms existing GPSSMs and neural network-based SSMs in terms of computational efficiency and accuracy.
arXiv Detail & Related papers (2025-03-24T03:19:45Z) - Learning Controlled Stochastic Differential Equations [61.82896036131116]
This work proposes a novel method for estimating both drift and diffusion coefficients of continuous, multidimensional, nonlinear controlled differential equations with non-uniform diffusion.
We provide strong theoretical guarantees, including finite-sample bounds for (L2), (Linfty), and risk metrics, with learning rates adaptive to coefficients' regularity.
Our method is available as an open-source Python library.
arXiv Detail & Related papers (2024-11-04T11:09:58Z) - Higher order quantum reservoir computing for non-intrusive reduced-order models [0.0]
Quantum reservoir computing technique (QRC) is a hybrid quantum-classical framework employing an ensemble of interconnected small quantum systems.
We show that QRC is able to predict complex nonlinear dynamical systems in a stable and accurate manner.
arXiv Detail & Related papers (2024-07-31T13:37:04Z) - Gaussian process learning of nonlinear dynamics [0.0]
We propose a new method that learns nonlinear dynamics through a Bayesian inference of characterizing model parameters.
We will discuss the applicability of the proposed method to several typical scenarios for dynamical systems.
arXiv Detail & Related papers (2023-12-19T14:27:26Z) - Sampling-Free Probabilistic Deep State-Space Models [28.221200872943825]
A Probabilistic Deep SSM generalizes to dynamical systems of unknown parametric form.
We propose the first deterministic inference algorithm for models of this type.
arXiv Detail & Related papers (2023-09-15T09:06:23Z) - Formal Controller Synthesis for Markov Jump Linear Systems with
Uncertain Dynamics [64.72260320446158]
We propose a method for synthesising controllers for Markov jump linear systems.
Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS.
We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
arXiv Detail & Related papers (2022-12-01T17:36:30Z) - An Extensible Benchmark Suite for Learning to Simulate Physical Systems [60.249111272844374]
We introduce a set of benchmark problems to take a step towards unified benchmarks and evaluation protocols.
We propose four representative physical systems, as well as a collection of both widely used classical time-based and representative data-driven methods.
arXiv Detail & Related papers (2021-08-09T17:39:09Z) - MINIMALIST: Mutual INformatIon Maximization for Amortized Likelihood
Inference from Sampled Trajectories [61.3299263929289]
Simulation-based inference enables learning the parameters of a model even when its likelihood cannot be computed in practice.
One class of methods uses data simulated with different parameters to infer an amortized estimator for the likelihood-to-evidence ratio.
We show that this approach can be formulated in terms of mutual information between model parameters and simulated data.
arXiv Detail & Related papers (2021-06-03T12:59:16Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.