Latent variable graphical model selection via convex optimization
From MaRDI portal
Publication:132216
DOI10.1214/11-aos949zbMath1257.62061arXiv1008.1290MaRDI QIDQ132216
Venkat Chandrasekaran, Alan S. Willsky, Pablo A. Parrilo, Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. Willsky
Publication date: 1 August 2012
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.1290
regularizationlatent variablessparsityGaussian graphical modelsalgebraic statisticslow-rankcovariance selectionhigh-dimensional asymptotics
Asymptotic properties of parametric estimators (62F12) Estimation in multivariate analysis (62H12) Applications of graph theory (05C90) Convex programming (90C25)
Related Items
General parameterized proximal point algorithm with applications in statistical learning, Adaptive estimation of the copula correlation matrix for semiparametric elliptical copulas, A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming, Adjusted regularization in latent graphical models: application to multiple-neuron spike count data, Adaptive estimation in multivariate response regression with hidden variables, Dimension-wise sparse low-rank approximation of a matrix with application to variable selection in high-dimensional integrative analyzes of association, Detection of hubs in complex networks by the Laplacian matrix, Adjusted regularization of cortical covariance, A survey on some recent developments of alternating direction method of multipliers, Proximal Markov chain Monte Carlo algorithms, Bayesian sparse covariance decomposition with a graphical structure, An algorithm twisted from generalized ADMM for multi-block separable convex minimization models, On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models, Doubly debiased Lasso: high-dimensional inference under hidden confounding, Nonstationary Modeling With Sparsity for Spatial Data via the Basis Graphical Lasso, Unnamed Item, Recent developments in high dimensional covariance estimation and its related issues, a review, Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints, On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function, Learning loopy graphical models with latent variables: efficient methods and guarantees, Unnamed Item, Unnamed Item, Unnamed Item, Alternating proximal gradient method for convex minimization, A partially isochronous splitting algorithm for three-block separable convex minimization problems, Forward-backward splitting with Bregman distances, Pairwise sparse + low-rank models for variables of mixed type, Large covariance estimation through elliptical factor models, Learning a factor model via regularized PCA, Learning Gaussian graphical models with latent confounders, Hidden factor estimation in dynamic generalized factor analysis models, Topology identification under spatially correlated noise, Structure learning for zero-inflated counts with an application to single-cell RNA sequencing data, Generalized network psychometrics: combining network and latent variable models, An Algebraic Estimator for Large Spectral Density Matrices, Large factor model estimation by nuclear norm plus \(\ell_1\) norm penalization, Pivotal variable detection of the covariance matrix and its application to high-dimensional factor models, Parallel multi-block ADMM with \(o(1/k)\) convergence, A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming, Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection, Adaptive estimation in structured factor models with applications to overlapping clustering, Toward a Multisubject Analysis of Neural Connectivity, Interpretation of the Precision Matrix and Its Application in Estimating Sparse Brain Connectivity during Sleep Spindles from Human Electrocorticography Recordings, Rejoinder: Invariance, causality and robustness, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, Estimating a covariance matrix for market risk management and the case of credit default swaps, Incomplete graphical model inference via latent tree aggregation, Comment on ``Hypothesis testing by convex optimization, Level-set methods for convex optimization, Learning semidefinite regularizers, The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization, Interpreting latent variables in factor models via convex optimization, Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss, 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, Estimation of Graphical Models through Structured Norm Minimization, Detection of block-exchangeable structure in large-scale correlation matrices, Tightness of the maximum likelihood semidefinite relaxation for angular synchronization, Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity, Bi-cross-validation for factor analysis, A class of ADMM-based algorithms for three-block separable convex programming, A derivative-free \textit{RMIL} conjugate gradient projection method for convex constrained nonlinear monotone equations with applications in compressive sensing, Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming, Psychometric network models from time-series and panel data, High-dimensional inference: confidence intervals, \(p\)-values and R-software \texttt{hdi}, The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent, latentgraph, Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation, A large covariance matrix estimator under intermediate spikiness regimes, Asymptotic normality and optimalities in estimation of large Gaussian graphical models, Characterizing Brain Connectivity From Human Electrocorticography Recordings With Unobserved Inputs During Epileptic Seizures, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, A parallel splitting ALM-based algorithm for separable convex programming, Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods, Graphical Model Selection for Gaussian Conditional Random Fields in the Presence of Latent Variables, Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints, Robust Causal Structure Learning with Some Hidden Variables, Alternating direction based method for optimal control problem constrained by Stokes equation, Nonsparse Learning with Latent Variables, Unnamed Item, A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm, On model selection consistency of regularized M-estimators, Linear estimating equations for exponential families with application to Gaussian linear concentration models, Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
Uses Software
Cites Work
- A well-conditioned estimator for large-dimensional covariance matrices
- High dimensional covariance matrix estimation using a factor model
- Covariance regularization by thresholding
- Operator norm consistent estimation of large-dimensional sparse covariance matrices
- Sparsistency and rates of convergence in large covariance matrix estimation
- Gaussian Markov distributions over finite graphs
- Characterization of the subdifferential of some matrix norms
- On the distribution of the largest eigenvalue in principal components analysis
- Rejoinder: Latent variable graphical model selection via convex optimization
- Sparse permutation invariant covariance estimation
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Regularized estimation of large covariance matrices
- High-dimensional graphs and variable selection with the Lasso
- Exact matrix completion via convex optimization
- Nonparametric estimation of large covariance matrices of longitudinal data
- Robust principal component analysis?
- Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
- Rank-Sparsity Incoherence for Matrix Decomposition
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item