6 results
(BibTeX)

**Information-geometric approach to inferring causal directions** *Artificial Intelligence*, 182-183, 1-31
(Article)

**Causal Markov condition for submodular information measures** In: *Proceedings of the 23rd Annual Conference on Learning Theory*, *COLT 2010: The 23rd Annual Conference on Learning Theory*, 464-476, OmniPress, Madison, WI, USA, COLT 2010
(In Proceedings)

**Justifying Additive Noise Model-Based Causal Discovery via Algorithmic Information Theory** *Open Systems and Information Dynamics*, 17(2):189-212
(Article)

**Inferring deterministic causal relations** In: *Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence*, *Uncertainty in Artificial Intelligence: Proceedings of the Twenty-Sixth Conference (UAI 2010)*, 143-150, AUAI Press, Corvallis, OR, USA, UAI 2010
(In Proceedings)

**Information-theoretic inference of common ancestors** *Computing Research Repository (CoRR)*, abs/1010.5720, 18 pages
(Article)

**Quantum broadcasting problem in classical low-power signal processing** *Physical Review A*, 75(2):11 pages
(Article)

I am part of the Causal and Probabilistic Inference Group and I am working on the problem of inferring causal relations in cases where interventions are infeasible and therefore only data from passive observations is available. It has been argued that causal information can be obtained from statistical conditional independences through the so called Causal Markov and Faithfulness conditions. However, there exist two limitations in this approach. First, inferences can only be drawn in the case of more than two variables. Therefore we are searching for additional assumptions that allow for conclusions already in the two variable case. Second, estimating conditional dependences is challenging if only a limited number of samples are at hand or if samples cannot be obtained under similar experimental conditions (non-i.i.d). We addressed this issue by considering not only statistical but also algorithmic notions of dependences based on the framework of algorithmic information theory. Since the latter rests upon Kolmogorov complexity that is uncomputable we are working on a formal framework for computable alternatives.