Research map / Learning theory and algorithms / Sample complexity
A polynomial-time algorithm for learning nonparametric causal graphs
Ming Gao, Yi Ding, Bryon Aragam
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 NPVAR with generalized additive models | Non-sparse DAGs with hub nodes · Simulation study; structure learning | SHD | Improved |
| Use NPVAR or EqVar instead of CAM | Non-additive GP and GLM models · Simulation study; structure learning | SHD | Improved |
| Use PC with n=1000 samples | GLM model · Simulation study; structure learning | SHD | Improved |
| Use CAM instead of NPVAR | Settings where sparsity and additivity can be exploited · Simulation study; structure learning | SHD | Mixed |
| Use the CAM greedy search on the three-node additive noise example | CAM · Three-node additive noise model | Order recovery | Hurt |
Closest papers by meaning
- Learning causal graphs via nonlinear sufficient dimension reduction (JMLR 2025 · similarity 0.94)
- Coarsening Linear Non-Gaussian Causal Models with Cycles (NeurIPS 2026 · similarity 0.89)
- Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications (JMLR 2023 · similarity 0.89)
- Effective Causal Discovery under Identifiable Heteroscedastic Noise Model (AAAI 2024 · similarity 0.88)
- Interventional Causal Discovery in a Mixture of DAGs (NeurIPS 2024 · similarity 0.88)
- Markov Equivalence and Consistency in Differentiable Structure Learning (NeurIPS 2024 · similarity 0.87)
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.
