4.7 Article

Low Rank and Structured Modeling of High-Dimensional Vector Autoregressions

期刊

IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 67, 期 5, 页码 1207-1222

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2018.2887401

关键词

Lasso; group lasso; nuclear norm; low rank; vector autoregression; probabilistic bounds; identifiability; fast algorithm

资金

  1. University of Florida Informatics Institute Fellowship [DMS-1812128]
  2. [IIS-1632730]
  3. [CNS-1422078]
  4. [CCF-1540093]
  5. [DMS-1545277]

向作者/读者索取更多资源

Network modeling of high-dimensional time series data is a key learning task due to its widespread use in a number of application areas, including macroeconomics, finance, and neuroscience. While the problem of sparse modeling based on vector autoregressive models (VAR) has been investigated in depth in the literature, more complex network structures that involve low rank and group sparse components have received considerably less attention, despite their presence in data. Failure to account for low-rank structures results in spurious connectivity among the observed time series, which may lead practitioners to draw incorrect conclusions about pertinent scientific or policy questions. In order to accurately estimate a network of Granger causal interactions after accounting for latent effects, we introduce a novel approach for estimating low-rank and structured sparse high-dimensional VAR models. We introduce a regularized framework involving a combination of nuclear norm and lasso (or group lasso) penalties. Subsequently, we establish nonasymptotic probabilistic upper bounds on the estimation error rates of the low-rank and the structured sparse components. We also introduce a fast estimation algorithm and finally demonstrate the performance of theproposed modeling framework over standard sparse VAR estimates through numerical experiments on synthetic and real data.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据