arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.17544stat.MLcs.LGmath.STstat.MEstat.TH
收藏

优化Omnibus联合图嵌入中的诱导相关性

Optimizing the Induced Correlation in Omnibus Joint Graph Embeddings

Johns Hopkins University(约翰斯·霍普金斯大学);Indiana University(印第安纳大学);Rosalind Franklin University of Medicine and Science(罗莎琳德·富兰克林医科大学);Deus Ex Machina

Konstantinos Pantazis, Michael Trosset, William N. Frost, Carey E. Priebe, Vince Lyzinski

AI总结:

本文针对Omnibus联合图嵌入中的算法诱导相关性问题,提出corr2Omni算法自动估计广义Omnibus权重以诱导最优相关性,并证明经典Omnibus构造诱导最大平坦相关性,实验表明所提算法优于经典构造。

摘要:

理论与经验证据表明,联合图嵌入算法会在嵌入空间中诱导网络之间的相关性。在Omnibus联合图嵌入框架中,先前的结果明确刻画了算法诱导相关性与模型固有相关性对嵌入网络之间相关性的双重影响。考虑并减轻算法诱导相关性是后续推断的关键,因为已有研究证明次优的Omnibus矩阵构造会导致推断保真度下降。本工作首次尝试自动化Omnibus构造,以解决该联合嵌入框架中的两个关键问题:correlation-to-OMNI问题和平坦相关性问题。在平坦相关性问题中,我们试图理解广义Omnibus嵌入所产生的最小算法诱导平坦相关性(即所有图对之间相同的相关性)。在完全一般Omnibus矩阵的一个子空间中,我们证明了该平坦相关性的下界,并证明经典Omnibus构造诱导最大的平坦相关性。在correlation-to-OMNI问题中,我们提出了一种算法——名为corr2Omni——该算法从给定的估计成对图相关矩阵出发,估计广义Omnibus权重矩阵,从而在嵌入空间中诱导最优相关性。此外,在模拟数据和真实数据设置中,我们证明了corr2Omni算法相比经典Omnibus构造具有更高的有效性。

英文摘要:

Theoretical and empirical evidence suggests that joint graph embedding algorithms induce correlation across the networks in the embedding space. In the Omnibus joint graph embedding framework, previous results explicitly delineated the dual effects of the algorithm-induced and model-inherent correlations on the correlation across the embedded networks. Accounting for and mitigating the algorithm-induced correlation is key to subsequent inference, as sub-optimal Omnibus matrix constructions have been demonstrated to lead to loss in inference fidelity. This work presents the first efforts to automate the Omnibus construction in order to address two key questions in this joint embedding framework: the correlation-to-OMNI problem and the flat correlation problem. In the flat correlation problem, we seek to understand the minimum algorithm-induced flat correlation (i.e., the same across all graph pairs) produced by a generalized Omnibus embedding. Working in a subspace of the fully general Omnibus matrices, we prove both a lower bound for this flat correlation and that the classical Omnibus construction induces the maximal flat correlation. In the correlation-to-OMNI problem, we present an algorithm -- named corr2Omni -- that, from a given matrix of estimated pairwise graph correlations, estimates the matrix of generalized Omnibus weights that induces optimal correlation in the embedding space. Moreover, in both simulated and real data settings, we demonstrate the increased effectiveness of our corr2Omni algorithm versus the classical Omnibus construction.

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

↑