Conditional independencies under the algorithmic independence of conditionals

MaRDI QIDQ2834479zbMATH OpenFDO

Authors Jan Lemeire

Publication date 22 November 2016

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL http://jmlr.csail.mit.edu/papers/v17/14-450.html

zbMATH Keywords

causalityKolmogorov complexityfaithfulnessindependence of conditionals

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Geometry of the faithfulness assumption in causal inference
• Efficient algorithms for conditional independence inference
• A linear-algebraic tool for conditional independence inference
• Racing algorithms for conditional independence inference
• Logical and algorithmic properties of stable conditional independence

Cited in

(4)

• Faithfulness, coordination and causal coincidences
• Geometry of the faithfulness assumption in causal inference
• Conservative independence-based causal structure learning in absence of adjacency faithfulness
• Sensitivity analysis of violations of the faithfulness assumption

This page was built for publication: Conditional independencies under the algorithmic independence of conditionals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834479)