Graphical model selection for Gaussian conditional random fields in the presence of latent variables

From MaRDI portal
Publication:5231501

DOI10.1080/01621459.2018.1434531zbMATH Open1420.62244arXiv1512.06412OpenAlexW2785368249WikidataQ57202042 ScholiaQ57202042MaRDI QIDQ5231501FDOQ5231501


Authors: Benjamin Frot, Luke Jostins, Gilean McVean Edit this on Wikidata


Publication date: 27 August 2019

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Abstract: We consider the problem of learning a conditional Gaussian graphical model in the presence of latent variables. Building on recent advances in this field, we suggest a method that decomposes the parameters of a conditional Markov random field into the sum of a sparse and a low-rank matrix. We derive convergence bounds for this estimator and show that it is well-behaved in the high-dimensional regime as well as "sparsistent" (i.e. capable of recovering the graph structure). We then show how proximal gradient algorithms and semi-definite programming techniques can be employed to fit the model to thousands of variables. Through extensive simulations, we illustrate the conditions required for identifiability and show that there is a wide range of situations in which this model performs significantly better than its counterparts, for example, by accommodating more latent variables. Finally, the suggested method is applied to two datasets comprising individual level data on genetic variants and metabolites levels. We show our results replicate better than alternative approaches and show enriched biological signal.


Full work available at URL: https://arxiv.org/abs/1512.06412




Recommendations




Cites Work


Cited In (15)

Uses Software





This page was built for publication: Graphical model selection for Gaussian conditional random fields in the presence of latent variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5231501)