Latent variable graphical model selection via convex optimization
From MaRDI portal
Abstract: Suppose we observe samples of a subset of a collection of random variables. No additional information is provided about the number of latent variables, nor of the relationship between the latent and observed variables. Is it possible to discover the number of latent components, and to learn a statistical model over the entire collection of variables? We address this question in the setting in which the latent and observed variables are jointly Gaussian, with the conditional statistics of the observed variables conditioned on the latent variables being specified by a graphical model. As a first step we give natural conditions under which such latent-variable Gaussian graphical models are identifiable given marginal statistics of only the observed variables. Essentially these conditions require that the conditional graphical model among the observed variables is sparse, while the effect of the latent variables is "spread out" over most of the observed variables. Next we propose a tractable convex program based on regularized maximum-likelihood for model selection in this latent-variable setting; the regularizer uses both the norm and the nuclear norm. Our modeling framework can be viewed as a combination of dimensionality reduction (to identify latent variables) and graphical modeling (to capture remaining statistical structure not attributable to the latent variables), and it consistently estimates both the number of latent components and the conditional graphical model structure among the observed variables. These results are applicable in the high-dimensional setting in which the number of latent/observed variables grows with the number of samples of the observed variables. The geometric properties of the algebraic varieties of sparse matrices and of low-rank matrices play an important role in our analysis.
Recommendations
- Graphical model selection for Gaussian conditional random fields in the presence of latent variables
- Graphical model selection with latent variables
- Learning loopy graphical models with latent variables: efficient methods and guarantees
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Interpreting latent variables in factor models via convex optimization
Cites work
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 3244317 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A well-conditioned estimator for large-dimensional covariance matrices
- Characterization of the subdifferential of some matrix norms
- Compressed sensing
- Covariance regularization by thresholding
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Exact matrix completion via convex optimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Gaussian Markov distributions over finite graphs
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- High dimensional covariance matrix estimation using a factor model
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- High-dimensional graphs and variable selection with the Lasso
- Local operator theory, random matrices and Banach spaces.
- Nonparametric estimation of large covariance matrices of longitudinal data
- On the distribution of the largest eigenvalue in principal components analysis
- Operator norm consistent estimation of large-dimensional sparse covariance matrices
- Rank-Sparsity Incoherence for Matrix Decomposition
- Regularized estimation of large covariance matrices
- Rejoinder: Latent variable graphical model selection via convex optimization
- Robust principal component analysis?
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- Sparse permutation invariant covariance estimation
- Sparsistency and rates of convergence in large covariance matrix estimation
- ``Ideal parent structure learning for continuous variable Bayesian networks
Cited in
(only showing first 100 items - show all)- Comment on ``Hypothesis testing by convex optimization
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- Generalized symmetric ADMM for separable convex optimization
- Detection of block-exchangeable structure in large-scale correlation matrices
- Estimation of graphical models through structured norm minimization
- Recent developments in high dimensional covariance estimation and its related issues, a review
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
- Learning latent tree graphical models
- Doubly debiased Lasso: high-dimensional inference under hidden confounding
- Linear estimating equations for exponential families with application to Gaussian linear concentration models
- Large covariance estimation through elliptical factor models
- Dimension-wise sparse low-rank approximation of a matrix with application to variable selection in high-dimensional integrative analyzes of association
- General parameterized proximal point algorithm with applications in statistical learning
- Nonstationary Modeling With Sparsity for Spatial Data via the Basis Graphical Lasso
- Adaptive estimation of the copula correlation matrix for semiparametric elliptical copulas
- Integrative methods for post-selection inference under convex constraints
- Bi-cross-validation for factor analysis
- A derivative-free \textit{RMIL} conjugate gradient projection method for convex constrained nonlinear monotone equations with applications in compressive sensing
- Proximal Markov chain Monte Carlo algorithms
- Alternating direction based method for optimal control problem constrained by Stokes equation
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- Learning a factor model via regularized PCA
- Rejoinder: Invariance, causality and robustness
- Learning loopy graphical models with latent variables: efficient methods and guarantees
- Interpreting latent variables in factor models via convex optimization
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Psychometric network models from time-series and panel data
- High-dimensional inference: confidence intervals, \(p\)-values and R-software \texttt{hdi}
- Adjusted regularization in latent graphical models: application to multiple-neuron spike count data
- Forward-backward splitting with Bregman distances
- Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss
- Adjusted regularization of cortical covariance
- Graphical model selection for Gaussian conditional random fields in the presence of latent variables
- Graphical model selection with latent variables
- Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming
- Regularized estimation of high-dimensional factor-augmented vector autoregressive (FAVAR) models
- A class of ADMM-based algorithms for three-block separable convex programming
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
- Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints
- On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Generalized network psychometrics: combining network and latent variable models
- A parallel splitting ALM-based algorithm for separable convex programming
- Learning semidefinite regularizers
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
- Rejoinder: Latent variable graphical model selection via convex optimization
- latentgraph
- Sparse linear identifiable multivariate modeling
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity
- A partially isochronous splitting algorithm for three-block separable convex minimization problems
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- Pivotal variable detection of the covariance matrix and its application to high-dimensional factor models
- Toward a multisubject analysis of neural connectivity
- Level-set methods for convex optimization
- On model selection consistency of regularized M-estimators
- Alternating proximal gradient method for convex minimization
- Adaptive estimation in structured factor models with applications to overlapping clustering
- Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation
- A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
- Nonparametric Finite Mixture of Gaussian Graphical Models
- Scalable interpretable multi-response regression via SEED
- An Algebraic Estimator for Large Spectral Density Matrices
- Nonsparse learning with latent variables
- Large factor model estimation by nuclear norm plus \(\ell_1\) norm penalization
- Learning a Bayesian network with multiple latent variables for implicit relation representation
- Estimation of graphical models: an overview of selected topics
- Incomplete graphical model inference via latent tree aggregation
- Topology identification under spatially correlated noise
- Pairwise sparse + low-rank models for variables of mixed type
- scientific article; zbMATH DE number 7306913 (Why is no real title available?)
- Learning linear non-Gaussian causal models in the presence of latent variables
- Learning Gaussian graphical models with latent confounders
- Joint Gaussian graphical model estimation: a survey
- High-dimensional covariance matrix estimation
- Hidden factor estimation in dynamic generalized factor analysis models
- Sparse plus low-rank identification for dynamical latent-variable graphical AR models
- Interpretation of the precision matrix and its application in estimating sparse brain connectivity during sleep spindles from human electrocorticography recordings
- Estimating a covariance matrix for market risk management and the case of credit default swaps
- A survey on some recent developments of alternating direction method of multipliers
- A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming
- A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming
- Structure learning for zero-inflated counts with an application to single-cell RNA sequencing data
- Adaptive estimation in multivariate response regression with hidden variables
- scientific article; zbMATH DE number 7255155 (Why is no real title available?)
- Detection of hubs in complex networks by the Laplacian matrix
- Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints
- Robust Causal Structure Learning with Some Hidden Variables
- Latent-variable Gaussian graphical model structure learning by GEMS algorithm
- A large covariance matrix estimator under intermediate spikiness regimes
- Nonlinear Causal Discovery with Confounders
- A proximal alternating direction method of multipliers with a substitution procedure
- Inference in High-Dimensional Multivariate Response Regression with Hidden Variables
- Characterizing brain connectivity from human electrocorticography recordings with unobserved inputs during epileptic seizures
- Bayesian sparse covariance decomposition with a graphical structure
- Structure learning of Bayesian networks with latent variables via sparse and low-rank decomposition
This page was built for publication: Latent variable graphical model selection via convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q132216)
