mlsanityData to 7 Oct 2026

Online Non-linear Topology Identification from Graph-connected Time Series

arXiv 2104.00030 ↗First posted 31 Mar 2021eess.SPcited by 8

Not on the map. Why?

Abstract (arXiv)

Estimating the unknown causal dependencies among graph-connected time series plays an important role in many applications, such as sensor network analysis, signal processing over cyber-physical systems, and finance engineering. Inference of such causal dependencies, often know as topology identification, is not well studied for non-linear non-stationary systems, and most of the existing methods are batch-based which are not capable of handling streaming sensor signals. In this paper, we propose an online kernel-based algorithm for topology estimation of non-linear vector autoregressive time series by solving a sparse online optimization framework using the composite objective mirror descent method. Experiments conducted on real and synthetic data sets show that the proposed algorithm outperforms the state-of-the-art methods for topology estimation.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Mar 2021.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 0; 2023: 1; 2024: 3.

8 papers.