AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Global Optimality in Bivariate Gradient-based DAG Learning

Chang Deng, Kevin Bello, Pradeep Kumar Ravikumar, Bryon Aragam

NeurIPS 2023 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 1 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
decrease the penalty coefficient mu_k faster than the prescribed schedule (bad scheduling) (ablation)homotopy gradient-flow path-following for bivariate DAG learning · 2-node linear SEM, population least squaresconvergence to global minimumHurt
use the prescribed mu_k schedule (Line 3 of Algorithm 1) instead of a faster decrease (ablation)homotopy gradient-flow path-following for bivariate DAG learning · 2-node linear SEM, population least squaresconvergence to global minimumImproved
vary the initialization of the gradient flow path under the proper schedulehomotopy gradient-flow path-following for bivariate DAG learning · 2-node linear SEM, population least squaresconvergence to global minimumNo clear effect
replace gradient flow with gradient descenthomotopy path-following scheme · 2-node linear SEM, appendix experimentsconvergence to global minimumNo clear effect

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