Joint Association Graph Screening and Decomposition for Large-scale Linear Dynamical Systems
Yiyuan She, Yuejia He, Shijie Li, Dapeng Wu

TL;DR
This paper introduces a joint graphical screening and decomposition framework for large-scale linear dynamical systems, improving network topology identification and dynamics estimation by reducing problem complexity through the joint association graph approach.
Contribution
It proposes a novel joint graphical screening and decomposition method based on the joint association graph for efficient large-scale network learning.
Findings
Effective in reducing network complexity.
Accurate in identifying network topology.
Validated on synthetic and real data.
Abstract
This paper studies large-scale dynamical networks where the current state of the system is a linear transformation of the previous state, contaminated by a multivariate Gaussian noise. Examples include stock markets, human brains and gene regulatory networks. We introduce a transition matrix to describe the evolution, which can be translated to a directed Granger transition graph, and use the concentration matrix of the Gaussian noise to capture the second-order relations between nodes, which can be translated to an undirected conditional dependence graph. We propose regularizing the two graphs jointly in topology identification and dynamics estimation. Based on the notion of joint association graph (JAG), we develop a joint graphical screening and estimation (JGSE) framework for efficient network learning in big data. In particular, our method can pre-determine and remove unnecessary…
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.
