Identification in Tree-shaped Linear Structural Causal Models

• URL: http://arxiv.org/abs/2203.01852v2
• Date: Fri, 4 Mar 2022 14:45:09 GMT
• Title: Identification in Tree-shaped Linear Structural Causal Models
• Authors: Benito van der Zander, Marcel Wien\"obst, Markus Bl\"aser, Maciej Li\'skiewicz
• Abstract summary: We investigate models, whose directed component forms a tree, and show that missing cycles of bidirected edges can be used to identify the model. We show how multiple missing cycles can be combined to obtain a unique solution.
• Score: 4.751074059099236
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Linear structural equation models represent direct causal effects as directed edges and confounding factors as bidirected edges. An open problem is to identify the causal parameters from correlations between the nodes. We investigate models, whose directed component forms a tree, and show that there, besides classical instrumental variables, missing cycles of bidirected edges can be used to identify the model. They can yield systems of quadratic equations that we explicitly solve to obtain one or two solutions for the causal parameters of adjacent directed edges. We show how multiple missing cycles can be combined to obtain a unique solution. This results in an algorithm that can identify instances that previously required approaches based on Gr\"obner bases, which have doubly-exponential time complexity in the number of structural parameters.

Related papers

• Identifying General Mechanism Shifts in Linear Causal Representations [58.6238439611389]
  We consider the linear causal representation learning setting where we observe a linear mixing of $d$ unknown latent factors. Recent work has shown that it is possible to recover the latent factors as well as the underlying structural causal model over them. We provide a surprising identifiability result that it is indeed possible, under some very mild standard assumptions, to identify the set of shifted nodes.
  arXiv  Detail & Related papers  (2024-10-31T15:56:50Z)
• Induced Covariance for Causal Discovery in Linear Sparse Structures [55.2480439325792]
  Causal models seek to unravel the cause-effect relationships among variables from observed data. This paper introduces a novel causal discovery algorithm designed for settings in which variables exhibit linearly sparse relationships.
  arXiv  Detail & Related papers  (2024-10-02T04:01:38Z)
• On the Complexity of Identification in Linear Structural Causal Models [3.44747819522562]
  We give a new sound and complete algorithm for generic identification which runs in space. The paper also presents evidence that identification is computationally hard in general.
  arXiv  Detail & Related papers  (2024-07-17T13:11:26Z)
• Root Cause Explanation of Outliers under Noisy Mechanisms [50.59446568076628]
  Causal processes are often modelled as graphs with entities being nodes and their paths/interconnections as edge. Existing work only consider the contribution of nodes in the generative process. We consider both individual edge and node of each mechanism when identifying the root causes.
  arXiv  Detail & Related papers  (2023-12-19T03:24:26Z)
• Identification for Tree-shaped Structural Causal Models in Polynomial Time [1.5151556900495786]
  Identifying causal parameters from correlations between nodes is an open problem in artificial intelligence. In this paper, we study SCMs whose directed component forms a tree. We present a randomized-time algorithm, which solves the identification problem for tree-shaped SCMs.
  arXiv  Detail & Related papers  (2023-11-23T15:26:29Z)
• Tractable Bounding of Counterfactual Queries by Knowledge Compilation [51.47174989680976]
  We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models. A recently proposed iterated EM scheme yields an inner approximation of those bounds by sampling the initialisation parameters. We show how a single symbolic knowledge compilation allows us to obtain the circuit structure with symbolic parameters to be replaced by their actual values.
  arXiv  Detail & Related papers  (2023-10-05T07:10:40Z)
• Causal Discovery in Linear Latent Variable Models Subject to Measurement Error [29.78435955758185]
  We focus on causal discovery in the presence of measurement error in linear systems. We demonstrate a surprising connection between this problem and causal discovery in the presence of unobserved parentless causes.
  arXiv  Detail & Related papers  (2022-11-08T03:43:14Z)
• Staged trees and asymmetry-labeled DAGs [2.66269503676104]
  We introduce a minimal Bayesian network representation of the staged tree, which can be used to read conditional independences in an intuitive way. We also define a new labeled graph, termed asymmetry-labeled directed acyclic graph, whose edges are labeled to denote the type of dependence existing between any two random variables.
  arXiv  Detail & Related papers  (2021-08-04T12:20:47Z)
• Convex Polytope Trees [57.56078843831244]
  convex polytope trees (CPT) are proposed to expand the family of decision trees by an interpretable generalization of their decision boundary. We develop a greedy method to efficiently construct CPT and scalable end-to-end training algorithms for the tree parameters when the tree structure is given.
  arXiv  Detail & Related papers  (2020-10-21T19:38:57Z)
• Structural Causal Models Are (Solvable by) Credal Networks [70.45873402967297]
  Causal inferences can be obtained by standard algorithms for the updating of credal nets. This contribution should be regarded as a systematic approach to represent structural causal models by credal networks. Experiments show that approximate algorithms for credal networks can immediately be used to do causal inference in real-size problems.
  arXiv  Detail & Related papers  (2020-08-02T11:19:36Z)
• Structure Learning for Cyclic Linear Causal Models [5.567377163246147]
  We consider the problem of structure learning for linear causal models based on observational data. We treat models given by possibly cyclic mixed graphs, which allow for feedback loops and effects of latent confounders.
  arXiv  Detail & Related papers  (2020-06-10T17:47:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.