Low Rank and Structured Modeling of High-Dimensional Vector Autoregressions

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 the proposed modeling framework over standard sparse VAR estimates through numerical experiments on synthetic and real data.

[1]  George Michailidis,et al.  A System-Wide Approach to Measure Connectivity in the Financial Sector , 2017 .

[2]  J. Borwein,et al.  Two-Point Step Size Gradient Methods , 1988 .

[3]  Alessandro Chiuso,et al.  Sparse plus low rank network identification: A nonparametric approach , 2015, Autom..

[4]  Sumanta Basu,et al.  Modeling and Estimation of High-dimensional Vector Autoregressions. , 2014 .

[5]  Stephen P. Boyd,et al.  Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , 2003, Proceedings of the 2003 American Control Conference, 2003..

[6]  Yurii Nesterov,et al.  Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[7]  Gregory C. Reinsel,et al.  Reduced rank models for multiple time series , 1986 .

[8]  Helmut Ltkepohl,et al.  New Introduction to Multiple Time Series Analysis , 2007 .

[9]  A. Willsky,et al.  Latent variable graphical model selection via convex optimization , 2010 .

[10]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[11]  Martin J. Wainwright,et al.  Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions , 2011, ICML.

[12]  Martin J. Wainwright,et al.  A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers , 2009, NIPS.

[13]  Arindam Banerjee,et al.  Estimating Structured Vector Autoregressive Models , 2016, ICML.

[14]  Dapeng Wu,et al.  Joint Association Graph Screening and Decomposition for Large-Scale Linear Dynamical Systems , 2014, IEEE Transactions on Signal Processing.

[15]  He Jiang,et al.  Sparse estimation based on square root nonconvex optimization in high-dimensional data , 2017, Neurocomputing.

[16]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..

[17]  Pablo A. Parrilo,et al.  Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..

[18]  Mattia Zorzi,et al.  AR Identification of Latent-Variable Graphical Models , 2014, IEEE Transactions on Automatic Control.

[19]  Michele Lenza,et al.  Prior Selection for Vector Autoregressions , 2012, Review of Economics and Statistics.

[20]  Su-In Lee,et al.  Learning graphical models with hubs , 2014, J. Mach. Learn. Res..

[21]  Eduardo L. Pasiliao,et al.  Accelerated bregman operator splitting with backtracking , 2017 .

[22]  P. Stoica,et al.  Maximum likelihood methods in radar array signal processing , 1998, Proc. IEEE.

[23]  Nicholas J. Higham Computing the Nearest Correlation Matrix , 2000 .

[24]  G. Michailidis,et al.  Autoregressive models for gene regulatory network inference: sparsity, stability and causality issues. , 2013, Mathematical biosciences.

[25]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[26]  G. C. Tiao,et al.  A canonical analysis of multiple time series , 1977 .

[27]  Dapeng Wu,et al.  Stationary-sparse causality network learning , 2013, J. Mach. Learn. Res..

[28]  Qingwen Zhang,et al.  Parametric adaptive matched filter for airborne radar applications , 2000, IEEE Trans. Aerosp. Electron. Syst..

[29]  D. Giannone,et al.  Large Bayesian vector auto regressions , 2010 .

[30]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[31]  Xiaoming Yuan,et al.  Sparse and low-rank matrix decomposition via alternating direction method , 2013 .

[32]  B. Velichkovsky,et al.  Effective Connectivity within the Default Mode Network: Dynamic Causal Modeling of Resting-State fMRI Data , 2016, Front. Hum. Neurosci..

[33]  A. Banerjee,et al.  Estimating Structured Vector Autoregressive Models , 2016, ICML.

[34]  Jieping Ye,et al.  An accelerated gradient method for trace norm minimization , 2009, ICML '09.

[35]  M. V. D. Heuvel,et al.  Exploring the brain network: A review on resting-state fMRI functional connectivity , 2010, European Neuropsychopharmacology.

[36]  Ali Shojaie,et al.  Network granger causality with inherent grouping structure , 2012, J. Mach. Learn. Res..

[37]  Zhouchen Lin,et al.  Some Software Packages for Partial SVD Computation , 2011, ArXiv.

[38]  George Michailidis,et al.  Regularized Estimation and Testing for High-Dimensional Multi-Block Vector-Autoregressive Models , 2017, J. Mach. Learn. Res..

[39]  G. Michailidis,et al.  Regularized estimation in sparse high-dimensional time series models , 2013, 1311.4175.

[40]  A. Lo,et al.  Econometric Measures of Connectedness and Systemic Risk in the Finance and Insurance Sectors , 2011 .

[41]  Eunho Yang,et al.  Sparse + Group-Sparse Dirty Models: Statistical Guarantees without Unreasonable Conditions and a Case for Non-Convexity , 2017, ICML.