arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2101.00555math.NAcs.NA
收藏

关于Koopman模态分解和张量分量分析

On Koopman Mode Decomposition and Tensor Component Analysis

William T. Redman

摘要:

Koopman模式分解和张量分量分析(也称为CANDECOMP/PARAFAC或规范多元分解)是将高维数据集分解为低维模式的两种流行方法,这些模式捕获最相关的特征和/或动态。尽管它们的目标相似,但这两种方法在很大程度上被不同的科学团体使用,并以不同的数学语言表达。我们一起研究这两个,并表明,在一定的(合理的)条件下的数据,张量分量分析给出的理论分解是\textit{same}的Koopman模式分解。这提供了一座“桥梁”,两族应能通过这座桥梁更有效地沟通。当不满足这个条件时,Koopman模式分解仍然提供具有\textit{a priori}可计算误差的张量分解,提供张量分量分析所需的非凸优化的替代方案。我们的工作提供了新的可能性的算法方法Koopman模式分解和张量分量分析,提供了一个新的视角张量分量分析的成功,并建立在一个越来越多的工作表明,动力系统,特别是Koopman算子理论,可以是有用的问题,历史上利用优化理论。

英文摘要:

Koopman mode decomposition and tensor component analysis (also known as CANDECOMP/PARAFAC or canonical polyadic decomposition) are two popular approaches of decomposing high dimensional data sets into low dimensional modes that capture the most relevant features and/or dynamics. Despite their similar goal, the two methods are largely used by different scientific communities and formulated in distinct mathematical languages. We examine the two together and show that, under a certain (reasonable) condition on the data, the theoretical decomposition given by tensor component analysis is the \textit{same} as that given by Koopman mode decomposition. This provides a "bridge" with which the two communities should be able to more effectively communicate. When this condition is not met, Koopman mode decomposition still provides a tensor decomposition with an \textit{a priori} computable error, providing an alternative to the non-convex optimization that tensor component analysis requires. Our work provides new possibilities for algorithmic approaches to Koopman mode decomposition and tensor component analysis, provides a new perspective on the success of tensor component analysis, and builds upon a growing body of work showing that dynamical systems, and Koopman operator theory in particular, can be useful for problems that have historically made use of optimization theory.

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

↑