Causal Inference Using the Algorithmic Markov Condition
DOI10.1109/TIT.2010.2060095zbMATH Open1366.62020OpenAlexW2083689856WikidataQ130527136 ScholiaQ130527136MaRDI QIDQ5281268FDOQ5281268
Authors: Bernhard Schölkopf, Dominik Janzing
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2010.2060095
Statistical aspects of information-theoretic topics (62B10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)
Cited In (16)
- Discovering agents
- A survey on causal discovery: theory and practice
- On the entropy production of time series with unidirectional linearity
- Justifying information-geometric causal inference
- Learning quadratic variance function (QVF) DAG models via overdispersion scoring (ODS)
- Entanglement, complexity, and causal asymmetry in quantum theories
- The most likely common cause
- Causal Discovery via Reproducing Kernel Hilbert Space Embeddings
- Information-geometric approach to inferring causal directions
- From statistical to causal learning
- Causal Inference on Discrete Data via Estimating Distance Correlations
- A consistent estimator for confounding strength
- Title not available (Why is that?)
- Steps towards causal Formal Concept Analysis
- Inferencing the graphs of causal Markov fields
- Confounder detection in high-dimensional linear models using first moments of spectral measures
This page was built for publication: Causal Inference Using the Algorithmic Markov Condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281268)