Close

Presentation

SGL: Spectral Graph Learning from Measurements
Time
Location
Event Type
Research Manuscript
Virtual Programs
Hosted in Virtual Platform
Keywords
Digital Design, Timing and Simulation
Topics
EDA
DescriptionThis work introduces a highly-scalable spectral densification framework for learning resistor networks with linear measurements, such as node voltages and currents. We show that given O(log N) pairs of voltage and current measurements, it is possible to recover ultra-sparse N-node resistor networks that can well preserve the effective resistance distances on the graph. In addition, the learned graphs also preserve the structural (spectral) properties of the original graph, which can potentially be leveraged in many circuit design and optimization tasks. Compared with prior state-of-the-art graph learning approaches, our approach is more scalable for learning large networks without sacrificing solution quality.