paper-with-me

Papers

Learning Linear Non-Gaussian Polytree Models

2022-08-13 · Daniele Tramontano, Anthea Monod, Mathias Drton

In the context of graphical causal discovery, we adapt the versatile framework of linear non-Gaussian acyclic models (LiNGAMs) to propose new algorithms to efficiently learn graphs that are polytrees. Our approach combines the Chow--Liu algorithm, which first learns the undirected tree structure, with novel schemes to orient the edges. The orientation schemes assess algebraic relations among moments of the data-generating distribution and are computationally inexpensive. We establish high-dimensional consistency results for our approach and compare different algorithmic versions in numerical experiments.

📄 PDF Abstract BibTeX arXiv:2208.06701

Code (1)

danieletramontano/lingam-polytree-learning 공식 구현

Tasks

Causal Discovery

Similar Papers 제목 키워드 기반

Learning Linear Gaussian Polytree Models with Interventions

2023-11-08 · D. Tramontano, L. Waldmann, M. Drton, E. Duarte

We present a consistent and highly scalable local approach to learn the causal structure of a linear Gaussian polytree using data from interventional experiments with known intervention targets. Our methods first learn t…

Learning Linear Polytree Structural Equation Models

2021-07-22 · Xingmei Lou, Yu Hu, XiaoDong Li

We are interested in the problem of learning the directed acyclic graph (DAG) when data are generated from a linear structural equation model (SEM) and the causal structure can be characterized by a polytree. Under the G…

Optimal estimation of Gaussian (poly)trees

2024-02-09 · Yuhao Wang, Ming Gao, Wai Ming Tai, Bryon Aragam 외

We develop optimal algorithms for learning undirected Gaussian trees and directed Gaussian polytrees from data. We consider both problems of distribution learning (i.e. in KL distance) and structure learning (i.e. exact …

Discrete Bayesian Networks: The Exact Posterior Marginal Distributions

2014-11-23 · Do Le Paul Minh

In a Bayesian network, we wish to evaluate the marginal probability of a query variable, which may be conditioned on the observed values of some evidence variables. Here we first present our "border algorithm," which con…

Learning Sparse Fixed-Structure Gaussian Bayesian Networks

2021-07-22 · Arnab Bhattacharyya, Davin Choo, Rishikesh Gajjala, Sutanu Gayen 외

Gaussian Bayesian networks (a.k.a. linear Gaussian structural equation models) are widely used to model causal interactions among continuous variables. In this work, we study the problem of learning a fixed-structure Gau…