AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

A polynomial-time algorithm for learning nonparametric causal graphs

Ming Gao, Yi Ding, Bryon Aragam

NeurIPS 2020 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 4 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use NPVAR with generalized additive modelsNon-sparse DAGs with hub nodes · Simulation study; structure learningSHDImproved
Use NPVAR or EqVar instead of CAMNon-additive GP and GLM models · Simulation study; structure learningSHDImproved
Use PC with n=1000 samplesGLM model · Simulation study; structure learningSHDImproved
Use CAM instead of NPVARSettings where sparsity and additivity can be exploited · Simulation study; structure learningSHDMixed
Use the CAM greedy search on the three-node additive noise exampleCAM · Three-node additive noise modelOrder recoveryHurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy