Estimation of graphical models through structured norm minimization
From MaRDI portal
Publication:4558541
Abstract: Estimation of Markov Random Field and covariance models from high-dimensional data represents a canonical problem that has received a lot of attention in the literature. A key assumption, widely employed, is that of {em sparsity} of the underlying model. In this paper, we study the problem of estimating such models exhibiting a more intricate structure comprising simultaneously of {em sparse, structured sparse} and {em dense} components. Such structures naturally arise in several scientific fields, including molecular biology, finance, and political science. We introduce a general framework based on a novel structured norm that enables us to estimate such complex structures from high-dimensional data. The resulting optimization problem is convex and we introduce a linearized multi-block alternating direction method of multipliers (ADMM) algorithm to solve it efficiently. We illustrate the superior performance of the proposed framework on a number of synthetic data sets generated from both random and structured networks. Further, we apply the method to a number of real data sets and discuss the results.
Recommendations
- High-dimensional covariance decomposition into sparse Markov and independence models
- High-dimensional covariance estimation based on Gaussian graphical models
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints
- Learning graphical models with hubs
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 2199188 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.993
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A lava attack on the recovery of sums of dense and sparse signals
- A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius
- A three-operator splitting scheme and its optimization applications
- Adaptive thresholding for sparse covariance matrix estimation
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Analysis of Financial Time Series
- Beitrag zur Theorie des Ferromagnetismus
- Benchmarking optimization software with performance profiles.
- Classification With the Sparse Group Lasso
- Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Emergence of Scaling in Random Networks
- Estimating heterogeneous graphical models for discrete data with an application to roll call voting
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- Graphical methods for efficient likelihood inference in Gaussian covariance models
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- Joint estimation of multiple graphical models
- Latent variable graphical model selection via convex optimization
- Learning Markov random walks for robust subspace clustering and estimation
- Learning graphical models with hubs
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Model selection and estimation in the Gaussian graphical model
- Network Granger causality with inherent grouping structure
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- On the linear convergence of the alternating direction method of multipliers
- Operator norm consistent estimation of large-dimensional sparse covariance matrices
- Positive-definite \(\ell_1\)-penalized estimation of large covariance matrices
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Regularization and Variable Selection Via the Elastic Net
- Regularized estimation in sparse high-dimensional time series models
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
- Sparse inverse covariance estimation with the graphical lasso
- Sparse permutation invariant covariance estimation
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- The structure of scientific collaboration networks
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Two-Point Step Size Gradient Methods
Cited in
(10)- Fair community detection and structure learning in heterogeneous graphical models
- High-dimensional covariance decomposition into sparse Markov and independence models
- Parameter Estimation for Undirected Graphical Models With Hard Constraints
- scientific article; zbMATH DE number 7255155 (Why is no real title available?)
- scientific article; zbMATH DE number 7626710 (Why is no real title available?)
- Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
- Structure learning of sparse directed acyclic graphs incorporating the scale-free property
- On the total variation regularized estimator over a class of tree graphs
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
- A unified framework for structured graph learning via spectral constraints
This page was built for publication: Estimation of graphical models through structured norm minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558541)
