paper-with-me

Papers

Learning from Pairwise Marginal Independencies

2015-08-02 · Johannes Textor, Alexander Idelberger, Maciej Liśkiewicz

We consider graphs that represent pairwise marginal independencies amongst a set of variables (for instance, the zero entries of a covariance matrix for normal data). We characterize the directed acyclic graphs (DAGs) that faithfully explain a given set of independencies, and derive algorithms to efficiently enumerate such structures. Our results map out the space of faithful causal models for a given set of pairwise marginal independence relations. This allows us to show the extent to which causal inference is possible without using conditional independence tests.

📄 PDF Abstract BibTeX arXiv:1508.00280

Code (0)

등록된 구현이 없습니다.

Tasks

Causal Inference

Methods 이 논문이 사용한 방법론

Causal inference Causal inference is the process of drawing a conclusion about a causal connection based on the conditions of the occurrence of an effect. The main difference between causal…

Similar Papers 제목 키워드 기반

Recovering Causal Structures from Low-Order Conditional Independencies

2020-10-06 · Marcel Wienöbst, Maciej Liśkiewicz

One of the common obstacles for learning causal models from data is that high-order conditional independence (CI) relationships between random variables are difficult to estimate. Since CI tests with conditioning sets of…

Graphical Transformation Models

2025-03-22 · Matthias Herp, Johannes Brachem, Michael Altenbuchinger, Thomas Kneib

Graphical Transformation Models (GTMs) are introduced as a novel approach to effectively model multivariate data with intricate marginals and complex dependency structures non-parametrically, while maintaining interpreta…

Graphical Models: An Extension to Random Graphs, Trees, and Other Objects

2017-04-14 · Neil Hallonquist

In this work, we consider an extension of graphical models to random graphs, trees, and other objects. To do this, many fundamental concepts for multivariate random variables (e.g., marginal variables, Gibbs distribution…

Pairwise independent correlation gap

2022-09-18 · Arjun Ramachandra, Karthik Natarajan

In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as the ratio of the maximum expected value …

4k

First-Order Context-Specific Likelihood Weighting in Hybrid Probabilistic Logic Programs

2022-01-26 · Nitesh Kumar, Ondrej Kuzelka, Luc De Raedt

Statistical relational AI and probabilistic logic programming have so far mostly focused on discrete probabilistic models. The reasons for this is that one needs to provide constructs to succinctly model the independenci…