Learning Non-Gaussian SEMs with Conditional Risk, and Why the Direction of Recursion Matters
Not on the map. Why?
Abstract (arXiv)
Variance-based methods recover a Gaussian linear structural equation model (SEM) with equal or suitably constrained error variances, either by recursively identifying the source nodes with smallest conditional variance (top-down method) or sink nodes with highest conditional variance (bottom-up method). We show that the use of conditional variance is incidental: replacing it with the conditional risk, i.e., the minimal expected loss of linear prediction under the negative log-likelihood of the noise distribution, extends both methods to non-Gaussian noise. Existing methods are the least-squares special case. This yields two main results. First, exploiting the noise distribution improves structure recovery: the matched-loss procedures recover the SEM more accurately than their least-squares counterparts and the LiNGAM methods, which are designed for non-Gaussianity. Second, the two methods, interchangeable in the Gaussian setting, separate under non-Gaussian noise: the top-down method is correct for every noise density with finite differential entropy, whereas the bottom-up method requires a regularity condition and can fail without it, for instance under mean-zero exponential or Cauchy noise. Simulations confirm both results.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 37 references that are in the map. First posted on arXiv 9 Oct 2026.
Builds on
13 of 37 references.
References · 13
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
- 2020On the Role of Sparsity and DAG Constraints for Learning Linear DAGscited by 191
- 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
- 2018On Causal Discovery with Equal Variance Assumptioncited by 59
- 2017Learning linear structural equation models in polynomial time and sample complexitycited by 51
- 2023Structure Learning with Continuous Optimization: A Sober Look and Beyondcited by 36
- 2020A polynomial-time algorithm for learning nonparametric causal graphscited by 30
- 2022Optimal estimation of Gaussian DAG modelscited by 17
- 2021Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential familiescited by 11
- 2024Markov Equivalence and Consistency in Differentiable Structure Learningcited by 7
1 more
Built on by
Not cited yet.