Some Staged Tree Models For Learning From Interventions
summary
Defines a restricted family of colored probability trees called CS-trees and proves a global Markov-type property: distributions in the model correspond exactly to being Markov to a sequence of context graphs built from the tree’s minimal contexts. Uses stage tree / chained event graph parametrization, an ordering assumption (fixed total order, no truncation), and an augmentation for soft interventions that requires complete intervention targets. Results give a Verma–Pearl–style structural equivalence criterion and outline where the ordering and completeness restrictions block straightforward generalization.
AI-written summary · about
chapters (8)
- 0:00Start
- 2:17Probabilistic Theory of Causality
- 3:36Stage Tree Models
- 3:46Stage Tree Model
- 6:33Models That Allow for Stochastic Soft Interventions
- 8:36Interpretability
- 15:54Specialization and Absorption
- 17:03Minimal Contexts
related talks
24mA Friendly Introduction To Causality
35mUnderstanding, Simplicity, And Decision Trees
01h 04mIntroduction to Experimental Design
01h 01mIntroduction to Experimental Design
33mLearning a Tree-Structured Ising Model in Order to Make Predictions
01h 06mIntroduction to Causal Graphical Models: Graphs, d-separation, do-calculus
01h 08mAn Introduction to Potential Outcomes, DAGs and Single-World Intervention Graphs
01h 07mAn Introduction to Potential Outcomes, DAGs and Single-World Intervention Graphs
