Efficient Variational Bayes Learning of Graphical Models With Smooth Structural Changes

被引:4
|
作者
Yu, Hang [1 ,2 ]
Wu, Songwei [3 ]
Dauwels, Justin [4 ]
机构
[1] Nan Yni G Technol Univ, Singapore, Singapore
[2] Ant Grp, Hangzhou 310000, Peoples R China
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[4] Delft Univ Technol, Elect Engn Math & Comp Sci, NL-2628 CD Delft, Netherlands
关键词
Graphical models; structural changes; variational inference; simulated annealing; inverse spectral density matrices; VARIABLE SELECTION; NETWORKS;
D O I
10.1109/TPAMI.2022.3140886
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Estimating a sequence of dynamic undirected graphical models, in which adjacent graphs share similar structures, is of paramount importance in various social, financial, biological, and engineering systems, since the evolution of such networks can be utilized for example to spot trends, detect anomalies, predict vulnerability, and evaluate the impact of interventions. Existing methods for learning dynamic graphical models require the tuning parameters that control the graph sparsity and the temporal smoothness to be selected via brute-force grid search. Furthermore, these methods are computationally burdensome with time complexity $\mathcal {O}(NP<^>3)$O(NP3) for $P$P variables and $N$N time points. As a remedy, we propose a low-complexity tuning-free Bayesian approach, named BASS. Specifically, we impose temporally dependent spike and slab priors on the graphs such that they are sparse and varying smoothly across time. An efficient variational inference algorithm based on natural gradients is then derived to learn the graph structures from the data in an automatic manner. Owing to the pseudo-likelihood and the mean-field approximation, the time complexity of BASS is only $\mathcal {O}(NP<^>2)$O(NP2). To cope with the local maxima problem of variational inference, we resort to simulated annealing and propose a method based on bootstrapping of the observations to generate the annealing noise. We provide numerical evidence that BASS outperforms existing methods on synthetic data in terms of structure estimation, while being more efficient especially when the dimension $P$P becomes high. We further apply the approach to the stock return data of 78 banks from 2005 to 2013 and find that the number of edges in the financial network as a function of time contains three peaks, in coincidence with the 2008 global financial crisis and the two subsequent European debt crisis. On the other hand, by identifying the frequency-domain resemblance to the time-varying graphical models, we show that BASS can be extended to learning frequency-varying inverse spectral density matrices, and further yields graphical models for multivariate stationary time series. As an illustration, we analyze scalp EEG signals of patients at the early stages of Alzheimer's disease (AD) and show that the brain networks extracted by BASS can better distinguish between the patients and the healthy controls.
引用
收藏
页码:475 / 488
页数:14
相关论文
共 50 条
  • [1] VARIATIONAL BAYES LEARNING OF MULTISCALE GRAPHICAL MODELS
    Yu, Hang
    Dauwels, Justin
    2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP), 2015, : 1891 - 1895
  • [2] VARIATIONAL BAYES LEARNING OF TIME-VARYING GRAPHICAL MODELS
    Yu, Hang
    Dauwels, Justin
    2016 IEEE 26TH INTERNATIONAL WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING (MLSP), 2016,
  • [3] Variational Bayesian Learning of Directed Graphical Models with Hidden Variables
    Beal, Matthew J.
    Ghahramani, Zoubin
    BAYESIAN ANALYSIS, 2006, 1 (04): : 793 - 831
  • [4] Semiparametric Bayes conditional graphical models for imaging genetics applications
    Kundu, Suprateek
    Kang, Jian
    STAT, 2016, 5 (01): : 322 - 337
  • [5] An introduction to variational methods for graphical models
    Jordan, MI
    Ghahramani, Z
    Jaakkola, TS
    Saul, LK
    MACHINE LEARNING, 1999, 37 (02) : 183 - 233
  • [6] An Introduction to Variational Methods for Graphical Models
    Michael I. Jordan
    Zoubin Ghahramani
    Tommi S. Jaakkola
    Lawrence K. Saul
    Machine Learning, 1999, 37 : 183 - 233
  • [7] Structural learning of functional directed graphical models with incomplete signals
    Li, Dengyu
    Wang, Kaibo
    COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, 2024, 53 (12) : 6490 - 6511
  • [8] LEARNING LOOPY GRAPHICAL MODELS WITH LATENT VARIABLES: EFFICIENT METHODS AND GUARANTEES
    Anandkumar, Animashree
    Valluvan, Ragupathyraj
    ANNALS OF STATISTICS, 2013, 41 (02) : 401 - 435
  • [9] Improved Greedy Algorithms for Learning Graphical Models
    Ray, Avik
    Sanghavi, Sujay
    Shakkottai, Sanjay
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (06) : 3457 - 3468
  • [10] Fast Variational Bayes Methods for Multinomial Probit Models
    Loaiza-Maya, Ruben
    Nibbering, Didier
    JOURNAL OF BUSINESS & ECONOMIC STATISTICS, 2023, 41 (04) : 1352 - 1363