Causal influence in operational probabilistic theories
- URL: http://arxiv.org/abs/2012.15213v3
- Date: Thu, 29 Jul 2021 09:20:54 GMT
- Title: Causal influence in operational probabilistic theories
- Authors: Paolo Perinotti
- Abstract summary: We study the relation of causal influence between input systems of a reversible evolution and its output systems.
One is the notion based on signalling, the other is the notion used to define the neighbourhood of a cell in a quantum cellular automaton.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: We study the relation of causal influence between input systems of a
reversible evolution and its output systems, in the context of operational
probabilistic theories. We analyse two different definitions that are borrowed
from the literature on quantum theory -- where they are equivalent. One is the
notion based on signalling, and the other one is the notion used to define the
neighbourhood of a cell in a quantum cellular automaton. The latter definition,
that we adopt in the general scenario, turns out to be strictly weaker than the
former: it is possible for a system to have causal influence on another one
without signalling to it. Remarkably, the counterexample comes from classical
theory, where the proposed notion of causal influence determines a redefinition
of the neighbourhood of a cell in cellular automata. We stress that, according
to our definition, it is impossible anyway to have causal influence in the
absence of an interaction, e.g.~in a Bell-like scenario. We study various
conditions for causal influence, and introduce the feature that we call no
interaction without disturbance, under which we prove that signalling and
causal influence coincide. The proposed definition has interesting consequences
on the analysis of causal networks, and leads to a revision of the notion of
neighbourhood for classical cellular automata, clarifying a puzzle regarding
their quantisation that apparently makes the neighbourhood larger than the
original one.
Related papers
- Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse
Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
This work introduces a novel principle for disentanglement we call mechanism sparsity regularization.
We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors.
We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
arXiv Detail & Related papers (2024-01-10T02:38:21Z) - Emergence and Causality in Complex Systems: A Survey on Causal Emergence
and Related Quantitative Studies [12.78006421209864]
Causal emergence theory employs measures of causality to quantify emergence.
Two key problems are addressed: quantifying causal emergence and identifying it in data.
We highlighted that the architectures used for identifying causal emergence are shared by causal representation learning, causal model abstraction, and world model-based reinforcement learning.
arXiv Detail & Related papers (2023-12-28T04:20:46Z) - A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality.
Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
arXiv Detail & Related papers (2023-05-19T13:15:48Z) - Phenomenological Causality [14.817342045377842]
We propose a notion of 'phenomenological causality' whose basic concept is a set of elementary actions.
We argue that it is consistent with the causal Markov condition when the system under consideration interacts with other variables that control the elementary actions.
arXiv Detail & Related papers (2022-11-15T13:05:45Z) - Covariant influences for finite discrete dynamical systems [6.2997667081978825]
We develop a rigorous theory of external influences on finite discrete dynamical systems.
Our approach employs the framework of resource theories, borrowed quantum information theory, to the study of finite discrete dynamical systems.
The laws we articulate unify the behavior of different types of finite discrete dynamical systems, and their mathematical flavor makes them rigorous and checkable.
arXiv Detail & Related papers (2021-11-26T18:05:02Z) - From no causal loop to absoluteness of cause: discarding the quantum NOT
logic [0.0]
AC principle restrains the time order' of two spacelike separated events/processes to be a potential cause of another event in their common future.
A strong form of violation enables instantaneous signaling, whereas a weak form of violation forbids the theory to be locally tomographic.
On the other hand, impossibility of an intermediate violation suffices to discard the universal quantum NOT logic.
arXiv Detail & Related papers (2021-09-21T04:24:25Z) - Discovering Latent Causal Variables via Mechanism Sparsity: A New
Principle for Nonlinear ICA [81.4991350761909]
Independent component analysis (ICA) refers to an ensemble of methods which formalize this goal and provide estimation procedure for practical application.
We show that the latent variables can be recovered up to a permutation if one regularizes the latent mechanisms to be sparse.
arXiv Detail & Related papers (2021-07-21T14:22:14Z) - The Causal Neural Connection: Expressiveness, Learnability, and
Inference [125.57815987218756]
An object called structural causal model (SCM) represents a collection of mechanisms and sources of random variation of the system under investigation.
In this paper, we show that the causal hierarchy theorem (Thm. 1, Bareinboim et al., 2020) still holds for neural models.
We introduce a special type of SCM called a neural causal model (NCM), and formalize a new type of inductive bias to encode structural constraints necessary for performing causal inferences.
arXiv Detail & Related papers (2021-07-02T01:55:18Z) - 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) - Quantifying causal influences in the presence of a quantum common cause [0.9176056742068814]
We introduce a general framework able to estimate causal influences between two variables.
We show that every pure bipartite entangled state violates the classical bounds on causal influence.
arXiv Detail & Related papers (2020-07-02T16:07:18Z) - Causal Discovery in Physical Systems from Videos [123.79211190669821]
Causal discovery is at the core of human cognition.
We consider the task of causal discovery from videos in an end-to-end fashion without supervision on the ground-truth graph structure.
arXiv Detail & Related papers (2020-07-01T17:29:57Z)
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.