Online Graph Learning From Time-Varying Structural Equation Models

Conference Paper (2021)
Author(s)

Alberto Natali (TU Delft - Signal Processing Systems)

Elvin Isufi (TU Delft - Multimedia Computing)

Mario Coutiño (TU Delft - Signal Processing Systems, TNO)

Geert Leus (TU Delft - Signal Processing Systems)

Research Group
Signal Processing Systems
Copyright
© 2021 A. Natali, E. Isufi, Mario Coutino, G.J.T. Leus
DOI related publication
https://doi.org/10.1109/IEEECONF53345.2021.9723163
More Info
expand_more
Publication Year
2021
Language
English
Copyright
© 2021 A. Natali, E. Isufi, Mario Coutino, G.J.T. Leus
Research Group
Signal Processing Systems
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.@en
Pages (from-to)
1579-1585
ISBN (print)
978-1-6654-5829-0
ISBN (electronic)
978-1-6654-5828-3
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Topology identification is an important problem across many disciplines, since it reveals pairwise interactions among entities and can be used to interpret graph data. In many scenarios, however, this (unknown) topology is time-varying, rendering the problem even harder. In this paper, we focus on a time-varying version of the structural equation modeling (SEM) framework, which is an umbrella of multivariate techniques widely adopted in econometrics, epidemiology and psychology. In particular, we view the linear SEM as a first-order diffusion of a signal over a graph whose topology changes over time. Our goal is to learn such time-varying topology from streaming data. To attain this goal, we propose a real-time algorithm, further accelerated by building on recent advances in time-varying optimization, which updates the time-varying solution as a new sample comes into the system. We augment the implementation steps with theoretical guarantees, and we show performances on synthetic and real datasets.

Files

Online_Graph_Learning_From_Tim... (pdf)
(pdf | 1.74 Mb)
- Embargo expired in 04-09-2022
License info not available