Research map / Graph learning / Graph algorithms and clustering
Entropic Causal Inference: Graph Identifiability
Spencer Compton, Kristjan Greenewald, Dmitriy A Katz, Murat Kocaoglu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use entropic (MEC-based) orientation with peeling/enumeration instead of discrete ANM for graph learning | causal graph learning on synthetic unconstrained SCMs (triangle graph) · Triangle graph synthetic data | SHD | Improved |
Closest papers by meaning
- Causal Discovery with Fewer Conditional Independence Tests (ICML 2024 · similarity 0.89)
- Learning Linear Causal Representations from General Environments: Identifiability and Intrinsic Ambiguity (NeurIPS 2024 · similarity 0.89)
- Coarsening Linear Non-Gaussian Causal Models with Cycles (NeurIPS 2026 · similarity 0.88)
- Causal learning with the invariance principle (NeurIPS 2026 · similarity 0.88)
- Identifiable Latent Polynomial Causal Models through the Lens of Change (ICLR 2024 · similarity 0.88)
- Identifiability Guarantees for Causal Disentanglement from Purely Observational Data (NeurIPS 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
