A Weaker Faithfulness Assumption based on Triple Interactions

by   Alexander Marx, et al.

One of the core assumptions in causal discovery is the faithfulness assumption—i.e. assuming that independencies found in the data are due to separations in the true causal graph. This assumption can, however, be violated in many ways, including xor connections, deterministic functions or cancelling paths. In this work, we propose a weaker assumption that we call 2-adjacency faithfulness. In contrast to adjacency faithfulness, which assumes that there is no conditional independence between each pair of variables that are connected in the causal graph, we only require no conditional independence between a node and a subset of its Markov blanket that can contain up to two nodes. Equivalently, we adapt orientation faithfulness to this setting. We further propose a sound orientation rule for causal discovery that applies under weaker assumptions. As a proof of concept, we derive a modified Grow and Shrink algorithm that recovers the Markov blanket of a target node and prove its correctness under strictly weaker assumptions than the standard faithfulness assumption.


page 1

page 2

page 3

page 4


Identifiability of Causal Graphs using Functional Models

This work addresses the following question: Under what assumptions on th...

Reliable Causal Discovery with Improved Exact Search and Weaker Assumptions

Many of the causal discovery methods rely on the faithfulness assumption...

On the assumption of independent right censoring

Various assumptions on a right-censoring mechanism to ensure consistency...

ASP-based Discovery of Semi-Markovian Causal Models under Weaker Assumptions

In recent years the possibility of relaxing the so-called Faithfulness a...

A Uniformly Consistent Estimator of non-Gaussian Causal Effects Under the k-Triangle-Faithfulness Assumption

Kalisch and Bühlmann (2007) showed that for linear Gaussian models, unde...

Discovering contemporaneous and lagged causal relations in autocorrelated nonlinear time series datasets

We consider causal discovery from time series using conditional independ...

A Fast PC Algorithm with Reversed-order Pruning and A Parallelization Strategy

The PC algorithm is the state-of-the-art algorithm for causal structure ...