Consistency guarantees for greedy permutation-based causal inference algorithms
From MaRDI portal
Publication:5022664
DOI10.1093/BIOMET/ASAA104OpenAlexW3119547197WikidataQ130530797 ScholiaQ130530797MaRDI QIDQ5022664FDOQ5022664
Authors: Liam Solus, Yuhao Wang, Caroline Uhler 
Publication date: 19 January 2022
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.03530
causal inferenceGaussian graphical modelBayesian networkdirected acyclic graphgeneralized permutohedrongreedy searchfaithfulnessDAG associahedronpointwise and high-dimensional consistency
Cited In (6)
- Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
- A survey on causal discovery: theory and practice
- Toric ideals of characteristic imsets via quasi-independence gluing
- Greedy Causal Discovery Is Geometric
- Causal structure learning: a combinatorial perspective
- Consistency Guarantees for Greedy Permutation-Based Causal Inference Algorithms
This page was built for publication: Consistency guarantees for greedy permutation-based causal inference algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5022664)
