AI & ML
A Second-Order Stochastic Dynamic Mode Decomposition by Richardson Extrapolation
arXiv cs.NA0 views
arXiv:2611.00793v2 Announce Type: replace Abstract: Stochastic dynamic mode decomposition (SDMD) approximates the Koopman semigroup of an It\^o diffusion by a Galerkin generator matrix on a dictionary of observables, computed from samples of the invariant law and generator evaluations, and advances observables with a first-order stochastic Taylor step (SDMD-1). The second-order Taylor step (SDMD-2) also needs a third matrix, a dictionary with four derivatives, and a fourth-order differential operator evaluated at every sample. Richardson extrapolation of the SDMD-1 step (SDMD-R) is second-order accurate with the data, the matrices, and the regularity of SDMD-1. The error bound, for exact and empirical matrices, consists of the Galerkin error of the dictionary, a time-stepping term, and a data term of order $m^{-1/2}$ in the sample size $m$. Relative to the Galerkin semigroup, the limit of the schemes as the time step $\dt\to0$, the time-stepping error is $O(\dt^2)$ for SDMD-R and $O(\Theta_N\dt+\dt^2)$ for SDMD-2, with $\Theta_N$ the norm of the second-order Galerkin residual $\Proj_N\cA(I-\Proj_N)\cA|_{\cV_N}$, and the first-order term is attained. For reversible periodic diffusions and trigonometric dictionaries with cutoff $K$, the step restriction $\dt\lesssim K^{-2}$ makes all three schemes contractions, and the error against the Koopman semigroup on $H^\ell$ observables is $O(K^{-(\ell-2)}+\dt^p)$ plus a data term of order $K^{d+2}(m^{-1}\log K)^{1/2}$ in dimension $d$, with $p=1$ for SDMD-1 and $p=2$ for SDMD-R and SDMD-2. In experiments with trigonometric dictionaries the errors of SDMD-R and SDMD-2 differ by at most ten percent. For a spline dictionary with two derivatives, SDMD-R remains second-order accurate, whereas SDMD-2 with pointwise evaluations is first-order accurate.
Source:https://arxiv.org/abs/2611.00793PreviousThe least-squares RBF-PU method for linear elasticity in the diaphragm geometryNextImproving Matrix Exponential for Generative AI Flows: A Taylor-Based Approach Beyond Paterson--Stockmeyer
Related posts
Kusner's conjecture on equilateral sets is false
0arXiv cs.NA
Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback
0arXiv stat.ML
When Does On-Policy Interaction Help? Representational Tradeoffs in Value-Based Imitation Learning
0arXiv stat.ML
Disentangling Continuous-Time Latent Dynamics: Identifiability of Latent SDEs via Diffusion Shifts
0arXiv stat.ML
Exact Constrained Decoding for Sequence Models: Controller-Augmented Hidden Markov Models and Beyond
0arXiv stat.ML
Kernel-based potential mean-field games with unbiased random Fourier $U$-statistics
0arXiv stat.ML