atlas

Research map / Graph learning / Graph algorithms and clustering

DAGs with NO TEARS: Continuous Optimization for Structure Learning

NeurIPS 2018 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 217 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 NOTEARS instead of FGSProtein signaling network structure learning · Protein signaling networkSHD: 22 vs. 22No clear effect
Add ℓ1 regularization (ablation)NOTEARS · Small-sample structure learning (n=20)structure recoveryHelped
Add ℓ1 regularization (ablation)NOTEARS · Structure learning across graph typesstructure recoveryHelped
Use a fixed threshold ω=0.3 rather than the setting-specific optimal threshold (ablation)NOTEARS · Simulated graph structure recoverystructure recoveryNo clear effect
Reduce the edge-weight scale α (ablation)NOTEARS · ER-2, d=20, n=1000SHDHurt
Use global continuous optimization rather than greedy local edge searchNOTEARS vs. FGS · Simulated structure learning, especially SF-4SHDHelped
Use NOTEARS rather than the exact global minimizerNOTEARS vs. GOBNILP · ER2, n=1000, λ=0F(W): 4.97 -> 5.02Hurt

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