Inferring causal relationships as directed acyclic graphs (DAGs) is an
important but challenging problem. Differentiable Causal Discovery (DCD) is a
promising approach to this problem, framing the search as a continuous
optimization. But existing DCD methods are numerically unstable, with poor
performance beyond tens of variables. In this paper, we propose Stable
Differentiable Causal Discovery (SDCD), a new method that improves previous DCD
methods in two ways: (1) It employs an alternative constraint for acyclicity;
this constraint is more stable, both theoretically and empirically, and fast to
compute. (2) It uses a training procedure tailored for sparse causal graphs,
which are common in real-world scenarios. We first derive SDCD and prove its
stability and correctness. We then evaluate it with both observational and
interventional data and on both small-scale and large-scale settings. We find
that SDCD outperforms existing methods in both convergence speed and accuracy
and can scale to thousands of variables.

通过引入新的约束条件和训练过程，我们提出了稳定可微分因果发现（SDCD）方法，以解决推断因果关系作为有向无环图（DAGs）的问题。SDCD 方法在收敛速度和准确性方面优于现有方法，并可扩展到数千个变量的情况。