2014
DOI: 10.1088/1367-2630/16/4/043001
|View full text |Cite
|
Sign up to set email alerts
|

Causal structures from entropic information: geometry and novel scenarios

Abstract: Bellʼs theorem in physics, as well as causal discovery in machine learning, both face the problem of deciding whether observed data is compatible with a presumed causal relationship between the variables (for example, a local hidden variable model). Traditionally, Bell inequalities have been used to describe the restrictions imposed by causal structures on marginal distributions. However, some structures give rise to non-convex constraints on the accessible data, and it has recently been noted that linear ineq… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
130
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 64 publications
(135 citation statements)
references
References 53 publications
(148 reference statements)
4
130
1
Order By: Relevance
“…There, an algorithm is presented that, even though computationally demanding, computes all Shannon-type entropic inequalities for given marginal constraints. Furthermore, it has turned out that entropic inequalities are useful in quantum physics where they restrict possible theories of data generation in more general settings than the ones using Bell inequalities (see, e.g., [27][28][29][30]). Moreover, we would like to mention that meanwhile, information measures for causal inference among strings based on compression length have been proposed [31], thus extending the possible applications of inequalities like the ones presented in this article.…”
Section: Discussionmentioning
confidence: 99%
“…There, an algorithm is presented that, even though computationally demanding, computes all Shannon-type entropic inequalities for given marginal constraints. Furthermore, it has turned out that entropic inequalities are useful in quantum physics where they restrict possible theories of data generation in more general settings than the ones using Bell inequalities (see, e.g., [27][28][29][30]). Moreover, we would like to mention that meanwhile, information measures for causal inference among strings based on compression length have been proposed [31], thus extending the possible applications of inequalities like the ones presented in this article.…”
Section: Discussionmentioning
confidence: 99%
“…In generalized Bell scenarios, we deal with the problem of deciding, whether observed data is compatible with a presumed causal relation between the variables [27]. It traditionally focuses on settings, when the region of compatible observations corresponds to some convex polytope.…”
Section: Introductionmentioning
confidence: 99%
“…The only cases that do not satisfy Evan's sufficient criteria for interestingness are the Bell and Triangle scenarios, and the graphs # 15, 16, 21. For the latter three, in section 4 we propose a novel extension of the methods of entropic inequalities [18][19][20] that confirms these graphs as interesting (and thereby completes the establishment of HLP's conjecture for graphs with up to six nodes). Section 5 contains our conclusions and outlook.…”
Section: Introductionmentioning
confidence: 66%
“…In this section we review notation and definitions that will be used in this paper. We refer the reader to [1,2] for background on causal models, and to [18][19][20][21] for background on entropic bounds for causal graphs relevant to this paper.…”
Section: Definitions and Statement Of The Problemmentioning
confidence: 99%