Estimating Differential Latent Variable Graphical Models with Applications to Brain Connectivity

Abstract

Differential graphical models are designed to represent the difference between the conditional dependence structures of two groups, thus are of particular interest for scientific investigation. Motivated by modern applications, this manuscript considers an extended setting where each group is generated by a latent variable Gaussian graphical model. Due to the existence of latent factors, the differential network is decomposed into sparse and low-rank components, both of which are symmetric indefinite matrices. We estimate these two components simultaneously using a two-stage procedure: (i) an initialization stage, which computes a simple, consistent estimator, and (ii) a convergence stage, implemented using a projected alternating gradient descent algorithm applied to a nonconvex objective, initialized using the output of the first stage. We prove that given the initialization, the estimator converges linearly with a nontrivial, minimax optimal statistical error. Experiments on synthetic and real data illustrate that the proposed nonconvex procedure outperforms existing methods.

arXiv comment60 pages

References in corpus (19)

• Sparsity and Incoherence in Compressive Sampling
• Extended Bayesian Information Criteria for Gaussian Graphical Models
• Rank-Sparsity Incoherence for Matrix Decomposition
• Latent variable graphical model selection via convex optimization
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Asymptotic normality and optimalities in estimation of large Gaussian graphical models
• Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees
• Copula Gaussian graphical models and their application to modeling functional disability data
• Incoherence-Optimal Matrix Completion
• Low-rank Solutions of Linear Matrix Equations via Procrustes Flow
• Fast Algorithms for Robust PCA via Gradient Descent
• Improving the precision matrix for precision cosmology
• Nonconvex Sparse Learning via Stochastic Optimization with Progressive Variance Reduction
• Learning Latent Variable Gaussian Graphical Models
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
• Two-sample inference for high-dimensional Markov networks
• Partially Linear Additive Gaussian Graphical Models
• Provable Gaussian Embedding with One Observation
• Learning the effect of latent variables in Gaussian Graphical models with unobserved variables

Cited by in corpus (4)

• Constrained High Dimensional Statistical Inference
• Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees
• A Computationally Efficient Method for Learning Exponential Family Distributions
• Addressing the Between-Group Comparison Problem: Detecting Differences Between Correlation Matrix Populations due to Single-variable Perturbations for Resting State fMRI