Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2111.13037 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914963657850880 |
|---|---|
| author | Lee, Jonghyeon De Brouwer, Edward Hamzi, Boumediene Owhadi, Houman |
| author_facet | Lee, Jonghyeon De Brouwer, Edward Hamzi, Boumediene Owhadi, Houman |
| contents | A simple and interpretable way to learn a dynamical system from data is to interpolate its vector-field with a kernel. In particular, this strategy is highly efficient (both in terms of accuracy and complexity) when the kernel is data-adapted using Kernel Flows (KF)\cite{Owhadi19} (which uses gradient-based optimization to learn a kernel based on the premise that a kernel is good if there is no significant loss in accuracy if half of the data is used for interpolation). Despite its previous successes, this strategy (based on interpolating the vector field driving the dynamical system) breaks down when the observed time series is not regularly sampled in time. In this work, we propose to address this problem by directly approximating the vector field of the dynamical system by incorporating time differences between observations in the (KF) data-adapted kernels. We compare our approach with the classical one over different benchmark dynamical systems and show that it significantly improves the forecasting accuracy while remaining simple, fast, and robust. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2111_13037 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Learning dynamical systems from data: A simple cross-validation perspective, part III: Irregularly-Sampled Time Series Lee, Jonghyeon De Brouwer, Edward Hamzi, Boumediene Owhadi, Houman Machine Learning Dynamical Systems Computation A simple and interpretable way to learn a dynamical system from data is to interpolate its vector-field with a kernel. In particular, this strategy is highly efficient (both in terms of accuracy and complexity) when the kernel is data-adapted using Kernel Flows (KF)\cite{Owhadi19} (which uses gradient-based optimization to learn a kernel based on the premise that a kernel is good if there is no significant loss in accuracy if half of the data is used for interpolation). Despite its previous successes, this strategy (based on interpolating the vector field driving the dynamical system) breaks down when the observed time series is not regularly sampled in time. In this work, we propose to address this problem by directly approximating the vector field of the dynamical system by incorporating time differences between observations in the (KF) data-adapted kernels. We compare our approach with the classical one over different benchmark dynamical systems and show that it significantly improves the forecasting accuracy while remaining simple, fast, and robust. |
| title | Learning dynamical systems from data: A simple cross-validation perspective, part III: Irregularly-Sampled Time Series |
| topic | Machine Learning Dynamical Systems Computation |
| url | https://arxiv.org/abs/2111.13037 |