Invariant Measures for Data-Driven Dynamical System Identification: Analysis and Application
Jonah Botvinick-Greenhouse

TL;DR
This paper introduces a robust, invariant-measure-based method for dynamical system identification that leverages PDE-constrained optimization, adaptive discretization, and time-delay embedding to improve accuracy and scalability.
Contribution
It presents a novel Eulerian approach using invariant measures, enhances PDE models with adaptive meshes, and applies Takens' theory for guaranteed system identifiability from data.
Findings
Effective in noisy and chaotic environments
Scalable to high-dimensional systems
Guarantees unique system identification
Abstract
We propose a novel approach for performing dynamical system identification, based upon the comparison of simulated and observed physical invariant measures. While standard methods adopt a Lagrangian perspective by directly treating time-trajectories as inference data, we take on an Eulerian perspective and instead seek models fitting the observed global time-invariant statistics. With this change in perspective, we gain robustness against pervasive challenges in system identification including noise, chaos, and slow sampling. In the first half of this paper, we pose the system identification task as a partial differential equation (PDE) constrained optimization problem, in which synthetic stationary solutions of the Fokker-Planck equation, obtained as fixed points of a finite-volume discretization, are compared to physical invariant measures extracted from observed trajectory data. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsControl Systems and Identification · Target Tracking and Data Fusion in Sensor Networks · Gaussian Processes and Bayesian Inference
MethodsADaptive gradient method with the OPTimal convergence rate
