On Sparse High-Dimensional Graphical Model Learning For Dependent Time Series
arXiv:2111.07897 · doi:10.1016/j.sigpro.2022.108539
Abstract
We consider the problem of inferring the conditional independence graph (CIG) of a sparse, high-dimensional stationary multivariate Gaussian time series. A sparse-group lasso-based frequency-domain formulation of the problem based on frequency-domain sufficient statistic for the observed time series is presented. We investigate an alternating direction method of multipliers (ADMM) approach for optimization of the sparse-group lasso penalized log-likelihood. We provide sufficient conditions for convergence in the Frobenius norm of the inverse PSD estimators to the true value, jointly across all frequencies, where the number of frequencies are allowed to increase with sample size. This results also yields a rate of convergence. We also empirically investigate selection of the tuning parameters based on Bayesian information criterion, and illustrate our approach using numerical examples utilizing both synthetic and real data.
arXiv comment20 pages, 5 figures. Published in Signal Processing. Latest version (June 4, 2024) corrects some typos
References in corpus (12)
- High-dimensional graphs and variable selection with the Lasso
- A note on the group lasso and a sparse group lasso
- Sparse permutation invariant covariance estimation
- Sparsistency and rates of convergence in large covariance matrix estimation
- Compound Rank-k Projections for Bilinear Analysis
- Graphical modelling of multivariate time series
- A convex pseudo-likelihood framework for high dimensional partial correlation estimation with convergence guarantees
- Node-Based Learning of Multiple Gaussian Graphical Models
- Learning the Conditional Independence Structure of Stationary Time Series: A Multitask Learning Approach
- Graph Estimation From Multi-attribute Data
- An Efficient Approach to Graphical Modelling of Time Series
- Bayesian Structure Learning for Stationary Time Series