arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.04775math.DScs.LGstat.ML
收藏

从数据中学习动力系统:基于梯度的字典优化

Learning dynamical systems from data: Gradient-based dictionary optimization

Maxwell Institute for Mathematical Sciences, University of Edinburgh and Heriot–Watt University(麦克斯韦数学科学研究所,爱丁堡大学和赫瑞斯泰学院);Department of Mathematics, City University of Hong Kong(香港城市大学数学系);School of Mathematical and Computer Sciences, Heriot–Watt University(赫瑞斯泰大学数学与计算机科学学院)

Mohammad Tabish, Neil K. Chada, Stefan Klus

AI总结:

针对数据驱动逼近Koopman算子时基函数选择依赖先验知识的问题,提出一种基于梯度下降的字典优化框架,可结合EDMD等方法从数据中学习可解释基函数,在多个基准问题上验证了有效性。

摘要:

Koopman算子在分析动力系统的全局行为中起着至关重要的作用。现有的用于逼近Koopman算子或发现底层系统控制方程的数据驱动方法,通常需要一组固定的基函数,也称为字典。基函数的最优选择高度依赖于具体问题,且通常需要领域知识。我们提出了一种新颖的基于梯度下降的优化框架,用于从数据中学习合适且可解释的基函数,并展示了如何将其与EDMD、SINDy和PDE-FIND结合使用。我们借助各种基准问题(如Ornstein-Uhlenbeck过程、Chua电路、非线性热方程以及蛋白质折叠数据)阐明了所提方法的有效性。

英文摘要:

The Koopman operator plays a crucial role in analyzing the global behavior of dynamical systems. Existing data-driven methods for approximating the Koopman operator or discovering the governing equations of the underlying system typically require a fixed set of basis functions, also called dictionary. The optimal choice of basis functions is highly problem-dependent and often requires domain knowledge. We present a novel gradient descent-based optimization framework for learning suitable and interpretable basis functions from data and show how it can be used in combination with EDMD, SINDy, and PDE-FIND. We illustrate the efficacy of the proposed approach with the aid of various benchmark problems such as the Ornstein-Uhlenbeck process, Chua's circuit, a nonlinear heat equation, as well as protein-folding data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑