Fused multiple graphical lasso
From MaRDI portal
Publication:5254994
Abstract: In this paper, we consider the problem of estimating multiple graphical models simultaneously using the fused lasso penalty, which encourages adjacent graphs to share similar structures. A motivating example is the analysis of brain networks of Alzheimer's disease using neuroimaging data. Specifically, we may wish to estimate a brain network for the normal controls (NC), a brain network for the patients with mild cognitive impairment (MCI), and a brain network for Alzheimer's patients (AD). We expect the two brain networks for NC and MCI to share common structures but not to be identical to each other; similarly for the two brain networks for MCI and AD. The proposed formulation can be solved using a second-order method. Our key technical contribution is to establish the necessary and sufficient condition for the graphs to be decomposable. Based on this key property, a simple screening rule is presented, which decomposes the large graphs into small subgraphs and allows an efficient estimation of multiple independent (small) subgraphs, dramatically reducing the computational cost. We perform experiments on both synthetic and real data; our results demonstrate the effectiveness and efficiency of the proposed approach.
Recommendations
- An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems
- Joint structural estimation of multiple graphical models
- Structural pursuit over multiple undirected graphs
- Multiple Matrix Gaussian Graphs Estimation
- Common and individual structure of brain networks
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A coordinate gradient descent method for nonsmooth separable minimization
- Active Set Identification in Nonlinear Programming
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
- Alternating direction method for covariance selection models
- An augmented Lagrangian approach for sparse principal component analysis
- An improved GLMNET for L1-regularized logistic regression
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Estimating time-varying networks
- Exact covariance thresholding into connected components for large-scale graphical lasso
- First-Order Methods for Sparse Covariance Selection
- High-dimensional graphs and variable selection with the Lasso
- Joint estimation of multiple graphical models
- Learning a common substructure of multiple graphical Gaussian models
- Model Selection and Estimation in Regression with Grouped Variables
- Model selection and estimation in the Gaussian graphical model
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Proximal Newton-type methods for minimizing composite functions
- Smooth Optimization Approach for Sparse Covariance Selection
- Smooth minimization of non-smooth functions
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- Sparse Reconstruction by Separable Approximation
- Sparse inverse covariance estimation with the graphical lasso
- Sparsity and Smoothness Via the Fused Lasso
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
- The graphical lasso: new insights and alternatives
- Time varying undirected graphs
Cited in
(23)- Testing the differential network between two gaussian graphical models with false discovery rate control
- Tight error bounds for log-determinant cones without constraint qualifications
- Modeling Massive Highly Multivariate Nonstationary Spatial Data with the Basis Graphical Lasso
- Estimating Time-Varying Graphical Models
- Structural pursuit over multiple undirected graphs
- On how to solve large-scale log-determinant optimization problems
- Graph estimation from multi-attribute data
- Fused Lasso with the adaptation of parameter ordering in combining multiple studies with repeated measurements
- Localizing differentially evolving covariance structures via scan statistics
- scientific article; zbMATH DE number 7370571 (Why is no real title available?)
- On the robustness of the generalized fused Lasso to prior specifications
- Estimating heterogeneous graphical models for discrete data with an application to roll call voting
- Consistent multiple changepoint estimation with fused Gaussian graphical models
- Common and individual structure of brain networks
- Monitoring Heterogeneous Multivariate Profiles Based on Heterogeneous Graphical Model
- Incorporating prior information with fused sparse group Lasso: application to prediction of clinical measures from neuroimages
- On the application of Gaussian graphical models to paired data problems
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems
- Properties and refinements of the fused Lasso
- Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
- A constrained \(\ell1\) minimization approach for estimating multiple sparse Gaussian or nonparanormal graphical models
- Heterogeneity adjustment with applications to graphical model inference
This page was built for publication: Fused multiple graphical lasso
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254994)
