Temporal Inference with Finite Factored Sets

09/23/2021
by   Scott Garrabrant, et al.
0

We propose a new approach to temporal inference, inspired by the Pearlian causal inference paradigm - though quite different from Pearl's approach formally. Rather than using directed acyclic graphs, we make use of factored sets, which are sets expressed as Cartesian products. We show that finite factored sets are powerful tools for inferring temporal relations. We introduce an analog of d-separation for factored sets, conditional orthogonality, and we demonstrate that this notion is equivalent to conditional independence in all probability distributions on a finite factored set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/06/2021

Topological Conditional Separation

Pearl's d-separation is a foundational notion to study conditional indep...
research
08/06/2021

Conditional Separation as a Binary Relation

Pearl's d-separation is a foundational notion to study conditional indep...
research
12/12/2012

Inference with Seperately Specified Sets of Probabilities in Credal Networks

We present new algorithms for inference in credal networks --- directed ...
research
04/23/2008

Causal inference using the algorithmic Markov condition

Inferring the causal structure that links n observables is usually based...
research
08/06/2021

Causal Inference Theory with Information Dependency Models

Inferring the potential consequences of an unobserved event is a fundame...
research
08/02/2015

Learning from Pairwise Marginal Independencies

We consider graphs that represent pairwise marginal independencies among...
research
03/23/2023

Nominal Sets in Agda – A Fresh and Immature Mechanization

In this paper we present our current development on a new formalization ...

Please sign up or login with your details

Forgot password? Click here to reset