.png){kind=icon}
返回
Identifiability and Consistent Estimation for Gaussian Chain Graph Models
.png){kind=icon}
OA
AI
DOI：10.1080/01621459.2024.2304692.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The chain graph model admits both undirected and directed edges in one graph, where symmetric conditional dependencies are encoded via undirected edges and asymmetric causal relations are encoded via directed edges. Though frequently encountered in practice, the chain graph model has been largely under investigated in the literature, possibly due to the lack of identifiability conditions between undirected and directed edges. In this article, we first establish a set of novel identifiability conditions for the Gaussian chain graph model, exploiting a low rank plus sparse decomposition of the precision matrix. Further, an efficient learning algorithm is built upon the identifiability conditions to fully recover the chain graph structure. Theoretical analysis on the proposed method is conducted, assuring its asymptotic consistency in recovering the exact chain graph structure. The advantage of the proposed method is also supported by numerical experiments on both simulated examples and a real application on the Standard & Poor 500 index data. Supplementary materials for this article are available online.
Keyword:
Causal inference
Directed acyclic graph
Gaussian graphical model
Low-rank plus sparse decomposition
Tangent space
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
.png){kind=icon}
Compression and Air Storage Systems for Small Size CAES Plants: Design and Off-design Analysis小型CAES工厂的压缩和空气存储系统: 设计和非设计分析
OAAI
OAAI分享收藏
查看更多内容