atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networks

NeurIPS 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization · 28 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
Add KKTS post-processingAll tested base algorithms · ER and scale-free synthetic graphsSHD: by at least a factor of 2Helped
Add KKTS post-processingNOTEARS · Tested synthetic graph settingsSHDHelped
Terminate NOTEARS early at a higher h tolerance before KKTSNOTEARS-KKTS · Tested synthetic graph settingsrunning time: epsilon = 10^{-5}Helped
Terminate NOTEARS early at a higher h tolerance before KKTSNOTEARS-KKTS · Tested synthetic graph settingsSHDNo clear effect
Use Abs-KKTS instead of NOTEARSBayesian network structure learning · ER graphsSHDHelped
Use Abs-KKTS instead of NOTEARSBayesian network structure learning · ER graphsrunning timeHelped
Add the step that removes unnecessary edge-absence constraints (ablation)KKTS · Tested synthetic graph settingsSHDHelped
Add edge reversals (ablation)KKTS · Tested synthetic graph settingsSHDHelped

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