LEARNING A COMMON GRANGER CAUSALITY NETWORK USING A NON-CONVEX REGULARIZATION

被引:0
|
作者
Manomaisaowapak, Parinthorn [1 ]
Songsiri, Jitkomut [1 ]
机构
[1] Chulalongkorn Univ, Dept Elect Engn, Fac Engn, Bangkok, Thailand
关键词
brain connectivity; Granger causality; group sparse learning; non-convex penalty; JOINT ESTIMATION;
D O I
10.1109/icassp40776.2020.9054430
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
This paper proposes an estimation for learning a common Granger network of panel data. When vector time series are collected from several subjects belonging to a homogeneous group, a relationship structure of variables can be assumed to share the same topology, while the model parameters of individual subjects could be varied. The formulation is a regularized least-squares estimation of multiple vector autoregressive (VAR) models with a non-convex l(2,1/2)-norm penalty. The common sparsity pattern of VAR coefficients from all models can reveal a consistent network in a group level. Simulation results show that the proposed formulation achieves better accuracy of learning Granger networks than the convex group lasso formulation. Preliminary results of discovering brain connectivities from ABIDE fMRI data sets showed that sparse common networks among subjects from normal and autism groups are distinctive in some brain regions.
引用
收藏
页码:1160 / 1164
页数:5
相关论文
共 50 条
  • [1] Learning Sparse Neural Networks Using Non-Convex Regularization
    Pandit, Mohammad Khalid
    Naaz, Roohie
    Chishti, Mohammad Ahsan
    [J]. IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2022, 6 (02): : 287 - 299
  • [2] Convex Denoising using Non-Convex Tight Frame Regularization
    Parekh, Ankit
    Selesnick, Ivan W.
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2015, 22 (10) : 1786 - 1790
  • [3] A Study on GMLVQ Convex and Non-convex Regularization
    Nova, David
    Estevez, Pablo A.
    [J]. ADVANCES IN SELF-ORGANIZING MAPS AND LEARNING VECTOR QUANTIZATION, WSOM 2016, 2016, 428 : 305 - 314
  • [4] Regularization with non-convex separable constraints
    Bredies, Kristian
    Lorenz, Dirk A.
    [J]. INVERSE PROBLEMS, 2009, 25 (08)
  • [5] Manifold constrained joint sparse learning via non-convex regularization
    Liu, Jingjing
    Xiu, Xianchao
    Jiang, Xin
    Liu, Wanquan
    Zeng, Xiaoyang
    Wang, Mingyu
    Chen, Hui
    [J]. NEUROCOMPUTING, 2021, 458 : 112 - 126
  • [6] A non-convex regularization approach for compressive sensing
    Fan, Ya-Ru
    Buccini, Alessandro
    Donatelli, Marco
    Huang, Ting-Zhu
    [J]. ADVANCES IN COMPUTATIONAL MATHEMATICS, 2019, 45 (02) : 563 - 588
  • [7] A non-convex regularization approach for compressive sensing
    Ya-Ru Fan
    Alessandro Buccini
    Marco Donatelli
    Ting-Zhu Huang
    [J]. Advances in Computational Mathematics, 2019, 45 : 563 - 588
  • [8] On Tikhonov regularization with non-convex sparsity constraints
    Zarzer, Clemens A.
    [J]. INVERSE PROBLEMS, 2009, 25 (02)
  • [9] Non-convex Total Variation Regularization for Convex Denoising of Signals
    Selesnick, Ivan
    Lanza, Alessandro
    Morigi, Serena
    Sgallari, Fiorella
    [J]. JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2020, 62 (6-7) : 825 - 841
  • [10] Non-convex Total Variation Regularization for Convex Denoising of Signals
    Ivan Selesnick
    Alessandro Lanza
    Serena Morigi
    Fiorella Sgallari
    [J]. Journal of Mathematical Imaging and Vision, 2020, 62 : 825 - 841