Order-based Structure Learning with Normalizing Flows
Not on the map. Why?
Abstract (arXiv)
Estimating the causal structure of observational data is a challenging combinatorial search problem that scales super-exponentially with graph size. Existing methods use continuous relaxations to make this problem computationally tractable but often restrict the data-generating process to additive noise models (ANMs) through explicit or implicit assumptions. We present Order-based Structure Learning with Normalizing Flows (OSLow), a framework that relaxes these assumptions using autoregressive normalizing flows. We leverage the insight that searching over topological orderings is a natural way to enforce acyclicity in structure discovery and propose a novel, differentiable permutation learning method to find such orderings. Through extensive experiments on synthetic and real-world data, we demonstrate that OSLow outperforms prior baselines and improves performance on the observational Sachs and SynTReN datasets as measured by structural hamming distance and structural intervention distance, highlighting the importance of relaxing the ANM assumption made by existing methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 38 of its 62 references that are in the map. First posted on arXiv 14 Aug 2023.
Builds on
38 of 62 references.
References · 38
- 2015Variational Inference with Normalizing Flowscited by 2,161
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,539
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
- 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 636
- 2015MADE: Masked Autoencoder for Distribution Estimationcited by 306
- 2013Causal Discovery with Continuous Additive Noise Modelscited by 252
- 2019Gradient-Based Neural DAG Learningcited by 227
- 2021D'ya like DAGs? A Survey on Structure Learning and Causal Discoverycited by 209
- 2019Learning Sparse Nonparametric DAGscited by 207
- 2019Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacementcited by 205
- 2013CAM: Causal additive models, high-dimensional order search and penalized regressioncited by 175
26 more
- 2018Learning Latent Permutations with Gumbel-Sinkhorn Networkscited by 172
- 2019Causal Discovery with Reinforcement Learningcited by 145
- 2022Score matching enables causal discovery of nonlinear additive noise modelscited by 108
- 2020Causal Autoregressive Flowscited by 97
- 2022Deep End-to-end Causal Inferencecited by 93
- 2021BCD Nets: Scalable Variational Approaches for Bayesian Causal Discoverycited by 68
- 2013Causal Networks: Semantics and Expressivenesscited by 67
- 2022Diffusion Models for Causal Discovery via Topological Orderingcited by 64
- 2022Greedy Relaxations of the Sparsest Permutation Algorithmcited by 63
- 2018SparseMAP: Differentiable Sparse Structured Inferencecited by 62
- 2019Causal Discovery with General Non-Linear Relationships Using Non-Linear ICAcited by 58
- 2022On the Identifiability and Estimation of Causal Location-Scale Noise Modelscited by 56
- 2018On Causal Discovery with Equal Variance Assumptioncited by 55
- 2021Ordering-Based Causal Discovery with Reinforcement Learningcited by 55
- 2017Learning linear structural equation models in polynomial time and sample complexitycited by 49
- 2022Differentiable DAG Samplingcited by 46
- 2022Identifying Patient-Specific Root Causes with the Heteroscedastic Noise Modelcited by 38
- 2020A polynomial-time algorithm for learning nonparametric causal graphscited by 29
- 2017Bayesian Network Learning via Topological Ordercited by 14
- 2021Efficient Bayesian network structure learning via local Markov boundary searchcited by 14
- 2023DAG Learning on the Permutahedroncited by 9
- 2013On Sampling from the Gibbs Distribution with Random Maximum A-Posteriori Perturbationscited by 7
- 2013An Algorithm for the Construction of Bayesian Network Structures from Datacited by 5
- 2013Optimizing Causal Orderings for Generating DAGs from Datacited by 5
- 2022Sequentially learning the topological ordering of causal directed acyclic graphs with likelihood ratio scorescited by 3
- 2019Conditionally-additive-noise Models for Structure Learningcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2025CausalPFN: Amortized Causal Effect Estimation via In-Context Learningcited by 43
- 2024A Geometric View of Data Complexity: Efficient Local Intrinsic Dimension Estimation with Diffusion Modelscited by 41
- 2025Skewness-Robust Causal Discovery in Location-Scale Noise Modelscited by 1
- 2026Learning the Structure of Triangular Transport Mapscited by 0
- 2026Learning the Structure of Triangular Transport Maps29 Sep 2026
- 2025Skewness-Robust Causal Discovery in Location-Scale Noise Models18 Nov 2025
- 2025CausalPFN: Amortized Causal Effect Estimation via In-Context Learning9 Jun 2025
- 2024A Geometric View of Data Complexity: Efficient Local Intrinsic Dimension Estimation with Diffusion Models5 Jun 2024