mlsanityData to 14 Oct 2026

Global Optimality in Bivariate Gradient-based DAG Learning

arXiv 2306.17378 ↗First posted 30 Jun 2023cs.LG stat.MLcited by 10

Not on the map. Why?

Abstract (arXiv)

Recently, a new class of non-convex optimization problems motivated by the statistical problem of learning an acyclic directed graphical model from data has attracted significant interest. While existing work uses standard first-order optimization schemes to solve this problem, proving the global optimality of such approaches has proven elusive. The difficulty lies in the fact that unlike other non-convex problems in the literature, this problem is not "benign", and possesses multiple spurious solutions that standard approaches can easily get trapped in. In this paper, we prove that a simple path-following optimization scheme globally converges to the global minimum of the population loss in the bivariate setting.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 30 of its 57 references that are in the map. First posted on arXiv 30 Jun 2023.

Builds on

30 of 57 references.

References · 30

  1. 2021Convex optimizationcited by 2,515
  2. 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
  3. 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 331
  4. 2014The Loss Surfaces of Multilayer Networkscited by 280
  5. 2016Deep Learning without Poor Local Minimacited by 234
  6. 2019Gradient-Based Neural DAG Learningcited by 227
  7. 2019Learning Sparse Nonparametric DAGscited by 207
  8. 2020On the Role of Sparsity and DAG Constraints for Learning Linear DAGscited by 191
  9. 2013Learning Bayesian Networks: The Combination of Knowledge and Statistical Datacited by 187
  10. 2019Causal Discovery with Reinforcement Learningcited by 145
  11. 2022DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterizationcited by 140
  12. 2017No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysiscited by 129
18 more
  1. 2017Theoretical insights into the optimization landscape of over-parameterized shallow neural networkscited by 128
  2. 2016Matrix Completion has No Spurious Local Minimumcited by 125
  3. 2013High-dimensional learning of linear causal networks via inverse covariance estimationcited by 87
  4. 2016Global Optimality of Local Search for Low Rank Matrix Recoverycited by 82
  5. 2020DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networkscited by 66
  6. 2017Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputscited by 61
  7. 2018On Causal Discovery with Equal Variance Assumptioncited by 59
  8. 2016The non-convex Burer-Monteiro approach works on smooth semidefinite programscited by 46
  9. 2020On the Convergence of Continuous Constrained Optimization for Structure Learningcited by 38
  10. 2015On Graduated Optimization for Stochastic Non-Convex Problemscited by 34
  11. 2014Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problemscited by 25
  12. 2018Adding One Neuron Can Eliminate All Bad Local Minimacited by 21
  13. 2022Single Loop Gaussian Homotopy Method for Non-convex Optimizationcited by 16
  14. 2017Bayesian Network Learning via Topological Ordercited by 14
  15. 2018Bivariate Causal Discovery and its Applications to Gene Expression and Imaging Data Analysiscited by 5
  16. 2022Bivariate Causal Discovery for Categorical Data via Classification with Optimal Label Permutationcited by 3
  17. 2020Convergence Analysis of Homotopy-SGD for non-convex optimizationcited by 2
  18. 2014A Greedy Homotopy Method for Regression with Nonconvex Constraintscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 5; 2025: 2; 2026: 2.

10 papers.