Regularized Estimation of Piecewise Constant Gaussian Graphical Models: The Group-Fused Graphical Lasso
arXiv:1512.06171 · doi:10.1080/10618600.2017.1302340
Abstract
The time-evolving precision matrix of a piecewise-constant Gaussian graphical model encodes the dynamic conditional dependency structure of a multivariate time-series. Traditionally, graphical models are estimated under the assumption that data is drawn identically from a generating distribution. Introducing sparsity and sparse-difference inducing priors we relax these assumptions and propose a novel regularized M-estimator to jointly estimate both the graph and changepoint structure. The resulting estimator possesses the ability to therefore favor sparse dependency structures and/or smoothly evolving graph structures, as required. Moreover, our approach extends current methods to allow estimation of changepoints that are grouped across multiple dependencies in a system. An efficient algorithm for estimating structure is proposed. We study the empirical recovery properties in a synthetic setting. The qualitative effect of grouped changepoint estimation is then demonstrated by applying the method on two real-world data-sets.
32 pages, 9 figures
References in corpus (4)
Cited by in corpus (14)
- Seeded Binary Segmentation: A general methodology for fast and optimal change point detection
- Multiple Changepoint Estimation in High-Dimensional Gaussian Graphical Models
- A review on minimax rates in change point detection and localisation
- Joint Network Topology Inference via a Shared Graphon Model
- A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems
- Online Structural Change-point Detection of High-dimensional Streaming Data via Dynamic Sparse Subspace Learning
- Efficient Variational Bayes Learning of Graphical Models with Smooth Structural Changes
- Change point detection in dynamic Gaussian graphical models: the impact of COVID-19 pandemic on the US stock market
- An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems
- ABM: an automatic supervised feature engineering method for loss based models based on group and fused lasso
- Bayesian functional graphical models
- Estimating Time-Varying Graphical Models
- Adaptive regularization for Lasso models in the context of non-stationary data streams
- Efficient proximal gradient algorithms for joint graphical lasso