betaFeedback

WorksMathematics

Causal discovery from Bayesian symbolic regression

Abstract

Causal discovery from observational data is central to scientific reasoning, yet established constraint-based and score-based methods often recover only a Markov equivalence class and provide no signal in bivariate or strongly autocorrelated regimes typical in some areas of science. Here, we recast causal discovery as a Bayesian symbolic regression problem. Given a set of candidate parents for each target variable, the Bayesian symbolic regression samples closed-form expressions from a posterior over symbolic models. The fraction of sampled expressions in which each candidate variable appears defines a posterior inclusion probability that we use as the causal score. This replaces pointwise model selection by an ensemble of plausible mechanisms. We evaluate the method on coupled nonlinear bivariate dynamics, on the CauseMe benchmark suite spanning linear, chaotic, nonlinear, higher-dimensional and high-noise settings, and on a four-variable biogeoscience structural causal model under Gaussian, heavy-tailed and mixed-noise regimes. Our approach is competitive with, and often outperforms, specialized causal discovery algorithms. Additionally, the method returns closed-form mechanisms leading to explicit causality and interpretability.

Introduction

Scientific understanding is built on mechanisms that describe how interventions on one part of a system propagate through the rest. Moving from statistical association to structural causation is a long-standing endeavor that has reshaped many disciplines 1–3. In disciplines where true experiments are seldom possible, causal reasoning is essential to attribute change to forcings, to identify indirect connections, and to evaluate process-based and data-driven models on physical and mechanistic rather than purely predictive grounds. This is the case for Earth and climate sciences [4, 5, 6], neuroscience [7, 8], epidemiology [9], and economics [10], to name a few examples.

Dominant causal discovery paradigms rely on conditional-independence tests over a presumed faithful distribution and return graphs only up to a Markov equivalence class [11] [2]. In the bivariate setting, where one wishes to distinguish X→YX \to Y from Y→XY \to X, the marginal independence structure is the same for both directions and constraint-based methods provide no signal. To break this symmetry, one can exploit structural restrictions on the functional form (additive noise models [12, 13], LiNGAM [14]), invariance under environments [15, 16], or algorithmic information principles [17, 18, 19]. Approaches in the latter family can assign complexity to causal graphs—usually measured as the causal graph Kolmogorov complexity approximated through kernel embeddings [20, 21] or stochastic codes [22, 23]—and can therefore use the minimum description length (MDL) principle for causal graph selection. Still other approaches operate in the time domain through Granger causality [24], convergent cross mapping [25], and conditional-independence variants tailored to autocorrelation [26, 27].

Here, we argue that probabilistic symbolic regression approaches [28, 29] offer a better solution to causal discovery, even in the bivariate case. Indeed, from dynamical systems, we know that the equilibrium states of a first-order ordinary differential (ODE) system on which we intervene can be recovered using a structural causal model (SCM) [30]. Interestingly, under standard stability assumptions, recovering the differential (or difference) equation that governs a process therefore amounts to recovering the SCM of its equilibrium or stationary regime. This result suggests that symbolic regression is then not only a predictive surrogate but a constructive route to the structural mechanisms targeted by causal inference [6].

With this motivation in mind, here we use methods that explore the space of closed-form mathematical expressions to find causal relationships. In particular, we use the Bayesian machine scientist (BMS) [28], which explores this space with a Markov chain Monte Carlo (MCMC) sampler over symbolic expressions and assigns each expression a plausibility based on its description length [31]. The output is a sample taken from the posterior distribution of plausible mechanisms. We define the causal score of a candidate parent variable in the causal graph as the variable’s posterior inclusion frequency, that is, the fraction of sampled expressions in which the variable appears. This score handles many candidate parents and lagged predictors, is robust to high noise levels, accommodates autocorrelation, and remains informative in regimes where several expressions fit the data. Besides, our method simultaneously delivers a causal graph and explicit functional forms for plausible mechanisms.

This paper makes three contributions. First, a formalization of causal discovery as Bayesian symbolic regression, in which the causal score of each candidate parent is its posterior inclusion frequency in the ensemble of sampled mechanisms. Second, an identifiability analysis that connects causal recovery to the recently characterized learnability transition of probabilistic model selection [32], separating a learnable low-noise regime, a transitional regime, and an unlearnable high-noise regime. Third, an evaluation on a wide variety of problems, from bivariate nonlinear dynamics, to biogeoscience structural causal models, and standard benchmark suites [26, 27]. In all of them causalBMS attains the highest or very competitive performance compared to specialized methods elsewhere, while additionally returning the closed-form mechanism that produced the data or very good approximations to those.

Causal scores from Bayesian symbolic regression

Bayesian symbolic regression from time series

We consider a vector of observable variables x(t)∈Rd\mathbf{x}(t) \in\mathbb{R}^{d}, t=1,…,Tt = 1,\ldots,T. Each component xix^{i} is assumed to be generated by a structural equation[33]

xi(t)=fi∗(xPa⁡(i)(t−1),…,xPa⁡(i)(t−τmax⁡))+εi(t),(1)x^{i}(t) = f_{i}^{*}\left(\mathbf{x}_{\operatorname{Pa}(i)}(t-1),\ldots,\mathbf{x}_{\operatorname{Pa}(i)}(t-\tau_{\max})\right) + \varepsilon^{i}(t), \tag*{(1)}

with Pa⁡(i)⊆{1,…,d}\operatorname{Pa}(i) \subseteq\{1,\ldots,d\} the set of causal parents of xix^{i} and εi∼N(0,σ)\varepsilon^{i} \sim\mathcal{N}(0,\sigma) an exogenous Gaussian noise term assumed mutually independent across ii and tt. In this setting, the goal of causal discovery is to recover {Pa⁡(i)}i=1d\{\operatorname{Pa}(i)\}_{i=1}^{d}, or its lagged extension, from the data D={x(t)}t=1T\mathcal{D} = \{\mathbf{x}(t)\}_{t=1}^{T}. In contrast, the goal of symbolic regression is originally to recover fi∗f_{i}^{*} in closed form. The key observation is that, under the stated conditions, causal discovery becomes easier if one first solves the symbolic regression problem.

Indeed, we note that Eq. (1) also admits a structural causal interpretation. For a deterministic dynamical system x˙=F(x)\dot{\mathbf{x}} = \mathbf{F}(\mathbf{x}) with a globally stable equilibrium, the parent set induced by F\mathbf{F} at equilibrium defines an SCM that is consistent with the do-calculus on perfect interventions[30]. The same construction applies to discrete-time systems satisfying Eq. (1) under standard stationarity conditions. Recovering fi∗f_{i}^{*} therefore yields, under these assumptions, both a predictive equation and the structural mechanism that defines the causal effect of intervening on the parents of xix^{i}. This intuition that symbolic regression drives causal discovery can thus be properly formalized.

The space of admissible expressions for the ii-th component is denoted Fi\mathcal{F}_{i}. Following standard practice in symbolic regression[28, 29, 32], we represent closed-form expressions fi∈Fif_{i} \in\mathcal{F}_{i} as labeled trees whose internal nodes are operators drawn from a fixed alphabet O={+,×,exp⁡,log⁡,sin⁡,…}\mathcal{O} = \{+,\times,\exp,\log,\sin,\ldots\} and whose leaves are variables or real parameters θ∈Θfi⊆Rkfi\theta\in\Theta_{f_{i}} \subseteq\mathbb{R}^{k_{f_{i}}}. Such alphabet is often selected (restricted) by domain knowledge and process understanding. In symbolic regression approaches such as SINDy[34], the model is restricted to linear combinations of certain basis functions. The selection of these basis functions is critical and, in general, limits the expressiveness of the approach[35]. By contrast, probabilistic symbolic regression and the BMS[28, 29] impose no such restrictions and allow any function combination and composition from the alphabet.

For a target xix^{i} and an expression fi∈Fif_{i} \in\mathcal{F}_{i}, the BMS uses probabilistic arguments to assign to each candidate expression fi∈Fif_{i} \in\mathcal{F}_{i} the posterior probability

p(fi∣D)=1p(D)∫Θfip(D∣fi,θ) p(θ∣fi) p(fi) dθ=exp⁡[−H(fi)]Z,(2)\begin{aligned} p(f_{i} \mid\mathcal{D}) = \frac{1}{p(\mathcal{D})}\int_{\Theta_{f_{i}}} p(\mathcal{D} \mid f_{i},\theta)\,p(\theta\mid f_{i})\,p(f_{i})\,\mathrm{d}\theta\\ &= \frac{\exp\left[-\mathcal{H}(f_{i})\right]}{Z}, \tag*{(2)} \end{aligned}

with description length (or information Hamiltonian)[36] H(fi)=−log⁡p(D,fi)\mathcal{H}(f_{i}) = -\log p(\mathcal{D},f_{i}), evidence (or partition function) Z=p(D)Z = p(\mathcal{D}), parameter prior p(θ∣fi)p(\theta\mid f_{i}), and structural prior p(fi)p(f_{i})[28, 37]. The structural prior can either be learned from a corpus of mathematical expressions extracted from scientific texts under a maximum-entropy assumption[28] or chosen to encode other forms of knowledge about the target expression[38]. Under the assumption of Gaussian exogenous noise εi(t)∼N(0,σ)\varepsilon^{i}(t) \sim\mathcal{N}(0,\sigma) and using Laplace’s approximation around the maximum-likelihood estimator θ∗=argmax⁡θ p(D∣fi,θ)\theta^{*} = \underset{\theta}{\operatorname{argmax}}\,p(\mathcal{D} \mid f_{i},\theta), the description length is

H(fi)≈B(fi)2−log⁡p(fi),(3)\mathcal{H}(f_{i}) \approx\frac{B(f_{i})}{2} - \log p(f_{i}), \tag*{(3)}

where B(fi)=−2log⁡p(D∣fi,θ∗)+(kfi+1)log⁡TB(f_{i}) = -2\log p(\mathcal{D} \mid f_{i},\theta^{*}) + (k_{f_{i}}+1)\log T is the Bayesian information criterion[39] of fif_{i}, kfik_{f_{i}} is the number of parameters of fif_{i}[40], and TT is the number of observed time points. Note that Eq. (3) makes the connection with the MDL two-part code[37] explicit: B(fi)/2B(f_{i})/2 encodes data and parameters, while −log⁡p(fi)-\log p(f_{i}) encodes the structural complexity of the expression.

The BMS explores the space Fi\mathcal{F}_{i} by generating a Metropolis chain over expression trees with three local moves: root addition or removal, elementary-tree replacement, and node replacement[28]. Parallel tempering across a temperature ladder {Tk}\{T_{k}\} stabilizes the exploration of the rugged H\mathcal{H}-landscape[28], and the chain returns a set Si={fi(j)}j=1M\mathcal{S}_{i} = \{f_{i}^{(j)}\}_{j=1}^{M} of expressions sampled from p(fi∣D)p(f_{i} \mid\mathcal{D}). Note that this is a key aspect of our approach, as averages over the chain of models Si\mathcal{S}_{i} are an approximation to an average over the posterior, which is in general a better estimator of any observable than those provided by any single model[29].

From sampled expressions to causal scores

Each sampled expression fi(j)∈Sif_{i}^{(j)} \in\mathcal{S}_{i} specifies a set of parents that plausibly enter the causal mechanism for xix^{i}. Pooling the expressions in the chain Si\mathcal{S}_{i} yields a posterior estimate of the probability that a candidate parent participates in the generating expression. Specifically, for a target xix^{i} and a candidate parent xk(t−τ)x^{k}(t-\tau), the posterior inclusion frequency is

πk→i(τ)=1M∑j=1MI[xk(t−τ)∈L(fi(j))],(4)\pi_{k\to i}(\tau) = \frac{1}{M}\sum_{j=1}^{M}\mathbb{I}\left[x^{k}(t-\tau) \in\mathcal{L}\left(f_{i}^{(j)}\right)\right], \tag*{(4)}

where L(f)\mathcal{L}(f) denotes the set of leaves of expression ff that are observable variables, I\mathbb{I} is the indicator function, and the sum is over the sampled expressions in Si\mathcal{S}_{i}. Marginalizing over lags,

Algorithm 1. causalBMS: Causal discovery from Bayesian symbolic regression

Require: Data D={x(t)}t=1T\mathcal{D} = \{x(t)\}_{t=1}^{T}; alphabet O\mathcal{O}; corpus-derived prior p(f)p(f); maximum lag τmax⁡\tau_{\max}; chain length MM; tempering ladder {Tk}k=1K\{T_k\}_{k=1}^{K}

Ensure: Causal score matrix Π^∈[0,1]d×d\widehat{\Pi} \in[0,1]^{d \times d} and ensembles of equations {Si}i=1d\{\mathcal{S}_i\}_{i=1}^{d}

  1. for i=1i = 1 to dd do

  2. Construct candidate predictor set Xi={xk(t−τ):k∈{1,…,d}, τ∈{0,…,τmax⁡}}∖{xi(t)}\mathcal{X}_i = \{x^k(t-\tau): k \in\{1,\ldots,d\},\ \tau\in\{0,\ldots,\tau_{\max}\}\} \setminus\{x^i(t)\}.

  3. Run parallel-tempered Metropolis MCMC on Fi\mathcal{F}_i targeting p(f∣D)∝exp⁡[−H(f)]p(f|\mathcal{D}) \propto\exp[-\mathcal{H}(f)] via Eq. (3).

  4. Collect post-burn-in samples Si={fi(j)}j=1M\mathcal{S}_i = \{f_i^{(j)}\}_{j=1}^{M} from the cold replica.

  5. for k=1k = 1 to dd, k≠ik \ne i do

  6. πk→i←1M∑jI[∃τ:xk(t−τ)∈Var⁡(fi(j))]\pi_{k \to i} \leftarrow\frac{1}{M}\sum_j \mathbb{I}\left[\exists\tau: x^k(t-\tau) \in\operatorname{Var}(f_i^{(j)})\right].

  7. end for

  8. end for

  9. return Π=(πk→i)k,i\Pi= (\pi_{k \to i})_{k,i} and the ensembles Si\mathcal{S}_i.

we obtain a variable-level score independent of lag

πk→i=1M∑j=1MI[∃τ:xk(t−τ)∈L(fi(j))],(5)\pi_{k \to i} = \frac{1}{M}\sum_{j=1}^{M}\mathbb{I}\left[\exists\tau: x^k(t-\tau) \in\mathcal{L}(f_i^{(j)})\right], \tag*{(5)}

which we use as the score of the inferred causal relationship k→ik \to i. By thresholding πk→i\pi_{k \to i} for all variables, we obtain a directed causal graph; by ranking edges in the causal graph by πk→i\pi_{k \to i}, we obtain precision-recall and ROC curves. The full procedure is summarized in Algorithm 1.

Consistency, equation learnability and identifiability of causal parents

The description length is a consistent model-selection criterion, meaning that, as T→∞T \to\infty, the posterior p(fi∣D)p(f_i|\mathcal{D}) concentrates on the model that minimizes H(fi)\mathcal{H}(f_i) over Fi\mathcal{F}_i, which happens to be the ground-truth model fi∗f_i^* as long as fi∗∈Fif_i^* \in\mathcal{F}_i[32, 37, 39]. We summarize the implications for the inclusion-frequency score.

Proposition 1 (Asymptotic recovery of the causal parents). Assume that (i) the true mechanism fi∗f_i^* is in Fi\mathcal{F}_i; (ii) the prior p(fi)p(f_i) assigns strictly positive mass to fi∗f_i^*; (iii) the exogenous noise σ\sigma is finite; and (iv) the MCMC sampler is ergodic. Then πk→i→I[k∈Pa⁡(i)]\pi_{k \to i} \to\mathbb{I}[k \in\operatorname{Pa}(i)] with probability approaching one as T→∞T \to\infty and M→∞M \to\infty.

For a fixed and finite TT, however, recovery is not guaranteed at all noise levels even when assumptions (i), (ii), and (iv) above hold. Indeed, Fajardo-Fontiveros et al.[32] show that probabilistic model selection over closed-form expressions exhibits a sharp transition between a low-noise regime in which the true model has the smallest description length and a high-noise regime in which a trivial model becomes more plausible. Since probabilistic model selection is Bayes optimal, no other method will be able to recover the true generating model in the high-noise regime. An upper bound (that is typically tight) to the transition noise is

σ×≈(⟨δ2⟩T2ΔM∗+(ki∗−1)log⁡T)1/2,(6)\sigma^{\times} \approx\left(\frac{\langle\delta^2 \rangle T}{2\Delta_M^* + (k_i^* - 1)\log T}\right)^{1/2}, \tag*{(6)}

where ki∗k_i^* is the number of parameters of fi∗f_i^*, ΔM∗=log⁡p(fic)−log⁡p(fi∗)\Delta_M^* = \log p(f_i^c) - \log p(f_i^*) is the gap in structural description length between fi∗f_i^* and the trivial model fic=arg⁡max⁡fip(fi)f_i^c = \arg\max_{f_i} p(f_i) (which, in our maximum entropy prior corresponds to a constant fic=θ0f_i^c = \theta_0), and ⟨δ2⟩\langle\delta^2 \rangle is the variance of fi∗f_i^* over the support of the predictors[32]. This leads us to a second proposition.

Proposition 2 (Asymptotic causal unidentifiability). For finite TT and σ→∞\sigma\to\infty, the posterior p(fi∣D)p(f_i|\mathcal{D}) concentrates around the trivial model fic=arg⁡max⁡fip(fi)f_i^c = \arg\max_{f_i} p(f_i), the inclusion frequencies πk→i\pi_{k \to i} approach the prior expectations Ep(fi)[I[xk∈L(fi)]]\mathbb{E}_{p(f_i)}[\mathbb{I}[x^k \in\mathcal{L}(f_i)]] independently of the true Pa⁡(i)\operatorname{Pa}(i), and the causal score loses all discriminative power.

Yet, whether causal parents can be detected at finite σ>σ×\sigma> \sigma^\times, where the exact true model cannot possibly be identified from the data alone, is an open empirical question—in principle, it is possible that, even when the ground-truth model fi∗f_i^* is unlearnable, some other model with the correct causal structure maximizes the posterior. We return to this issue below in section III A.

Experimental results

We evaluate our causal discovery approach based on BMS (causalBMS) across a wide range of datasets, to understand how the approach performs under relevant scenarios of nonlinear processes, strong couplings, non-stationarity, high-dimensional scenarios, and different levels and diversity of noise sources. All aspects have been identified as critical for causal discovery[4]. In particular, we evaluate the method on: (i) a coupled nonlinear bivariate dynamical system; (ii) the CauseMe benchmark suite spanning linear, chaotic, nonlinear, high-dimensional and high-noise settings; and (iii) a biogeoscience structural causal model of shortwave radiation, air temperature, gross primary productivity and ecosystem respiration under Gaussian, heavy-tailed and mixed-noise regimes.

We compare causalBMS to standard methods in the literature (PCMCI+[26, 41], VAR-LiNGAM[14, 42], convergent cross mapping (CCM)[25]), and a wide variety of methods in the CauseMe platform leaderboard[27], and through standard metrics of performance (F1 score, precision-recall scores and the ROC AUC metric). We also study the robustness of symbolic regression to noise in the coupled nonlinear bivariate dynamical system and in the biogeoscience selected case study.

The experimental setup requires running causalBMS multiple times and averaging the results. Computational cost is dominated by the MCMC sweep across targets; in our experiments we use a minimum of M∼104M \sim10^4 retained samples after burn-in, parallel tempering with a minimum of K=10K = 10 replicas, and a tree-size cap ∣fi∣≤50|f_i| \le50 nodes.

Causal and functional recovery in unidirectionally coupled nonlinear dynamics

We start by considering a bivariate coupled system that combines self-excitation with a unidirectional coupling and is governed by the following equations

xt=3.4xt−1(1−xt−12)exp⁡(−xt−12)+εtx,yt=3.4yt−1(1−yt−12)exp⁡(−yt−12)+0.5xt−1yt−1+εty,(7)\begin{aligned} x_t &= 3.4x_{t-1}(1-x_{t-1}^{2})\exp(-x_{t-1}^{2})+\varepsilon_t^x,\\ y_t &= 3.4y_{t-1}(1-y_{t-1}^{2})\exp(-y_{t-1}^{2})+0.5x_{t-1}y_{t-1}+\varepsilon_t^y, \tag*{(7)} \end{aligned}

with ε∼N(0,σ)\varepsilon\sim\mathcal{N}(0,\sigma). The causal pair (X→Y,Y↛X)(X \to Y, Y \not\to X) is hard for linear and Granger-style methods, which see strong autocorrelation in both series. Indeed, for moderate levels of noise σ2=0.4\sigma^{2} = 0.4, these methods fail to detect the correct causal links[6]. Here, we investigate whether our Bayesian symbolic regression approach can detect the correct causal relationships and governing equations at different noise levels (Figure 1). The levels of noise we investigate go from low, where autocorrelation and cross-correlation between both time series are strong (Figure 1a), to very high, where autocorrelation in the xtx_t time series is much weaker, and the dynamics of yty_t is dominated by some sporadic large bursts (Figure 1d). In all cases, we let causalBMS explore time lags τ=1,2,3\tau= 1,2,3 to evaluate whether autocorrelation in the time series leads to failure to distinguish direct from indirect temporal effects or other forms of lag misidentification.

Figure 1. Causal and functional recovery in unidirectionally coupled nonlinear dynamics. (a-d) Sample observed trajectories xtx_t and yty_t for the system in Eq. (7). (e-h) Causal scores πk→i(τ)\pi_{k\to i}(\tau) obtained by causalBMS from Eq. (4). (i-l) Minimum description length expressions sampled by causalBMS (green) reproduce the true self-influence (black). Grey points are the N=2000N = 2000 observations. Equation labels in the legend are the closed-form expressions inferred by the chain. We consider four noise regimes: low noise (σ=0.04\sigma= 0.04, first column); moderate noise (σ=0.4\sigma= 0.4, second column); high noise (σ=4\sigma= 4, third column); very high noise (σ=10\sigma= 10, fourth column).

As we show in Figure 1e-Figure 1h, causalBMS correctly and unequivocally identifies causal parents and lags at all levels of noise, with lagged causal scores πk→i(τ)\pi_{k\to i}(\tau) close to one when a causal link k→ik \to i exists at τ\tau, and close to zero when it does not. Only when the autocorrelation in the xtx_t series becomes very weak, does the corresponding score decrease to πX→X(1)=0.74\pi_{X\to X}(1) = 0.74, still clearly above 0.5 and above the true negative edges.

Our causalBMS draws from the posteriors over equations for xtx_t and yty_t separately and reads directionality from the inclusion frequencies in Eq. (5). The ensemble assigns lag τ=1\tau= 1 in XX a high inclusion probability inside the equation for yty_t, and YY a very low inclusion probability inside the equation for xtx_t, recovering the correct causal effect. Beyond directionality, the method recovers, or at least approximates, the functional form of the interaction (Figure 1i-Figure 1l). At low noise (σ=0.04\sigma= 0.04), the true fi∗f_i^* is well approximated within the observed range of x(t)x(t) (Figure 1i), which is relatively narrow and prevents causalBMS from learning the limiting behavior and, thus, the exact functional form fi∗f_i^*. Conversely, at high noise (σ≥4\sigma\ge4, Figure 1k,Figure 1l) the signal-to-noise ratio is so low that σ\sigma is above σ∗\sigma^*, as defined in Eq. (6), and the true fi∗f_i^* cannot be learned by any method[32]. Despite this, the method still detects the correct causal effect. Finally, moderate noise levels (σ=0.4\sigma= 0.4) lead to exact recovery of the fi∗f_i^* (Figure 1j) because, in this regime, the signal-to-noise ratio is high enough to bring the data into the learnable regime and, at the same time, the observed range of x(t)x(t) is large enough that the limiting behavior of fi∗f_i^* is visible.

Thus, this example illustrates three important and somewhat counterintuitive features of causal discovery based on Bayesian symbolic regression: (i) causalBMS has no problem in detecting unidirectional causal relationships, even in scenarios where the state of the art in causal discovery methods fail4; (ii) causal effects are detectable even in the unlearnable symbolic regression phase; and (iii) more noise can actually increase the signal-to-noise ratio by increasing the range of observed values in the time series.

CauseMe benchmarks

Next, we evaluate causalBMS on the CauseMe benchmark suite curated for the NeurIPS 2019 Causality for Climate competition[26, 27]. The suite stresses three orthogonal axes: dynamical complexity (non-linearity of the dynamics and dimensionality dd of the system), sample size TT, and signal-to-noise ratio. Here, we consider the following datasets:

  • Linear baselines. The linear-VAR family (d=3d = 3, T=150T = 150) provides a controlled baseline of linear models; the linear-VAR_noisy configuration adds strong exogenous noise for the relatively small samples available.

  • Nonlinear and chaotic systems. Coupled logistic maps (logistic-largenoise, d=3d = 3, medium and strong noise) test the high-noise transitional regime, while nonlinear-VAR with polynomial dependencies probes scalability across system dimensionality d∈{3,5,10}d \in\{3, 5, 10\} at T=300T = 300.

Each dataset consists of 250 time-series sets from which the causal graph must be inferred. We compare causalBMS with the 20 top performers for each dataset in the CauseMe leaderboard (Figure 2).

Figure 2. Performance of causalBMS on the CauseMe benchmark. For the experiments described in §III B, we show: (a) area under the ROC curve; (b) area under the precision–recall curve; and (c) F1-score. The green bars are the causalBMS scores; the grey ranges span the top-20 entries reported by CauseMe for each dataset. causalBMS sits at or near the top of every column and consistently falls within the upper range of competing methods, especially for the nonlinear and strong-noise variants.

Across all setups, causalBMS is consistently among the top performers in F1-score, area under the precision–recall curve (AUC-PR), and area under the ROC curve (AUC) (Figure 2). Indeed, causalBMS is the top performer in 13 out of 21 dataset-metric pairs, the second-best in another four pairs, and consistently close to the top performer when it is not the best. Our approach works particularly well in nonlinear systems. The robustness in the strong-noise variants also supports using the score based on the probabilistic approach and the complete posterior distribution.

A biogeoscience case study: temperature, productivity, and respiration

Finally, we consider a four-variable causal graph rooted in ecosystem physiology, which we choose because it violates some assumptions of causalBMS and is therefore particularly challenging for our approach. The structural model follows the simulated case study of Runge et al.43, in which incoming shortwave radiation RgR_g drives gross primary productivity GPP through air temperature TairT_{\mathrm{air}}, and ecosystem respiration RecoR_{\mathrm{eco}} responds nonlinearly to TairT_{\mathrm{air}} and GPP through a Q10Q_{10}-like kernel. The system encodes the standard light-temperature partitioning used to separate net ecosystem exchange into assimilation and respiration[44, 45] and is a controlled surrogate for the eddy-covariance setting routinely analyzed on FLUXNET sites[46]. The lag-one summary graph contains eight directed edges, including four cross-influences (Rg→TairR_g \to T_{\mathrm{air}}, Rg→GPPR_g \to\mathrm{GPP}, Tair→GPPT_{\mathrm{air}} \to\mathrm{GPP}, Tair→RecoT_{\mathrm{air}} \to R_{\mathrm{eco}}, GPP →Reco\to R_{\mathrm{eco}}) and four autoregressive self-edges. The discrete-time SCM is, with seasonal phase ϕt=tπ/365\phi_t = t\pi/365 and i.i.d. fluctuations ηti\eta_t^i,

Rg(t)=280sin⁡2ϕt+50∣sin⁡ϕt∣ηtRg,Tair(t)=0.8Tair(t−1)+0.02Rg(t)+5ηtT,GPP(t)=∣0.2GPP(t−1)+0.002Tair(t)Rg(t)+3ηtG∣,Reco(t)=∣0.3Reco(t−1)+0.9GPP(t)0.80.12(Tair(t)−15)+2ηtR∣.(8)\begin{aligned} R_g(t) &= 280\sin^2\phi_t + 50\lvert\sin\phi_t\rvert\eta_t^{R_g},\\ T_{\mathrm{air}}(t) &= 0.8T_{\mathrm{air}}(t-1) + 0.02R_g(t) + 5\eta_t^{T},\\ \mathrm{GPP}(t) &= \left\lvert0.2\mathrm{GPP}(t-1) + 0.002T_{\mathrm{air}}(t)R_g(t) + 3\eta_t^{G}\right\rvert,\\ R_{\mathrm{eco}}(t) &= \left\lvert0.3R_{\mathrm{eco}}(t-1) + 0.9\mathrm{GPP}(t)0.8^{0.12(T_{\mathrm{air}}(t)-15)} + 2\eta_t^{R}\right\rvert. \tag*{(8)} \end{aligned}

Each simulation produces T=800T = 800 daily samples followed by a low-radiation seasonal mask that retains only the active season. We compare five methods spanning the constraint-, structural-, dynamics- and regression-based families: PCMCI+ with partial-correlation independence tests at τmax⁡=1\tau_{\max} = 1[26, 41], VAR-LiNGAM[14, 42], convergent cross mapping (CCM)[25], a linear Granger-causality test extended with contemporaneous (lag-zero) terms to allow for instantaneous influences in Eq. (8)[47], and causalBMS.

We evaluate on four noise regimes: Gaussian fluctuations at the reference scale σ=1\sigma= 1 and at σ=2\sigma= 2, heavy-tailed Student-tt fluctuations with ν=4\nu= 4 degrees of freedom, and a mixed regime in which the temperature fluctuation includes an additive cubic distortion 0.25ε30.25\varepsilon^3 as in the Runge example[43], modeling occasional extremes. Each method is run on five independent replicates per regime; we report the F1-score, the area under the precision-recall curve (AUC-PR) and the area under the ROC curve (AUC-ROC) computed on the twelve offdiagonal entries of the lag-one summary graph (Figure 3).

Figure 3. Multi-method comparison on the biogeoscience SCM of Eq. (8). F1-score (left), AUC-PR (middle), and AUC-ROC (right) on the cross-influence entries of the lag-one summary graph, averaged over twenty replicates per noise regime; error bars are one standard deviation. Regimes (left to right inside each panel): Gaussian fluctuations at the reference scale, Gaussian fluctuations at twice the reference scale, Student-tt fluctuations with ν=4\nu= 4 degrees of freedom and a mixed regime with an additional cubic term on the TairT_{\rm air} fluctuations. causalBMS (green) is among the leading methods for F1-score and AUC-ROC and often ties for the best performer on these metrics. CCM (yellow) is the strongest method for AUC-PR throughout. In AUC-ROC, a linear Granger-causality test extended with contemporaneous terms (purple) matches or slightly exceeds every other method, including causalBMS, in all four regimes. VAR-LiNGAM (red) is consistently the weakest method in AUC-ROC and AUC-PR, while PCMCI+ (blue) shows more erratic performance across noise regimes in F1-score.

We note that this experiment is singularly challenging for the causalBMS for at least two reasons. First, in some experiments, the additive noise terms are not Gaussian. Second, and more significantly, functional identification is misspecified in Eq. (8) because of the contemporaneous (lag zero) influence terms. For example, temperature TairT_{\rm air} is causally affected only by radiation RgR_g, but because of the lack of temporal resolution, the effect of RgR_g is measured as instantaneous. Similarly, the causal effect of TairT_{\rm air} and RgR_g on GPP and RecoR_{\rm eco} is also measured as instantaneous. Therefore, TairT_{\rm air} can be written as a function of RgR_g, but also as a function of GPP and RecoR_{\rm eco}.

Despite these intrinsic difficulties, causalBMS remains competitive with the strongest methods on most of the metrics in Figure 3. In F1-score, causalBMS sits within the leading cluster together with CCM and linear Granger across all regimes and is often the best or close-to-best performer. In AUC-PR, causalBMS is in the second tier, alongside PCMCI+ and linear Granger, all below CCM, which is the strongest method on this metric in all regimes.

On AUC-ROC, linear Granger with contemporaneous terms matches or exceeds every method on average in all four regimes, but causalBMS is always a very close second and statistically indistinguishable from the top performer. VAR-LiNGAM is consistently the weakest method in AUC-ROC across all four regimes, reflecting its inability to represent the multiplicative and exponential terms. In F1-score, however, its performance is comparable to, and in some regimes higher than, PCMCI+, whose linear partial-correlation test is itself much more uncertain across noise regimes than either causalBMS or linear Granger.

That a simple contemporaneous-term linear Granger test matches causalBMS in edge detection reflects a property of this benchmark: the mechanisms themselves in Eq. (8) are close enough to linear that a correctly-specified, low-parameter significance test is a statistically efficient detector of an edge’s presence.

Unlike PCMCI+, VAR-LiNGAM, linear Granger and CCM, which return only edge weights, causalBMS returns the closed-form expressions that produced those weights, together with a diagnostic (Figure 4d-Figure 4f) that identifies, without reference to the ground truth, which of its recovered mechanisms remain incompletely specified. Table I compares the MDL expression obtained by the causalBMS for each target to the ground-truth mechanism in Eq. (8).

True mechanism (from Eq. (8))MDL causalBMS expression
TairT_{\mathrm{air}}0.8Tair(t−1)+0.02Rg(t)0.8T_{\mathrm{air}}(t-1)+0.02R_g(t)0.82Tair(t−1)+0.84GPP(t)−0.023Tair(t−1)Reco(t)0.82T_{\mathrm{air}}(t-1)+0.84GPP(t)-0.023T_{\mathrm{air}}(t-1)R_{\mathrm{eco}}(t)
GPPGPP0.2GPP(t−1)+0.002Tair(t)Rg(t)0.2GPP(t-1)+0.002T_{\mathrm{air}}(t)R_g(t)1.1⋅10−5620Reco(t)+Rg(t)Tair(t)GPP(t−1)+Reco(t)−2.0Reco(t−1)+Tair(t)+641.1\cdot10^{-5}\frac{620R_{\mathrm{eco}}(t)+R_g(t)T_{\mathrm{air}}(t)}{GPP(t-1)+R_{\mathrm{eco}}(t)-2.0R_{\mathrm{eco}}(t-1)+T_{\mathrm{air}}(t)+64}
RecoR_{\mathrm{eco}}0.3Reco(t−1)+0.9GPP(t)0.80.120.12(Tair(t)−15)0.3R_{\mathrm{eco}}(t-1)+0.9GPP(t)^{0.8}0.12^{0.12(T_{\mathrm{air}}(t)-15)}0.32Reco(t−1)+1.3GPP(t)0.97Tair(t)0.970.32R_{\mathrm{eco}}(t-1)+1.3GPP(t)^{0.97}T_{\mathrm{air}}(t)^{0.97}

Table I. Equations recovered by causalBMS on the biogeoscience SCM. For each target, we show the ground truth model and the MDL expression identified by the causalBMS in the reference Gaussian-noise regime.

Figure 4. Properties of minimum description length models identified by the causalBMS for the biogeoscience model of Eq. (8). After obtaining the MDL model for each target with the causalBMS, we generate test data with the same SCM model of Eq. (8) and test the predictive abilities and correlation structure of the models. (a-c) Predicted versus observed values of the target variables for the MDL model (green) and the ground-truth model (grey). (d-f) Correlations between residuals and predictors for each target variable and each predictor identified by the MDL model. We report the BH-corrected pp-values for a permutation test with HSIC assessing remaining correlation between residuals and chosen predictors.

For RecoR_{\rm eco}, the MDL expression not only captures the causal parents correctly but also matches exactly the ground truth expression, up to some error in the coefficients. This optimal outcome is possible because RecoR_{\rm eco} has the only functional dependency that is not misspecified in Eq. (8). For TairT_{\rm air} and GPP, the MDL models also capture the leading terms in the ground-truth causal mechanism—Tair(t−1)T_{\rm air}(t-1) and the product Rg(t)Tair(t)R_g(t)T_{\rm air}(t), respectively. However, the models also include other terms with incorrect causal parents. The fact that the causalBMS prefers models that are more complex than the ground truth leads us to hypothesize that they must be more predictive than the ground truth. Indeed, as per Eq. (3), the only way a more complex model (lower log⁡p(fi)\log p(f_i)) is acceptable is if it reduces the BIC term of the description length even more. In Figure 4a-Figure 4c, we show that this is indeed the case—the identified MDL expressions have, for all three targets, lower prediction error than the ground-truth expressions. This counterintuitive result is a consequence of the misspecification in Eq. (8). Consider, for example, TairT_{\mathrm{air}}. Since, functionally, TairT_{\mathrm{air}} can be solved for analytically from GPPGPP and RecoR_{\mathrm{eco}}, it is in general better to use a combination of these expressions to estimate TairT_{\mathrm{air}}, since such a combination will tend to cancel the noise terms and therefore lead to more accurate estimates.

We now test whether each recovered mechanism fully accounts for its own selected inputs. For this, we compute the Hilbert-Schmidt independence criterion (HSIC) between the residuals of each target and every predictor chosen in the respective MDL expression (Table 1). We assess the significance using a permutation test. We run 1000 permutations and apply the Benjamini-Hochberg (BH) correction to account for multiple testing. This assessment is a diagnostic for the adequacy of the functional form that could apply in principle to the fitted equation of any method, regardless of how its inputs were selected. For TairT_{\mathrm{air}} and GPPGPP, every predictor entering their MDL expressions remains significantly dependent on the residual after correction (pBH≤0.0124p_{\mathrm{BH}}\leq0.0124, Figure 4d-Figure 4e). This shows that neither expression fully captures the target’s dependence on its own selected inputs. This is consistent with their larger deviation from the ground-truth mechanism in Table I. At the same time, none of the three predictors of the RecoR_{\mathrm{eco}} expression show significant residual dependence (pBH≥0.202p_{\mathrm{BH}} \ge0.202, Figure 4f). This agrees with its near-exact recovery of both the ground-truth mechanism and RMSE (Figure 4c). Because this diagnostic requires no access to the ground-truth model, it offers a practical, general-purpose check on whether a fitted expression (from causalBMS or any regression-based causal discovery method) is fully specified, complementing aggregate error metrics such as RMSE with a finer-grained structural test of residual adequacy.

Discussion

We show that casting causal discovery as Bayesian symbolic regression turns the BMS posterior over expressions into a causal score via variable-inclusion frequencies. The score preserves the description length semantics of the BMS, extends naturally to many candidate parents and lagged predictors, and remains informative through the learnability transition characterized in Ref. 32. Because each sampled expression directly enumerates its predictors, the score does not require comparing candidate factorizations or selecting a single best equation, and exploits the full posterior of plausible mechanisms.

Three limitations qualify the present results. First, identifiability is conditional on closed-form representability of the true mechanism; outside this class the inclusion frequencies remain well defined as a feature-selection signal but lose the consistency guarantee of Proposition 1. Second, the BMS sampler scales with the number of candidate parents; current implementations comfortably handle the benchmark dimensions (d≤10d \le10, T≤300T \le300) but require additional ingredients to reach the high-dimensional settings of some real data. Third, the noise threshold in Eq. (6) depends on quantities (⟨δ2⟩\langle\delta^2 \rangle, ΔM∗\Delta^*_{M}) that involve the unknown true model and must be estimated from data; we use it as a diagnostic rather than as a hard guarantee.

Several extensions are natural and are likely to alleviate these limitations. Combining causalBMS with constraint-based skeleton discovery[11, 26] would exploit the strengths of both families: independence tests prune the candidate parent sets, and symbolic regression orients edges and recovers mechanisms. A similar approach is exploited by the recent TOPIC framework[48], which infers a topological order from algorithmic mutual information and identifies edges that compress the data under a candidate ordering; embedding causalBMS as the per-node scoring ‘oracle’ in

such a topological pipeline would extend the method to higher dimensions while preserving its mechanism-level output. Embedding causalBMS inside hybrid modeling pipelines would provide explicit mechanism candidates for downstream physical evaluation, and the ODE-SCM correspondence of Ref. 30 suggests a route from discovered difference equations to interventional predictions.

In any case, we have shown that causalBMS often performs better than the state of the art. Moreover, the principal scientific gain of causalBMS over the alternatives is that it not only provides edge ranking in the causal graph, but also the explicit functional form of the surviving expressions, which is a much richer description of mechanisms, allows to test for remaining correlations, and is typically an additional object of interest in science.

Acknowledgments

This work is supported by the European Research Council (ERC) through grant USMILE (grant agreement No. 855187); the European Commission through the Horizon Europe project ELIAS (grant agreement No. 101120237); projects PID2022-142600NB-I00, PID2022-142600NB-I00, and PID2025-176129NB-I00 from MCIN / AEI / 10.13039 / 501100011033; and by the Government of Catalonia (2021SGR-633).

Author contributions

RG, KHC, MSP, and GCV designed the research. RG, KHC, SP, and GCV wrote code and run simulations. All authors discussed and interpreted the results, worked on the visualizations, contributed to writing and revising the manuscript, and approved the final version.

Code and data availability

The code for the BMS is openly available[31]. Data for the CauseMe benchmark are available from the CauseMe platform[49]. All other data used in the manuscript were synthetically generated as described in the text.

Competing interests declaration

The authors declare that they have no competing interests.

References

  1. [4]J. Runge, S. Bathiany, E. Bollt, G. Camps-Valls, D. Coumou, E. Deyle, C. Glymour, M. Kretschmer, M. D. Mahecha, J. Muñoz-Marí, E. H. van Nes, J. Peters, R. Quax, M. Reichstein, M. Scheffer, B. Schölkopf, P. Spirtes, G. Sugihara, J. Sun, K. Zhang, and J. Zscheischler, Inferring causation from time series in Earth system sciences, Nat. Commun. 10, 2553 (2019).DOI
  2. [5]M. Reichstein, G. Camps-Valls, B. Stevens, M. Jung, J. Denzler, N. Carvalhais, and Prabhat, Deep learning and process understanding for data-driven Earth system science, Nature 566, 195 (2019).
  3. [6]G. Camps-Valls, A. Gerhardus, U. Ninad, G. Varando, G. Martius, E. Balaguer-Ballester, R. Vinuesa, E. Diaz, L. Zanna, and J. Runge, Discovering causal relations and equations from data, Phys. Rep. 1044, 1 (2023).
  4. [7]A. T. Reid, D. B. Headley, R. D. Mill, R. Sanchez-Romero, L. Q. Uddin, D. Marinazzo, D. J. Lurie, P. A. Valdés-Sosa, S. J. Hanson, B. B. Biswal, V. Calhoun, R. A. Poldrack, and M. W. Cole, Advancing functional connectivity research from association to causation, Nat. Neurosci. 22, 1751 (2019).DOI
  5. [8]S. H. Siddiqi, K. P. Kording, J. Parvizi, and M. D. Fox, Causal mapping of human brain function, Nat. Rev. Neurosci. 23, 361 (2022).DOI
  6. [9]M. A. Hernán and J. M. Robins, Causal Inference: What If (Chapman & Hall/CRC, Boca Raton, FL, 2020) https://migueller­nan.org/whatifbook.
  7. [10]J. Hicks, Causality in Economics (Australian National University Press, Canberra, 1980).
  8. [11]P. Spirtes, C. Glymour, and R. Scheines, Causation, Prediction, and Search, 2nd ed. (The MIT Press, Cambridge, MA, 2000).
  9. [12]P. O. Hoyer, D. Janzing, J. M. Mooij, J. Peters, and B. Schölkopf, Nonlinear causal discovery with additive noise models, in Adv. Neural Inf. Process. Syst., Vol. 21 (2009) pp. 689–696, https://papers.nips.cc/paper_files/paper/2008/hash/f7664060cc52bc6f3d620bcedc94a4b6-Abstract.html.
  10. [13]J. M. Mooij, J. Peters, D. Janzing, J. Zscheischler, and B. Schölkopf, Distinguishing cause from effect using observational data: Methods and benchmarks, J. Mach. Learn. Res. 17, 1 (2016), https://www.jmlr.org/papers/v17/14-518.html.
  11. [14]S. Shimizu, P. O. Hoyer, A. Hyvärinen, and A. Kerminen, A linear non-Gaussian acyclic model for causal discovery, J. Mach. Learn. Res. 7, 2003 (2006), https://www.jmlr.org/papers/v7/shimizu06a.html.
  12. [15]J. Peters, P. Bühlmann, and N. Meinshausen, Causal inference by using invariant prediction: Identification and confidence intervals, J. R. Stat. Soc. B 78, 947 (2016).arxiv.org/abs/1501.01332
  13. [16]C. Heinze-Deml, J. Peters, and N. Meinshausen, Invariant causal prediction for nonlinear models, J. Causal Inference 6, 20170016 (2018).arxiv.org/abs/1706.08576
  14. [17]D. Janzing, J. Mooij, K. Zhang, J. Lemeire, J. Zscheischler, P. Daniusis, B. Steudel, and B. Schölkopf, Information-geometric approach to inferring causal directions, Artif. Intell. 182–183, 1 (2012).DOI
  15. [18]X. Sun, D. Janzing, and B. Schölkopf, Causal reasoning by evaluating the complexity of conditional densities with kernel methods, Neurocomputing 71, 1248 (2008).DOI
  16. [19]H. Reichenbach, The Direction of Time (University of California Press, Berkeley, CA, 1991) originally published in 1956.
  17. [20]J. Mitrovic, D. Sejdinovic, and Y. W. Teh, Causal inference via kernel deviance measures, in Adv. Neural Inf. Process. Syst., Vol. 31 (2018) pp. 6986–6994, https://papers.nips.cc/paper_files/paper/2018/hash/73fed7fd472e502d8908794430511f4d-Abstract.html.arxiv.org/abs/1804.04622
  18. [21]A. Pérez-Suay and G. Camps-Valls, Causal inference in geoscience and remote sensing from observational data, IEEE Trans. Geosci. Remote Sens. 57, 1502 (2019).
  19. [22]K. Budhathoki and J. Vreeken, Causal inference by stochastic complexity, arXiv:1702.06776 10.48550/arXiv.1702.06776 (2017).arxiv.org/abs/1702.06776
  20. [23]A. Marx and J. Vreeken, Telling cause from effect by local and global regression, Knowl. Inf. Syst. 60, 1277 (2019).DOI
  21. [24]C. W. J. Granger, Investigating causal relations by econometric models and cross-spectral methods, Econometrica 37, 424 (1969).
  22. [25]G. Sugihara, R. May, H. Ye, C.-h. Hsieh, E. Deyle, M. Fogarty, and S. Munch, Detecting causality in complex ecosystems, Science 338, 496 (2012).DOI
  23. [26]J. Runge, P. Nowack, M. Kretschmer, S. Flaxman, and D. Sejdinovic, Detecting and quantifying causal associations in large nonlinear time series datasets, Sci. Adv. 5, eaau9448 (2019).DOI
  24. [27]J. Runge, X.-A. Tibau, M. Bruhns, J. Muñoz-Marí, and G. Camps-Valls, The causality for climate competition, in Proceedings of the NeurIPS 2019 Competition and Demonstration Track, Proc. Mach. Learn. Res. Vol. 123 (PMLR, 2020) pp. 110–120, https://proceedings.mlr.press/v123/runge20a.html.
  25. [28]R. Guimerà, I. Reichardt, A. Aguilar-Mogas, F. A. Massucci, M. Miranda, J. Pallarès, and M. Sales-Pardo, A bayesian machine scientist to aid in the solution of challenging scientific problems, Sci. Adv. 6, eaav6971 (2020).DOI
  26. [29]R. Guimerà and M. Sales-Pardo, Bayesian symbolic regression: automated equation discovery from a physicist’s perspective, Philos. Trans. R. Soc. A 384, 20250089 (2026).DOI
  27. [30]J. M. Mooij, D. Janzing, and B. Schölkopf, From ordinary differential equations to structural causal models: The deterministic case, in Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI) (AUAI Press, Arlington, VA, 2013) pp. 440–448.
  28. [31]https://bitbucket.org/rguimera/ machine-scientist/, accessed: 2026-09-18.
  29. [32]O. Fajardo-Fontiveros, I. Reichardt, H. R. De Los Ríos, J. Duch, M. Sales-Pardo, and R. Guimerà, Fundamental limits to learning closed-form mathematical models from data, Nat. Commun. 14, 1043 (2023).
  30. [33]For simplicity, here we ignore possible contemporaneous effects, but we consider a case where such effects exist later in our experimental results section.
  31. [34]S. L. Brunton, J. L. Proctor, and J. N. Kutz, Discovering governing equations from data by sparse identification of nonlinear dynamical systems, Proc. Natl. Acad. Sci. U.S.A. 113, 3932 (2016).DOI
  32. [35]O. Cabanas-Tirapu, S. Cobo-Lopez, S. E. Sanchez, F. L. Rohwer, M. Sales-Pardo, and R. Guimerà, Integral bayesian symbolic regression for optimal discovery of governing equations from scarce and noisy data (2025), arXiv:2511.14388 [physics.data-an].
  33. [36]T. A. Enßlin, Information theory for fields, Ann. Phys. (Berlin) 531, 1800127 (2019).
  34. [37]P. D. Grünwald, The Minimum Description Length Principle (The MIT Press, Cambridge, MA, 2007).DOI
  35. [38]C. Fox, N. D. Tran, F. N. Nacion, S. Sharlin, and T. R. Josephson, Incorporating background knowledge in symbolic regression using a computer algebra system, Mach. Learn.: Sci. Technol. 5, 025057 (2024).
  36. [39]G. Schwarz, Estimating the dimension of a model, Ann. Stat. 6, 461 (1978).DOI
  37. [40]The +1 term corresponds to one additional parameter of the probabilistic model, namely, the standard deviation σ of the exogenous noise.
  38. [41]C. Krich, J. Runge, D. G. Miralles, M. Migliavacca, O. Perez-Priеgo, T. El-Madany, A. Carrara, and M. D. Mahecha, Estimating causal networks in biosphere–atmosphere interaction with the pcmci approach, Biogeosciences 17, 1033 (2020).DOI
  39. [42]A. Hyvärinen, K. Zhang, S. Shimizu, and P. O. Hoyer, Estimation of a structural vector autoregression model using non-Gaussianity, J. Mach. Learn. Res. 11, 1709 (2010), https://www.jmlr.org/papers/v11/hyvarinen10a.html.DOI
  40. [43]J. Runge, A. Gerhardus, G. Varando, V. Eyring, and G. Camps-Valls, Causal inference for time series, Nat. Rev. Earth Environ. 4, 487 (2023).DOI
  41. [44]M. Reichstein, E. Falge, D. Baldocchi, D. Papale, M. Aubinet, P. Berbigier, C. Bernhofer, N. Buchmann, T. Gilmanov, A. Granier, et al., On the separation of net ecosystem exchange into assimilation and ecosystem respiration: Review and improved algorithm, Glob. Change Biol. 11, 1424 (2005).DOI
  42. [45]M. D. Mahecha, M. Reichstein, N. Carvalhais, G. Lasslop, H. Lange, S. I. Seneviratne, R. Vargas, C. Ammann, M. A. Arain, A. Cescatti, I. A. Janssens, M. Migliavacca, L. Montagnani, and A. D. Richardson, Global convergence in the temperature sensitivity of respiration at ecosystem level, Science 329, 838 (2010).
  43. [46]G. Pastorello, C. Trotta, E. Canfora, H. Chu, D. Christianson, Y.-W. Cheah, C. Poindexter, J. Chen, A. Elbashandy, M. Humphrey, et al., The fluxnet2015 dataset and the oneflux processing pipeline for eddy covariance data, Sci. Data 7, 225 (2020).
  44. [47]A. Shojaie and E. B. Fox, Granger causality: A review and recent advances, Annu. Rev. Stat. Appl. 9, 289 (2022).arxiv.org/abs/2105.02675
  45. [48]S. Xu, S. Mameche, and J. Vreeken, Information-theoretic causal discovery in topological order, in Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, Proc. Mach. Learn. Res., Vol. 258, edited by Y. Li, S. Mandt, S. Agrawal, and E. Khan (PMLR, 2025) pp. 2008–2016.
  46. [49]J. Runge, X.-A. Tibau, M. Bruhns, J. Muñoz-Marí, and G. Camps-Valls, The causality for climate competition, in Proceedings of the NeurIPS 2019 Competition and Demonstration Track, Proc. Mach. Learn. Res., Vol. 123 (PMLR, 2020) pp. 110–120, https://proceedings.mlr.press/v123/runge20a.html.

Paper details

vlnc:W_udsrs7n8
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents