A complete logic for causal consistency

• URL: http://arxiv.org/abs/2403.09297v1
• Date: Thu, 14 Mar 2024 11:36:53 GMT
• Title: A complete logic for causal consistency
• Authors: Will Simmons, Aleks Kissinger,
• Abstract summary: We introduce graph types as a tool to examine causal structures over graphs in this model. The properties of graph types are then used to prove completeness for causal consistency of a new causal logic that conservatively extends pomset logic. Using the fact that causal logic conservatively extends pomset logic, we finish by giving a physically-meaningful interpretation of a separating statement between pomset and BV.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The $\mathrm{Caus}[-]$ construction takes a base category of ``raw materials'' and builds a category of higher order causal processes, that is a category whose types encode causal (a.k.a. signalling) constraints between collections of systems. Notable examples are categories of higher-order stochastic maps and higher-order quantum channels. Well-typedness in $\mathrm{Caus}[-]$ corresponds to a composition of processes being causally consistent, in the sense that any choice of local processes of the prescribed types yields an overall process respecting causality constraints. It follows that closed processes always occur with probability 1, ruling out e.g. causal paradoxes arising from time loops. It has previously been shown that $\mathrm{Caus}[\mathcal{C}]$ gives a model of MLL+MIX and BV logic, hence these logics give sufficient conditions for causal consistency, but they fail to provide a complete characterisation. In this follow-on work, we introduce graph types as a tool to examine causal structures over graphs in this model. We explore their properties, standard forms, and equivalent definitions; in particular, a process obeys all signalling constraints of the graph iff it is expressible as an affine combination of factorisations into local causal processes connected according to the edges of the graph. The properties of graph types are then used to prove completeness for causal consistency of a new causal logic that conservatively extends pomset logic. The crucial extra ingredient is a notion of distinguished atoms that correspond to first-order states, which only admit a flow of information in one direction. Using the fact that causal logic conservatively extends pomset logic, we finish by giving a physically-meaningful interpretation to a separating statement between pomset and BV.

Related papers

• Flow of dynamical causal structures with an application to correlations [0.9208007322096533]
  Causal models capture cause-effect relations both qualitatively - via the graphical causal structure - and quantitatively. Here, we introduce a tool - the flow of causal structures - to visualize and explore the dynamical aspect of classical-deterministic processes.
  arXiv  Detail & Related papers  (2024-10-24T13:40:02Z)
• Algorithmic syntactic causal identification [0.8901073744693314]
  Causal identification in causal Bayes nets (CBNs) is an important tool in causal inference. Most existing formulations of causal identification using techniques such as d-separation and do-calculus are expressed within the mathematical language of classical probability theory. We show that this restriction can be lifted by replacing the use of classical probability theory with the alternative axiomatic foundation of symmetric monoidal categories.
  arXiv  Detail & Related papers  (2024-03-14T17:14:53Z)
• 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)
• CLEAR: Generative Counterfactual Explanations on Graphs [60.30009215290265]
  We study the problem of counterfactual explanation generation on graphs. A few studies have explored counterfactual explanations on graphs, but many challenges of this problem are still not well-addressed. We propose a novel framework CLEAR which aims to generate counterfactual explanations on graphs for graph-level prediction models.
  arXiv  Detail & Related papers  (2022-10-16T04:35:32Z)
• Consistent circuits for indefinite causal order [0.0]
  A number of quantum processes have been proposed which are logically consistent, yet feature a cyclic causal structure. Here we provide a method to construct a process with an exotic causal structure in a way that ensures, and makes clear why, it is consistent. We show how several standard examples of exotic processes, including ones that violate causal inequalities, are among the class of processes that can be generated in this way.
  arXiv  Detail & Related papers  (2022-06-20T23:15:52Z)
• Markov categories, causal theories, and the do-calculus [7.061298918159947]
  We give a category-theoretic treatment of causal models that formalizes the syntax for causal reasoning over a directed acyclic graph (DAG) This framework enables us to define and study important concepts in causal reasoning from an abstract and "purely causal" point of view.
  arXiv  Detail & Related papers  (2022-04-11T01:27:41Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Algorithms for Causal Reasoning in Probability Trees [13.572630988699572]
  We present concrete algorithms for causal reasoning in discrete probability trees. Our work expands the domain of causal reasoning to a very general class of discrete processes.
  arXiv  Detail & Related papers  (2020-10-23T08:51:52Z)
• From Checking to Inference: Actual Causality Computations as Optimization Problems [79.87179017975235]
  We present a novel approach to formulate different notions of causal reasoning, over binary acyclic models, as optimization problems. We show that both notions are efficiently automated. Using models with more than $8000$ variables, checking is computed in a matter of seconds, with MaxSAT outperforming ILP in many cases.
  arXiv  Detail & Related papers  (2020-06-05T10:56:52Z)
• A Critical View of the Structural Causal Model [89.43277111586258]
  We show that one can identify the cause and the effect without considering their interaction at all. We propose a new adversarial training method that mimics the disentangled structure of the causal model. Our multidimensional method outperforms the literature methods on both synthetic and real world datasets.
  arXiv  Detail & Related papers  (2020-02-23T22:52: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.