Robust Latent Variable Graphical Models: Exact Recovery and Fundamental Limits
Abstract
We study robust estimation of a Gaussian precision matrix that decomposes as a sparse matrix minus a symmetric, possibly indefinite, low-rank matrix, a structure that arises when latent-variable marginalization is combined with conditioning on linear measurements. The proposed convex estimator replaces the sample covariance by the centered Gaussian measure-transformed (MT) covariance, which preserves the signed graph of the sparse component under the nominal model, and penalizes the low-rank component by the nuclear norm of a congruence transform, an atomic norm that encodes structural side information. Our main result is a primal--dual witness theorem: under restricted invertibility and irrepresentability conditions on the Fisher information, the raw convex optimizer is unique, has no false edges, recovers the signs of all sufficiently strong edges, and has exactly the true rank and inertia. These conditions reduce to the graphical-lasso conditions when the low-rank part is absent, and we verify them from primitive incoherence and near-isotropy assumptions. Over a class on which they hold uniformly, we prove information-theoretic limits for Frobenius estimation, signed graph recovery, and inertia recovery. In particular, inertia recovery requires N≳ p/νmin2 samples, where νmin is the smallest nonzero eigenvalue modulus of the low-rank part; the spectral beta-min condition of the witness theorem is necessary up to a √(log p) factor; and the Frobenius risk attains the minimax rate up to a factor √(μ(1+min{d,r})log p), where μ is the incoherence parameter, d the maximal degree, and r the rank. We further quantify robustness under Huber contamination, with a bias bound that is sharp for the MT functional and vanishes for remote outliers, and give a globally convergent linearized ADMM with closed-form updates.
Related
- A graphical approach to integration and the fundamental theorem
- Large Network limit for Latent Variable Process Models with Endogeneously Evolving Interactions among Multiple Types
- Amortized Structured Stochastic Variational Inference for Gaussian Process Latent Variable Models
- A Deep Latent Variable Framework for Jointly Modeling Missingness, Measurement Error, and Heterogeneity
- Observation-Specific Uncertainty Modeling for Latent-Variable Regression in High-Dimensional Analytical Data
BibTeX
@misc{peng2026robust,
title = {{Robust Latent Variable Graphical Models: Exact Recovery and Fundamental Limits}},
author = {Chuansen Peng and Xiaojing Shen},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.27010},
eprint = {2610.27010},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.27010},
}
RIS
TY - UNPB
TI - Robust Latent Variable Graphical Models: Exact Recovery and Fundamental Limits
AU - Chuansen Peng
AU - Xiaojing Shen
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.27010
UR - https://arxiv.org/abs/2610.27010
AB - We study robust estimation of a Gaussian precision matrix that decomposes as a sparse matrix minus a symmetric, possibly indefinite, low-rank matrix, a structure that arises when latent-variable marginalization is combined with conditioning on linear measurements. The proposed convex estimator replaces the sample covariance by the centered Gaussian measure-transformed (MT) covariance, which preserves the signed graph of the sparse component under the nominal model, and penalizes the low-rank component by the nuclear norm of a congruence transform, an atomic norm that encodes structural side information. Our main result is a primal--dual witness theorem: under restricted invertibility and irrepresentability conditions on the Fisher information, the raw convex optimizer is unique, has no false edges, recovers the signs of all sufficiently strong edges, and has exactly the true rank and inertia. These conditions reduce to the graphical-lasso conditions when the low-rank part is absent, and we verify them from primitive incoherence and near-isotropy assumptions. Over a class on which they hold uniformly, we prove information-theoretic limits for Frobenius estimation, signed graph recovery, and inertia recovery. In particular, inertia recovery requires N≳ p/ν_min^2 samples, where ν_min is the smallest nonzero eigenvalue modulus of the low-rank part; the spectral beta-min condition of the witness theorem is necessary up to a √(log p) factor; and the Frobenius risk attains the minimax rate up to a factor √(μ(1+min{d,r})log p), where μ is the incoherence parameter, d the maximal degree, and r the rank. We further quantify robustness under Huber contamination, with a bias bound that is sharp for the MT functional and vanishes for remote outliers, and give a globally convergent linearized ADMM with closed-form updates.
ER -