Analytic DAG Constraints for Differentiable DAG Learning
Not on the map. Why?
Abstract (arXiv)
Recovering the underlying Directed Acyclic Graph (DAG) structures from observational data presents a formidable challenge, partly due to the combinatorial nature of the DAG-constrained optimization problem. Recently, researchers have identified gradient vanishing as one of the primary obstacles in differentiable DAG learning and have proposed several DAG constraints to mitigate this issue. By developing the necessary theory to establish a connection between analytic functions and DAG constraints, we demonstrate that analytic functions from the set f(x) = c0 + sumi=1∞cixi | forall i > 0, ci > 0; r = limirightarrow ∞ci/ci+1 > 0 can be employed to formulate effective DAG constraints. Furthermore, we establish that this set of functions is closed under several functional operators, including differentiation, summation, and multiplication. Consequently, these operators can be leveraged to create novel DAG constraints based on existing ones. Using these properties, we design a series of DAG constraints and develop an efficient algorithm to evaluate them. Experiments in various settings demonstrate that our DAG constraints outperform previous state-of-the-art comparators. Our implementation is available at https://github.com/zzhang1987/AnalyticDAGLearning.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 15 of its 39 references that are in the map. First posted on arXiv 24 Mar 2025.
Builds on
15 of 39 references.
References · 15
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
- 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 331
- 2019Gradient-Based Neural DAG Learningcited by 227
- 2021D'ya like DAGs? A Survey on Structure Learning and Causal Discoverycited by 211
- 2020On the Role of Sparsity and DAG Constraints for Learning Linear DAGscited by 191
- 2013Causal Inference in the Presence of Latent Variables and Selection Biascited by 166
- 2021Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Gamecited by 161
- 2022DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterizationcited by 140
- 2013High-dimensional learning of linear causal networks via inverse covariance estimationcited by 87
- 2020DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networkscited by 66
- 2021DAGs with No Curl: An Efficient DAG Structure Learning Approachcited by 53
Built on by
Citing papers per year: 2025: 2; 2026: 3.
5 papers.
- 2025Score-based Greedy Search for Structure Identification of Partially Observed Linear Causal Modelscited by 2
- 2025Differentiable Structure Learning and Causal Discovery for General Binary Datacited by 0
- 2026Efficient Differentiable Causal Discovery via Reliable Super-Structure Learningcited by 0
- 2026Structure Learning on Clustered Datacited by 0
- 2026Support Selection Beyond Smooth DAG Exactness: Completion Geometry,Score Margins, and Selective Certificatescited by 0
- 2026Support Selection Beyond Smooth DAG Exactness: Completion Geometry,Score Margins, and Selective Certificates8 Aug 2026
- 2026Structure Learning on Clustered Data9 Jul 2026
- 2026Efficient Differentiable Causal Discovery via Reliable Super-Structure Learning9 Jan 2026
- 2025Score-based Greedy Search for Structure Identification of Partially Observed Linear Causal Models5 Oct 2025
- 2025Differentiable Structure Learning and Causal Discovery for General Binary Data25 Sep 2025