Core Concepts
The author explores how the common cause principle can resolve Simpson's paradox by introducing an unobserved variable C that acts as a common cause for A and B, providing insights into the association between two events.
Abstract
The content delves into Simpson's paradox, highlighting its implications in various scenarios and proposing solutions through the common cause principle. It discusses examples, matrix notations for inversion, and resolutions to this paradox.
Stats
For binary A1, A2, B, and C: "provided that (1) and (2, 3) are valid, all causes C hold p(a1|a2, c) > p(a1|¯a2, c)"
Inverting equation (4): "p(A1, A2, B|C) = p(A1, A2|C)p(B|C)"
Matrix notation inversion: "(i|k1){1|k} = (2|2)[i|k1][1|k]+((2|2)-1)[i|k2][2|k]"
Quotes
"The correct association between a1 and a2 is to be defined via conditioning over C."
"Common causes that reproduce (1), those that reproduce (2, 3), but there are many other possibilities."
"Simpson’s paradox is not a choice between two options (2, 3) and (1), it is a choice between many options given by different common causes C."