REVIEW 2 cited by
Variance representations and convergence rates for data-driven approximations of Koopman operators
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We rigorously derive novel error bounds for extended dynamic mode decomposition (EDMD) to approximate the Koopman operator for discrete- and continuous time (stochastic) systems; both for i.i.d. and ergodic sampling under non-restrictive assumptions. We show exponential convergence rates for i.i.d. sampling and provide the first superlinear convergence rates for ergodic sampling of deterministic systems. The proofs are based on novel exact variance representations for the empirical estimators of mass and stiffness matrix. Moreover, we verify the accuracy of the derived error bounds and convergence rates by means of numerical simulations for highly-complex dynamical systems including a nonlinear partial differential equation.
Forward citations
Cited by 2 Pith papers
-
Sample-Efficient Online Control Policy Learning with Real-Time Recursive Model Updates
Recursive least-squares updates of Koopman models let a model-predictive controller learn a soft-robot balancing task with about one-eightieth of the training time used by a reinforcement-learning baseline.
-
Two-component controller design to safeguard data-driven predictive control
A two-controller architecture that uses a funnel controller to guarantee output constraints while a DeePC or EDMD-based predictive controller learns, permitting safe online data collection and tracking.
Discussion (0). Continue with ORCID to comment.