arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.16078cs.LG
收藏

超越时空表示:时间图的进化傅里叶变换

Beyond Spatio-Temporal Representations: Evolving Fourier Transform for Temporal Graphs

HERE Technologies(HERE科技公司);Indian Institute of Technology Hyderabad(印度理工学院海得拉巴分校);RWTH Aachen(亚琛工业大学);Cerence Gmbh(Cerence有限公司);The University of Tokyo(东京大学)

Anson Bastos, Kuldeep Singh, Abhishek Nadgeri, Manish Singh, Toyotaro Suzumura

AI总结:

本文提出进化图傅里叶变换(EFT),一种可逆谱变换,通过优化连续时间动态图的拉普拉斯矩阵并采用伪谱松弛,高效捕捉时间图的进化表示,在多个基准上达到最先进性能。

摘要:

我们提出了进化图傅里叶变换(EFT),这是第一个可逆的谱变换,能够捕捉时间图上的进化表示。我们的工作动机源于现有方法在捕捉进化图谱方面的不足,这些方法由于时间维度和图顶点域的存在而计算成本高昂。我们将该问题视为对连续时间动态图的拉普拉斯矩阵的优化。此外,我们提出了伪谱松弛方法,将变换过程分解,使其高度计算高效。EFT方法能够熟练地捕捉进化图的结构和位置属性,使其在进化图的下游任务中表现出色。因此,作为参考实现,我们开发了一个简单的神经网络模型,引入EFT来捕捉进化图谱。我们在多个大规模和标准时间图基准上实证验证了我们的理论发现,并证明我们的模型达到了最先进的性能。

英文摘要:

We present the Evolving Graph Fourier Transform (EFT), the first invertible spectral transform that captures evolving representations on temporal graphs. We motivate our work by the inadequacy of existing methods for capturing the evolving graph spectra, which are also computationally expensive due to the temporal aspect along with the graph vertex domain. We view the problem as an optimization over the Laplacian of the continuous time dynamic graph. Additionally, we propose pseudo-spectrum relaxations that decompose the transformation process, making it highly computationally efficient. The EFT method adeptly captures the evolving graph's structural and positional properties, making it effective for downstream tasks on evolving graphs. Hence, as a reference implementation, we develop a simple neural model induced with EFT for capturing evolving graph spectra. We empirically validate our theoretical findings on a number of large-scale and standard temporal graph benchmarks and demonstrate that our model achieves state-of-the-art performance.

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

↑