SearcharxivSearch

arXiv · 2606.24691

Learning Nonlinear Dynamics: Improving the Estimation Efficiency and Reliability of Gaussian Process State-Space Models

Abstract

Understanding dynamic systems is a central goal in many scientific disciplines. State-space models provide a general framework for studying latent dynamic systems based on indirect observations. However, classical state-space methods require researchers to specify the parametric form of the system dynamics in advance, which can be challenging when the underlying processes are nonlinear and only partially explained by theory. Gaussian process state-space models address this by learning the system dynamics directly from data. However, estimating these models exactly can become computationally infeasible for moderately long time-series. In this paper, we therefore aim to improve the Bayesian estimation of approximate Gaussian process state-space models to make these models more accessible and facilitate the statistical learning of nonlinear dynamic systems in empirical research. To this end, we first propose two modifications to an existing Gibbs sampler for these models that considerably improve its sampling efficiency and convergence. Second, we use a confirmatory factor analysis measurement model, which reduces identifiability issues and allows researchers to impose a specific measurement structure on the model. Third, we provide a systematically validated software implementation of the model and sampler for applied use in empirical research. To validate the sampler, we conducted a simulation-based calibration which showed that the sampler converged reliably across many simulated data sets and produces well-calibrated posterior inferences. We further illustrate how the model can be applied and interpreted using two empirical examples. Together, these contributions provide a practical and validated workflow for learning nonlinear latent dynamics with Gaussian process state-space models.

Explore related subjects

Keep this discovery

BibTeXRIS

Jan I. Failenschmid, Leonie V. D. E. Vogelsmeier, Joris Mulder, Joran Jongerling. 2026-06-23. Learning Nonlinear Dynamics: Improving the Estimation Efficiency and Reliability of Gaussian Process State-Space Models. https://arxiv.org/abs/2606.24691

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

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO