Consistency guarantees for greedy permutation-based causal inference algorithms
From MaRDI portal
Cited in
(16)- A survey on causal discovery: theory and practice
- Greedy Causal Discovery Is Geometric
- Causal structure learning: a combinatorial perspective
- Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
- Consistency Guarantees for Greedy Permutation-Based Causal Inference Algorithms
- Toric ideals of characteristic imsets via quasi-independence gluing
- Post-selection inference for causal effects after causal discovery
- Algebraic geometry of discrete interventional models
- A general framework on conditions for constraint-based causal learning
- Tree-based additive noise directed acyclic graphical models for nonlinear causal discovery with interactions
- Integer programming for learning directed acyclic graphs from nonidentifiable Gaussian models
- Recursive causal discovery
- Confidence Sets for Causal Orderings
- Hyperplane representations of interventional characteristic imset polytopes
- On the edges of characteristic imset polytopes
- Coloured Gaussian directed acyclic graphical models
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)
