Table of Contents
Fetching ...

Local Causal Discovery for Statistically Efficient Causal Inference

Mátyás Schubert, Tom Claassen, Sara Magliacane

TL;DR

LOAD addresses the problem of estimating the causal effect between a pair of variables when the full causal graph is unknown, balancing the scalability of local causal discovery with the statistical optimality of global approaches. It introduces a principled pipeline that first infers the target relation using local Markov-blanket information, then tests identifiability via a local amenability criterion, and finally computes the optimal adjustment set by identifying mediators and their parents when identifiability holds. The method is proven sound and complete for identifying causal effects from local information and is shown to achieve accuracy comparable to global methods while dramatically reducing CI tests and improving scalability in large graphs. Empirical results on synthetic and realistic networks demonstrate that LOAD often outperforms local methods in adjustment-set quality and approaches global methods in causal-estimation performance, with favorable computational trade-offs.

Abstract

Causal discovery methods can identify valid adjustment sets for causal effect estimation for a pair of target variables, even when the underlying causal graph is unknown. Global causal discovery methods focus on learning the whole causal graph and therefore enable the recovery of optimal adjustment sets, i.e., sets with the lowest asymptotic variance, but they quickly become computationally prohibitive as the number of variables grows. Local causal discovery methods offer a more scalable alternative by focusing on the local neighborhood of the target variables, but are restricted to statistically suboptimal adjustment sets. In this work, we propose Local Optimal Adjustments Discovery (LOAD), a sound and complete causal discovery approach that combines the computational efficiency of local methods with the statistical optimality of global methods. First, LOAD identifies the causal relation between the targets and tests if the causal effect is identifiable by using only local information. If it is identifiable, it then finds the optimal adjustment set by leveraging local causal discovery to infer the mediators and their parents. Otherwise, it returns the locally valid parent adjustment sets based on the learned local structure. In our experiments on synthetic and realistic data LOAD outperforms global methods in scalability, while providing more accurate effect estimation than local methods.

Local Causal Discovery for Statistically Efficient Causal Inference

TL;DR

LOAD addresses the problem of estimating the causal effect between a pair of variables when the full causal graph is unknown, balancing the scalability of local causal discovery with the statistical optimality of global approaches. It introduces a principled pipeline that first infers the target relation using local Markov-blanket information, then tests identifiability via a local amenability criterion, and finally computes the optimal adjustment set by identifying mediators and their parents when identifiability holds. The method is proven sound and complete for identifying causal effects from local information and is shown to achieve accuracy comparable to global methods while dramatically reducing CI tests and improving scalability in large graphs. Empirical results on synthetic and realistic networks demonstrate that LOAD often outperforms local methods in adjustment-set quality and approaches global methods in causal-estimation performance, with favorable computational trade-offs.

Abstract

Causal discovery methods can identify valid adjustment sets for causal effect estimation for a pair of target variables, even when the underlying causal graph is unknown. Global causal discovery methods focus on learning the whole causal graph and therefore enable the recovery of optimal adjustment sets, i.e., sets with the lowest asymptotic variance, but they quickly become computationally prohibitive as the number of variables grows. Local causal discovery methods offer a more scalable alternative by focusing on the local neighborhood of the target variables, but are restricted to statistically suboptimal adjustment sets. In this work, we propose Local Optimal Adjustments Discovery (LOAD), a sound and complete causal discovery approach that combines the computational efficiency of local methods with the statistical optimality of global methods. First, LOAD identifies the causal relation between the targets and tests if the causal effect is identifiable by using only local information. If it is identifiable, it then finds the optimal adjustment set by leveraging local causal discovery to infer the mediators and their parents. Otherwise, it returns the locally valid parent adjustment sets based on the learned local structure. In our experiments on synthetic and realistic data LOAD outperforms global methods in scalability, while providing more accurate effect estimation than local methods.
Paper Structure (46 sections, 21 theorems, 6 equations, 10 figures, 5 tables, 11 algorithms)

This paper contains 46 sections, 21 theorems, 6 equations, 10 figures, 5 tables, 11 algorithms.

Key Result

Theorem 4.1

For any two distinct nodes $X$ and $Y$ in a CPDAG $G$, $X \in ExplAn_G(Y)$ iff $X \centernot{\perp\perp} Y | Pa_G(X) \cup Sib_G(X)$.

Figures (10)

  • Figure 1: Results over number of nodes with $n_{\mathbf{D}} = 10000$, $\overline{d} = 2$ and $d_{\max} = 10$ and target pairs such that one is an explicit ancestor of the other. The shadow area denotes the range of the standard deviation. Due to memory constraints, we could not run MARVEL on more than 400 nodes in any setting, LDECC$^+$ on 1000 nodes with Fisher-Z tests and LDECC$^+$ on any number of nodes with $G^2$ tests. We report all numbers in detail in \ref{['sec:main_results_tables']}.
  • Figure 2: An example CPDAG and PAG for \ref{['example:localpc_counter_example']} where the LocalPC algorithm in \ref{['alg:localpc']} incorrectly identifies $Y$ as adjacent to $X$ because it never tests $X \perp\perp Y |\{V_1, V_2\}$
  • Figure 3: (\ref{['fig:ldecc_counter_example']}): Example CPDAG for \ref{['example:ldecc_counter_example']}, where LDECC fails to orient $V_1 \to X$ and identify $V_1$ as a parent of $X$. (\ref{['fig:ldp_counter_example']}): Example DAG/CPDAG for \ref{['example:ldp_counter_example']} where LDP fails to identify a valid adjustment set for treatment $X$ and outcome $Y$, even though the causal effect of 0 and a valid adjustment set of $V_2$ is identifiable.
  • Figure 4: Example paths, shown in red, for the different cases considered in the "only if" direction of \ref{['lem:local_amenability']}. The dashed arrows indicate that there can be a longer, possibly directed path between the two nodes instead of a direct edge. (\ref{['subfig:1a']}): A path $p$ between $V$ and $Y$ that goes through $X$ such that $X$ is a non-collider on $p$. (\ref{['subfig:1b']}): A path $p$ between $V$ and $Y$ that goes through $X$ such that $X$ is a collider on $p$. (\ref{['subfig:2a']}): A path $p$ between $V$ and $Y$ that does not go through $X$ and does not contain a node $Z$ that is both an ancestor of $X$ and a collider on $p$. (\ref{['subfig:2b']}): A path $p$ between $V$ and $Y$ that does not go through $X$ but contains a node $Z$ that is both an ancestor of $X$ and a collider on $p$.
  • Figure 5: The MAGIC-NIAB network.
  • ...and 5 more figures

Theorems & Definitions (34)

  • Definition 2.1: Amenability perkovic2015complete
  • Definition 2.2: Optimal adjustment set henckel2022graphical
  • Theorem 4.1: Thm. 3 in fang2022local
  • Theorem 4.2: Thm. 2 in fang2022local
  • Lemma 4.1
  • Lemma 4.2
  • Lemma 4.3
  • Corollary 4.1
  • Theorem 4.3
  • Example A.1
  • ...and 24 more