Dynamic Regret Analysis for Online Tracking of Time-varying Structural Equation Model Topologies
Identifying dependencies among variables in a complex system is an important problem in network science. Structural equation models (SEM) have been used widely in many fields for topology inference, because they are tractable and incorporate exogenous influences in the model. Topology identification based on static SEM is useful in stationary environments; however, in many applications a time-varying underlying topology is sought. This paper presents an online algorithm to track sparse time-varying topologies in dynamic environments and most importantly, performs a detailed analysis on the performance guarantees. The tracking capability is characterized in terms of a bound on the dynamic regret of the proposed algorithm. Numerical tests show that the proposed algorithm can track changes under different models of time-varying topologies.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Regret Analysis of Online LQR Control via Trajectory Prediction and Tracking: Extended Version
In this paper, we propose and analyze a new method for online linear quadratic regulator (LQR) control with a priori unknown time-varying cost matrices. The cost matrices are revealed sequentially with the potential for …
Trajectory PredictionAdaptive and Efficient Algorithms for Tracking the Best Expert
In this paper, we consider the problem of prediction with expert advice in dynamic environments. We choose tracking regret as the performance metric and develop two adaptive and efficient algorithms with data-dependent t…
Distributed Estimation of Dynamic Parameters : Regret Analysis
This paper addresses the estimation of a time- varying parameter in a network. A group of agents sequentially receive noisy signals about the parameter (or moving target), which does not follow any particular dynamics. T…
Online Linear Quadratic Tracking with Regret Guarantees
Online learning algorithms for dynamical systems provide finite time guarantees for control in the presence of sequentially revealed cost functions. We pose the classical linear quadratic tracking problem in the framewor…
An Online Optimization Approach for Multi-Agent Tracking of Dynamic Parameters in the Presence of Adversarial Noise
This paper addresses tracking of a moving target in a multi-agent network. The target follows a linear dynamics corrupted by an adversarial noise, i.e., the noise is not generated from a statistical distribution. The loc…
Distributed Optimization