Joint learning of multiple Granger causal networks via non-convex regularizations: Inference of group-level brain connectivity
Not on the map. Why?
Abstract (arXiv)
This paper considers joint learning of multiple sparse Granger graphical models to discover underlying common and differential Granger causality (GC) structures across multiple time series. This can be applied to drawing group-level brain connectivity inferences from a homogeneous group of subjects or discovering network differences among groups of signals collected under heterogeneous conditions. By recognizing that the GC of a single multivariate time series can be characterized by common zeros of vector autoregressive (VAR) lag coefficients, a group sparse prior is included in joint regularized least-squares estimations of multiple VAR models. Group-norm regularizations based on group- and fused-lasso penalties encourage a decomposition of multiple networks into a common GC structure, with other remaining parts defined in individual-specific networks. Prior information about sparseness and sparsity patterns of desired GC networks are incorporated as relative weights, while a non-convex group norm in the penalty is proposed to enhance the accuracy of network estimation in low-sample settings. Extensive numerical results on simulations illustrated our method's improvements over existing sparse estimation approaches on GC network sparsity recovery. Our methods were also applied to available resting-state fMRI time series from the ADHD-200 data sets to learn the differences of causality mechanisms, called effective brain connectivity, between adolescents with ADHD and typically developing children. Our analysis revealed that parts of the causality differences between the two groups often resided in the orbitofrontal region and areas associated with the limbic system, which agreed with clinical findings and data-driven results in previous studies.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 71 references that are in the map. First posted on arXiv 15 May 2021.
Builds on
7 of 71 references.
References · 7
- 2015Global Convergence of ADMM in Nonconvex Nonsmooth Optimizationcited by 98
- 2018A Survey on Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learningcited by 20
- 2014Global convergence of splitting methods for nonconvex composite optimizationcited by 19
- 2017Connectivity Inference from Neural Recording Data: Challenges, Mathematical Bases and Research Directionscited by 12
- 2016Adaptive ADMM with Spectral Penalty Parameter Selectioncited by 10
- 2015Convergence of multi-block Bregman ADMM for nonconvex composite problemscited by 8
- 2016Joint Estimation of Precision Matrices in Heterogeneous Populationscited by 5
Built on by
Not cited yet.