A convex pseudo-likelihood framework for high dimensional partial correlation estimation with convergence guarantees

Abstract

Sparse high dimensional graphical model selection is a topic of much interest in modern day statistics. A popular approach is to apply l1-penalties to either (1) parametric likelihoods, or, (2) regularized regression/pseudo-likelihoods, with the latter having the distinct advantage that they do not explicitly assume Gaussianity. As none of the popular methods proposed for solving pseudo-likelihood based objective functions have provable convergence guarantees, it is not clear if corresponding estimators exist or are even computable, or if they actually yield correct partial correlation graphs. This paper proposes a new pseudo-likelihood based graphical model selection method that aims to overcome some of the shortcomings of current methods, but at the same time retain all their respective strengths. In particular, we introduce a novel framework that leads to a convex formulation of the partial covariance regression graph problem, resulting in an objective function comprised of quadratic forms. The objective is then optimized via a coordinate-wise approach. The specific functional form of the objective function facilitates rigorous convergence analysis leading to convergence guarantees; an important property that cannot be established using standard results, when the dimension is larger than the sample size, as is often the case in high dimensional applications. These convergence guarantees ensure that estimators are well-defined under very general conditions, and are always computable. In addition, the approach yields estimators that have good large sample properties and also respect symmetry. Furthermore, application to simulated/real data, timing comparisons and numerical convergence is demonstrated. We also present a novel unifying framework that places all graphical pseudo-likelihood methods as special cases of a more general formulation, leading to important insights.

References in corpus (1)

• Convergence of cyclic coordinatewise l1 minimization

Cited by in corpus (25)

• Inferring large graphs using l1-penalized likelihood
• Variational inference for sparse network reconstruction from count data
• Learning Local Dependence In Ordered Data
• Optimization Methods for Sparse Pseudo-Likelihood Graphical Model Selection
• Fixed support positive-definite modification of covariance matrix estimators via linear shrinkage
• Causal Inference Under Interference And Network Uncertainty
• On Sparse High-Dimensional Graphical Model Learning For Dependent Time Series
• A convex framework for high-dimensional sparse Cholesky based covariance estimation
• A Bayesian Approach to Joint Estimation of Multiple Graphical Models
• Distributionally Robust Formulation and Model Selection for the Graphical Lasso
• Graphical Models for Non-Negative Data Using Generalized Score Matching
• B-CONCORD -- A scalable Bayesian high-dimensional precision matrix estimation procedure
• Fused-Lasso Regularized Cholesky Factors of Large Nonstationary Covariance Matrices of Longitudinal Data
• SG-PALM: a Fast Physically Interpretable Tensor Graphical Model
• Modelling correlated marker effects in genome-wide prediction via Gaussian concentration graph models
• Towards a sparse, scalable, and stably positive definite (inverse) covariance estimator
• The Sylvester Graphical Lasso (SyGlasso)
• Bayesian Regularization for Graphical Models with Unequal Shrinkage
• Introducing Gaussian covariance graph models in genome-wide prediction
• Inferring the Partial Correlation Structure of Allelic Effects and Incorporating it in Genome-wide Prediction
• A unified framework for correlation mining in ultra-high dimension
• An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units
• Endogenous Representation of Asset Returns
• Learning Interpretable Models for Coupled Networks Under Domain Constraints
• Multivariate Gaussian Network Structure Learning