← 返回信息流

arXiv cs.LG论文

使用基于核函数的自编码器进行Koopman嵌入的数据驱动学习的双层优化

arxiv.org作者:Joel-Pascal Ntwali N'konzi, Feliks N\"{u}ske, Stefan Klus论文AI评分:70/100

该论文针对Koopman算子理论在非线性动力系统建模中的应用,解决了传统扩展动态模态分解(EDMD)需要预先指定字典的局限性。研究提出利用机器学习方法从数据中学习字典,并采用基于核函数的自编码器结合双层优化策略来学习Koopman嵌入,旨在提升数据驱动建模的效果。

这篇是正式发表的长论文,站内提供中文解读,全文请到原文阅读 PDF。

Abstract:Koopman operator theory provides a linear framework for analyzing nonlinear dynamical systems and has become a major tool for data-driven modeling. A central challenge, however, is that finite-dimensional approximations computed by methods such as extended dynamic mode decomposition (EDMD) require the dictionary to be specified a priori. Recent machine-learning approaches address this limitation by learning the dictionary from data, predominantly using artificial neural network (ANN) autoencoder architectures. Although kernel methods offer an alternative with greater interpretability and tractability for theoretical analysis, they have received little attention in this setting. We introduce extended dynamic mode decomposition with kernel-based dictionary learning (EDMD-kDL), a kernel-based method for learning finite-dimensional Koopman embeddings directly from data. The method combines ideas from collocation methods and bilevel optimization to simultaneously learn a kernel dictionary and the corresponding Koopman approximation. We evaluate EDMD-kDL against state-of-the-art ANN-based approaches on a range of numerical experiments, including global sea-surface-temperature forecasting and learning directly from video data. Across all tested settings, EDMD-kDL achieves performance comparable to or better than the ANN-based methods. Moreover, in contrast to standard kernel methods, the proposed approach is scalable to large datasets by design since the size of the required kernel matrices depends on the number of collocation points rather than the size of the training dataset.

阅读原文