Learning Networks from Wide-Sense Stationary Stochastic Processes
Anirudh Rayas, Jiajun Cheng, Rajasekhar Anguluri, Deepjyoti Deka, Gautam Dasarathy

TL;DR
This paper introduces a method to learn the structure of complex networked systems from stationary stochastic process data using a regularized maximum likelihood approach, with theoretical guarantees and real-world applications.
Contribution
It develops a convex optimization framework for support recovery of network Laplacians from spectral density data, with high-dimensional theoretical guarantees.
Findings
Supports accurate network structure recovery in high-dimensional settings
Provides theoretical guarantees under mutual incoherence conditions
Demonstrates effectiveness on synthetic and real-world datasets
Abstract
Complex networked systems driven by latent inputs are common in fields like neuroscience, finance, and engineering. A key inference problem here is to learn edge connectivity from node outputs (potentials). We focus on systems governed by steady-state linear conservation laws: , where denote inputs and potentials, respectively, and the sparsity pattern of the Laplacian encodes the edge structure. Assuming to be a wide-sense stationary stochastic process with a known spectral density matrix, we learn the support of from temporally correlated samples of via an -regularized Whittle's maximum likelihood estimator (MLE). The regularization is particularly useful for learning large-scale networks in the high-dimensional setting where the network size significantly exceeds the number…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
MethodsFocus
