arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.07867cs.LGcs.SIeess.SP
收藏

SGL:从测量中学习谱图

SGL: Spectral Graph Learning from Measurements

Stevens Institute of Technology(史蒂文斯理工学院)

Zhuo Feng

摘要:

这项工作介绍了一个高度可扩展的频谱图致密化框架学习电阻网络的线性测量,如节点电压和电流。我们证明,给定$O(\log N)$对的电压和电流测量,它是可能的,以恢复超稀疏$N$节点电阻网络,可以很好地保持有效的电阻距离的图。此外,学习的图保留了原始图的结构(频谱)属性,这可能会在许多电路设计和优化任务中被利用。我们证明了所提出的图学习方法等价于求解具有Laplacian精度矩阵的经典图形Lasso问题。通过对各种真实测试用例的广泛实验,我们表明所提出的方法对于学习超稀疏电阻网络具有高度可扩展性,而不会牺牲解决方案的质量。

英文摘要:

This work introduces a highly scalable spectral graph densification framework for learning resistor networks with linear measurements, such as node voltages and currents. We prove that given $O(\log N)$ pairs of voltage and current measurements, it is possible to recover ultra-sparse $N$-node resistor networks which can well preserve the effective resistance distances on the graph. Also, the learned graphs preserve the structural (spectral) properties of the original graph, which can potentially be leveraged in many circuit design and optimization tasks. We show that the proposed graph learning approach is equivalent to solving the classical graphical Lasso problems with Laplacian-like precision matrices. Through extensive experiments for a variety of real-world test cases, we show that the proposed approach is highly scalable for learning ultra-sparse resistor networks without sacrificing solution quality.

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

↑