arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.04470cs.LGcs.AI
收藏

用于网络对齐的分层多边际最优传输

Hierarchical Multi-Marginal Optimal Transport for Network Alignment

University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Amazon(亚马逊);Meta

Zhichen Zeng, Boxin Du, Si Zhang, Yinglong Xia, Zhining Liu, Hanghang Tong

AI总结:

针对多网络对齐解空间大且缺高阶度量的问题,提出HOT框架,通过FGW barycenter分解网络并推广FGW距离至多边际设置实现联合对齐,实验证明其在有效性和可扩展性上显著优于现有技术。

摘要:

寻找跨网络的节点对应关系,即多网络对齐,是多网络联合学习的必要前提。尽管在成对网络对齐方面取得了巨大成功,但由于解空间呈指数级增长且缺乏高阶差异度量,关于多网络对齐的文献十分稀少。为了填补这一空白,我们提出了一个名为HOT的分层多边际最优传输框架用于多网络对齐。为了处理庞大的解空间,通过fused Gromov-Wasserstein (FGW) barycenter将多个网络分解为更小的对齐簇。为了描绘多个网络间的高阶关系,将FGW距离推广到多边际设置,基于此可以联合对齐网络。进一步开发了一种快速近端点方法,并保证收敛到局部最优。大量实验和分析表明,我们提出的HOT在有效性和可扩展性方面均比现有技术取得了显著改进。

英文摘要:

Finding node correspondence across networks, namely multi-network alignment, is an essential prerequisite for joint learning on multiple networks. Despite great success in aligning networks in pairs, the literature on multi-network alignment is sparse due to the exponentially growing solution space and lack of high-order discrepancy measures. To fill this gap, we propose a hierarchical multi-marginal optimal transport framework named HOT for multi-network alignment. To handle the large solution space, multiple networks are decomposed into smaller aligned clusters via the fused Gromov-Wasserstein (FGW) barycenter. To depict high-order relationships across multiple networks, the FGW distance is generalized to the multi-marginal setting, based on which networks can be aligned jointly. A fast proximal point method is further developed with guaranteed convergence to a local optimum. Extensive experiments and analysis show that our proposed HOT achieves significant improvements over the state-of-the-art in both effectiveness and scalability.

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

↑