G-Signatures:基于随机签名的全局图传播
G-Signatures: Global Graph Propagation With Randomized Signatures
AI总结:
针对GNNs过度平滑问题,提出G-Signatures方法,利用随机签名和潜在空间路径映射实现全局图传播,有效处理全局属性并扩展到大型图,在分类和回归任务上验证了优势。
摘要:
图神经网络(GNNs)已发展成为最流行的深度学习架构之一。然而,GNNs 存在节点信息过度平滑的问题,因此在处理与全局图属性相关的任务时表现不佳。我们引入了 G-Signatures,一种新颖的图学习方法,通过随机签名实现全局图传播。G-Signatures 使用一种新的图转换概念来嵌入图结构信息,该信息可被解释为潜在空间中的路径。我们进一步引入了潜在空间路径映射的思想,这使我们能够迭代地遍历潜在空间路径,从而全局地处理信息。G-Signatures 在提取和处理全局图属性方面表现出色,并能有效扩展到大型图问题。在实验上,我们在多个分类和回归任务上验证了 G-Signatures 的优势。
英文摘要:
Graph neural networks (GNNs) have evolved into one of the most popular deep learning architectures. However, GNNs suffer from over-smoothing node information and, therefore, struggle to solve tasks where global graph properties are relevant. We introduce G-Signatures, a novel graph learning method that enables global graph propagation via randomized signatures. G-Signatures use a new graph conversion concept to embed graph structured information which can be interpreted as paths in latent space. We further introduce the idea of latent space path mapping. This allows us to iteratively traverse latent space paths, and, thus globally process information. G-Signatures excel at extracting and processing global graph properties, and effectively scale to large graph problems. Empirically, we confirm the advantages of G-Signatures at several classification and regression tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。