Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Detecting low-complexity unobserved causes (1202.3737v1)

Published 14 Feb 2012 in cs.LG and stat.ML

Abstract: We describe a method that infers whether statistical dependences between two observed variables X and Y are due to a "direct" causal link or only due to a connecting causal path that contains an unobserved variable of low complexity, e.g., a binary variable. This problem is motivated by statistical genetics. Given a genetic marker that is correlated with a phenotype of interest, we want to detect whether this marker is causal or it only correlates with a causal one. Our method is based on the analysis of the location of the conditional distributions P(Y|x) in the simplex of all distributions of Y. We report encouraging results on semi-empirical data.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Dominik Janzing (70 papers)
  2. Eleni Sgouritsa (7 papers)
  3. Oliver Stegle (6 papers)
  4. Jonas Peters (57 papers)
  5. Bernhard Schoelkopf (32 papers)
Citations (24)

Summary

We haven't generated a summary for this paper yet.