arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.00746cs.ITcs.LGmath.ITmath.OCstat.ML
收藏

从稀疏空时样本中学习转移算子

Learning Transition Operators From Sparse Space-Time Samples

Johns Hopkins University(约翰斯·霍普金斯大学)

Christian Kümmerle, Mauro Maggioni, Sui Tang

摘要:

我们考虑学习的过渡算子$\mathbf{A}$从部分观察在不同的时间,特别是从稀疏的观察条目的权力$\mathbf{A},\mathbf{A}^2,\cdots,\mathbf{A}^{T}$的非线性逆问题。这个时空转换算子恢复问题的动机是最近的兴趣,在学习时变图形信号驱动的图形算子依赖于底层图形拓扑结构。我们解决的非线性问题嵌入到一个合适的块汉克尔矩阵的高维空间,在那里它成为一个低秩矩阵完成问题,即使$\mathbf{A}$是满秩的。对于一个统一的和自适应的随机空时采样模型,我们量化的可恢复性的过渡算子通过适当的措施,这些块汉克尔嵌入矩阵的不相干性。对于图转换算子,这些不一致性的度量取决于动态和图拓扑之间的相互作用。我们开发了一个合适的非凸迭代加权最小二乘(IRLS)算法,建立其二次局部收敛,并表明,在最佳情况下,不超过$\mathcal{O}(rn \log(nT))$时空样本足以确保准确恢复的秩$r$运营商$\mathbf{A}$的大小$n \times n$。这表明空间样本可以被相当数量的时空样本所替代。在$n$中,我们给出了一个空间复杂度为$O(r n T)$阶、每次迭代时间复杂度为线性的IRLS算法的有效实现.基于几种图模型的转换算子的数值实验证实了理论结果准确地跟踪经验相变,并说明了所提出的算法的适用性和可扩展性。

英文摘要:

We consider the nonlinear inverse problem of learning a transition operator $\mathbf{A}$ from partial observations at different times, in particular from sparse observations of entries of its powers $\mathbf{A},\mathbf{A}^2,\cdots,\mathbf{A}^{T}$. This Spatio-Temporal Transition Operator Recovery problem is motivated by the recent interest in learning time-varying graph signals that are driven by graph operators depending on the underlying graph topology. We address the nonlinearity of the problem by embedding it into a higher-dimensional space of suitable block-Hankel matrices, where it becomes a low-rank matrix completion problem, even if $\mathbf{A}$ is of full rank. For both a uniform and an adaptive random space-time sampling model, we quantify the recoverability of the transition operator via suitable measures of incoherence of these block-Hankel embedding matrices. For graph transition operators these measures of incoherence depend on the interplay between the dynamics and the graph topology. We develop a suitable non-convex iterative reweighted least squares (IRLS) algorithm, establish its quadratic local convergence, and show that, in optimal scenarios, no more than $\mathcal{O}(rn \log(nT))$ space-time samples are sufficient to ensure accurate recovery of a rank-$r$ operator $\mathbf{A}$ of size $n \times n$. This establishes that spatial samples can be substituted by a comparable number of space-time samples. We provide an efficient implementation of the proposed IRLS algorithm with space complexity of order $O(r n T)$ and per-iteration time complexity linear in $n$. Numerical experiments for transition operators based on several graph models confirm that the theoretical findings accurately track empirical phase transitions, and illustrate the applicability and scalability of the proposed algorithm.

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

↑