Extremal graphical modeling with latent variables via convex optimization

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Engelke, Sebastian, Taeb, Armeen
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917982723112960
author Engelke, Sebastian
Taeb, Armeen
author_facet Engelke, Sebastian
Taeb, Armeen
contents Extremal graphical models encode the conditional independence structure of multivariate extremes and provide a powerful tool for quantifying the risk of rare events. Prior work on learning these graphs from data has focused on the setting where all relevant variables are observed. For the popular class of Hüsler-Reiss models, we propose the \texttt{eglatent} method, a tractable convex program for learning extremal graphical models in the presence of latent variables. Our approach decomposes the Hüsler-Reiss precision matrix into a sparse component encoding the graphical structure among the observed variables after conditioning on the latent variables, and a low-rank component encoding the effect of a few latent variables on the observed variables. We provide finite-sample guarantees of \texttt{eglatent} and show that it consistently recovers the conditional graph as well as the number of latent variables. We highlight the improved performances of our approach on synthetic and real data.
format Preprint
id arxiv_https___arxiv_org_abs_2403_09604
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Extremal graphical modeling with latent variables via convex optimization
Engelke, Sebastian
Taeb, Armeen
Methodology
Statistics Theory
Machine Learning
Extremal graphical models encode the conditional independence structure of multivariate extremes and provide a powerful tool for quantifying the risk of rare events. Prior work on learning these graphs from data has focused on the setting where all relevant variables are observed. For the popular class of Hüsler-Reiss models, we propose the \texttt{eglatent} method, a tractable convex program for learning extremal graphical models in the presence of latent variables. Our approach decomposes the Hüsler-Reiss precision matrix into a sparse component encoding the graphical structure among the observed variables after conditioning on the latent variables, and a low-rank component encoding the effect of a few latent variables on the observed variables. We provide finite-sample guarantees of \texttt{eglatent} and show that it consistently recovers the conditional graph as well as the number of latent variables. We highlight the improved performances of our approach on synthetic and real data.
title Extremal graphical modeling with latent variables via convex optimization
topic Methodology
Statistics Theory
Machine Learning
url https://arxiv.org/abs/2403.09604