mlsanityData to 14 Oct 2026

Guide, Not Bind: Why Defeasible Priors Fail in Augmented Lagrangian Causal Discovery

arXiv 2609.03442 ↗First posted 3 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Differentiable causal discovery methods increasingly encode expert priors as forbidden-edge constraints enforced by an Augmented Lagrangian (ALM) penalty, on the assumption that a data-adaptive relaxation mechanism will discount and eventually override a rule the data consistently contradicts. We show this design, which we call guide, not bind, fails for two independent, precisely characterized reasons, and that directly repairing both restores it only partially. First, sequential penalty-ramping ALM suppresses a wrongly-forbidden true edge before any counterfactual check can detect it: we give three necessary conditions any adaptive relaxation must satisfy to avoid this (Proposition~refprop:conditions), prove that DADU---the natural relaxation rule this paper introduces as the object of study---violates all three (Corollary~refcor:dadufailure), and confirm the failure across 3,072 training runs spanning graphs from 4 to 32 nodes, where a single wrong prior suppresses a true edge in 87--97% of trials under DADU. Second, and independent of any fix to the mechanism, we prove in closed form that the standard correlation-matching objective ties a true edge and its reverse to an identical cost of exactly 2r2 (Lemma~reflem:tie), not because the underlying equal-variance model is unidentifiable, but because normalizing to correlation discards exactly the variance information that would make it identifiable; covariance matching instead separates the two directions by a provable margin of at least w04 (Lemma~reflem:separation).

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 38 references that are in the map. First posted on arXiv 3 Sep 2026.

Builds on

17 of 38 references.

References · 17

  1. 2017Constrained Policy Optimizationcited by 983
  2. 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
  3. 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 394
  4. 2019Gradient-Based Neural DAG Learningcited by 227
  5. 2020On the Role of Sparsity and DAG Constraints for Learning Linear DAGscited by 191
  6. 2013Causal Inference and Causal Explanation with Background Knowledgecited by 170
  7. 2022DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterizationcited by 140
  8. 2022CITRIS: Causal Identifiability from Temporal Intervened Sequencescited by 133
  9. 2023Not All Neuro-Symbolic Concepts Are Created Equal: Analysis and Mitigation of Reasoning Shortcutscited by 63
  10. 2018Two-Player Games for Efficient Non-Convex Constrained Optimizationcited by 55
  11. 2021DAGs with No Curl: An Efficient DAG Structure Learning Approachcited by 53
  12. 2020Probably Approximately Correct Constrained Learningcited by 47
5 more
  1. 2021The impact of prior knowledge on causal structure learningcited by 35
  2. 2023Stable Differentiable Causal Discoverycited by 31
  3. 2024Large Language Models are Effective Priors for Causal Graph Discoverycited by 24
  4. 2024Dagma-DCE: Interpretable, Non-Parametric Differentiable Causal Discoverycited by 6
  5. 2025The Robustness of Differentiable Causal Discovery in Misspecified Scenarioscited by 4

Built on by

Not cited yet.