Low Rank and Structured Modeling of High-Dimensional Vector Autoregressions

被引:46
作者
Basu, Sumanta [1 ]
Li, Xianqi [2 ]
Michailidis, George [3 ,4 ,5 ,6 ]
机构
[1] Cornell Univ, Dept Stat Sci, Ithaca, NY 14850 USA
[2] Harvard Med Sch, Massachusetts Gen Hosp, Athinoula A Martinos Ctr Biomed Imaging, Boston, MA 02115 USA
[3] Univ Florida, Dept Stat, Gainesville, FL 32611 USA
[4] Univ Florida, Dept Comp & Informat Sci, Gainesville, FL 32611 USA
[5] Univ Florida, Dept Engn, Gainesville, FL 32611 USA
[6] Univ Florida, Informat Inst, Gainesville, FL 32611 USA
关键词
Lasso; group lasso; nuclear norm; low rank; vector autoregression; probabilistic bounds; identifiability; fast algorithm; THRESHOLDING ALGORITHM; MATRIX; CAUSALITY; SPARSITY; IDENTIFICATION; DECOMPOSITION;
D O I
10.1109/TSP.2018.2887401
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1207 / 1222
页数:16
相关论文
共 41 条
  • [1] NOISY MATRIX DECOMPOSITION VIA CONVEX RELAXATION: OPTIMAL RATES IN HIGH DIMENSIONS
    Agarwal, Alekh
    Negahban, Sahand
    Wainwright, Martin J.
    [J]. ANNALS OF STATISTICS, 2012, 40 (02) : 1171 - 1197
  • [2] [Anonymous], 2002, THESIS STANFORD U
  • [3] [Anonymous], ARXIV11081548
  • [4] LARGE BAYESIAN VECTOR AUTO REGRESSIONS
    Banbura, Marta
    Giannone, Domenico
    Reichlin, Lucrezia
    [J]. JOURNAL OF APPLIED ECONOMETRICS, 2010, 25 (01) : 71 - 92
  • [5] 2-POINT STEP SIZE GRADIENT METHODS
    BARZILAI, J
    BORWEIN, JM
    [J]. IMA JOURNAL OF NUMERICAL ANALYSIS, 1988, 8 (01) : 141 - 148
  • [6] Basu S., 2019, A system-wide approach to measure connectivity in the financial sector, DOI [10.2139/ssrn.2816137, DOI 10.2139/SSRN.2816137]
  • [7] Basu S, 2015, J MACH LEARN RES, V16, P417
  • [8] REGULARIZED ESTIMATION IN SPARSE HIGH-DIMENSIONAL TIME SERIES MODELS
    Basu, Sumanta
    Michailidis, George
    [J]. ANNALS OF STATISTICS, 2015, 43 (04) : 1535 - 1567
  • [9] A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
    Beck, Amir
    Teboulle, Marc
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01): : 183 - 202
  • [10] Econometric measures of connectedness and systemic risk in the finance and insurance sectors
    Billio, Monica
    Getmansky, Mila
    Lo, Andrew W.
    Pelizzon, Loriana
    [J]. JOURNAL OF FINANCIAL ECONOMICS, 2012, 104 (03) : 535 - 559