- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper introduces PASS, a quantile-based conditional uncertainty score for causal discovery beyond additive-noise models. Under a quantile-separation condition, it establishes identification of causal order and parents, and proves consistency for a tensor-spline estimator under regularity and fractional-moment assumptions. Experiments evaluate a practical additive-spline implementation on additive, heteroskedastic, and heavy-tailed simulations and three real-data benchmarks.
Critical strengths
-
PASS uses the same conditional uncertainty score for causal ordering and parent recovery, with identification results and consistency guarantees for a tensor-spline estimator under stated assumptions. Its applicability beyond additive noise and finite variance provides a meaningful extension of uncertainty-based causal discovery.
-
The empirical evaluation covers diverse synthetic settings and real-world benchmarks, complemented by sensitivity analyses and ablations. This breadth provides substantial empirical support for the proposed method.
Critical weaknesses
-
Restrictive, scale-dependent identification. Recovery relies on an ordering of parent-conditioned uncertainties whose applicability to real systems is insufficiently justified. Variable-specific rescaling substantially degrades ordering accuracy (Table 2), while the main HNM generator favors this condition. This leaves the practical scope of the proposed extension unclear.
-
Theoretical guarantees do not cover the evaluated algorithm. Theorem 6.1 analyzes growing tensor splines with moment clipping and a fixed threshold; experiments use fixed additive splines, different clipping, and a data-dependent threshold. Consequently, the consistency result does not establish reliability of the implementation responsible for the reported empirical gains.
Questions for authors
What practically relevant class of causal systems is enabled by the proposed extension beyond additive-noise and finite-variance settings? This would help assess the practical significance of the broader theoretical model class.
4 comments
W2. Gap between the theory and the implemented algorithm
The implementation now uses the moment clipping of Theorem 6.1, additive splines match the accuracy of growing tensor splines where both can be fit, and the standard-error threshold selects non-parent candidates at a rate at or below for and 0.0012 at the default .
(i) Additive splines. The growing tensor splines of Theorem 6.1 cannot be fit at , since their basis has functions for a conditioning set , at least once . We compared the two on graphs with , where both can be fit (six settings of Table 1, ten seeds). They agree within about 0.02 in and 0.01 in F1 at every .
| Additive splines | Additive splines F1 | Growing tensor splines | Growing tensor splines F1 | |
|---|---|---|---|---|
| 1000 | 0.965 | 0.894 | 0.982 | 0.885 |
| 2000 | 0.975 | 0.920 | 0.984 | 0.908 |
| 4000 | 0.972 | 0.919 | 0.988 | 0.909 |
(ii) Clipping. We reran every table and figure with the moment clipping, and the estimated edge set changed in 66 of the 19,927 runs. The tables of the original submission change by at most 0.2 in SHD and 0.001 in F1.
(iii) Standard-error threshold. The fixed threshold of Theorem 6.1 depends on the unknown smallest population score of a true parent (Theorem 5.2), so the implementation compares each score with times its estimated standard error.
Selection rate of non-parent candidates. With the true order supplied (six settings of Table 1), non-parent candidates have zero population score (Theorem 5.2), and the table reports the fraction of them that the threshold selects.
| False selection rate at | 0.1 | 0.05 | 0.01 | 0.001 |
|---|---|---|---|---|
| True order | 0.042 | 0.022 | 0.0058 | 0.0012 |
Sensitivity to . The F1 changes by 0.007 between and the default (estimated order, six settings of Table 1), so the results do not rely on a tuned .
| Precision | Recall | F1 | |
|---|---|---|---|
| 0.1 | 0.459 | 0.799 | 0.579 |
| 0.05 | 0.592 | 0.771 | 0.666 |
| 0.01 | 0.784 | 0.723 | 0.750 |
| 0.001 | 0.870 | 0.673 | 0.757 |
We added these results to Appendices G.3.4 and G.3.7 of the revised manuscript.
Q1. Systems enabled by the extension
The extension enables dispersion-based causal ordering for heavy-tailed data and for non-additive noise. Heavy-tailed or infinite-variance data are common in finance, insurance, and hydrology [1, 2], and non-additive noise includes heteroskedastic and post-nonlinear mechanisms.
(i) Heavy-tailed data. The PASS score needs only a finite -moment for some , not a finite variance. River discharge networks are one heavy-tailed application, studied in causal discovery on the Danube data we use (Gnecco et al., 2021; Tran et al. [3]) and on CausalRivers (Stein et al., 2025). PASS has the highest F1 on the Danube data and ranks fourth by F1-max on the CausalRivers benchmark, above the time-series methods DynoTears and PCMCI, without using the temporal order (Table 4). PASS also has the lowest SHD under Cauchy noise, which has no finite mean (Table 1).
(ii) Non-additive mechanisms. PASS also applies when the noise does not enter the mechanism additively, since it compares the full conditional distribution rather than a residual variance. Heteroskedastic noise arises when the variability of an effect grows with its causes, as is common for river discharge. For such noise, the condition of PASS compares the expected th power of the noise scale across nodes, which extends the equal-variance condition. PASS has the lowest SHD and the highest F1 in the three heteroskedastic settings of Table 1. Post-nonlinear distortion arises when a sensor or a physical process distorts the mechanism (Zhang and Hyvärinen, 2009). Under such distortion, PASS has the highest for and the second highest for .
References
[1] Embrechts, P., Klüppelberg, C., and Mikosch, T. (1997). Modelling Extremal Events for Insurance and Finance. Springer.
[2] Katz, R. W., Parlange, M. B., and Naveau, P. (2002). Statistics of extremes in hydrology. Advances in Water Resources, 25(8–12):1287–1304.
[3] Tran, N. M., Buck, J., and Klüppelberg, C. (2024). Estimating a directed tree for extremes. Journal of the Royal Statistical Society Series B, 86(3):771–792.
Thank you for the responses and the revised manuscript. Your response to my review substantially alleviates my main concerns through the HNM results without depth-based scale calibration, the additive-versus-tensor spline comparison, the updated moment clipping, and the threshold diagnostics.
I also appreciate the additional post-nonlinear experiments (reply to Reviewer aKqM) and the explicit discussion of cases where PASS trails the strongest baselines in F1 (revised manuscript).
The practical justification for the separation condition and the theoretical coverage of the implemented algorithm remain limitations. On balance, considering the additional evidence, the paper’s contributions, and my assessment of the other papers I reviewed, I am raising my rating to weak acceptance.
Thank you for reading our responses and the revised manuscript carefully.
In particular, we are glad that the HNM results without the depth-based scaling, the spline comparison, and the threshold diagnostics addressed your main concerns, and that you found the post-nonlinear experiments and the discussion of the F1 results useful.
We also appreciate that, despite the remaining points on the practical justification of the separation condition and the theoretical coverage of the implemented algorithm, you raised your rating, considering the additional evidence and your assessment of the other papers. We will clarify these points in the final version, and we thank you again for your constructive feedback.
We thank the reviewer for the thorough review. The questions helped us check whether the main simulation favors PASS, bring the implementation closer to the theory, and explain where the extension is useful. Revised passages of the manuscript are marked in blue.
W1-1. Scale-dependent identifiability
The condition of PASS is weaker than the existing equal-variance conditions, and it is natural for variables measured on a common scale, such as examination scores (Park, 2020) or river discharge. Like other dispersion-based methods, PASS is not invariant to arbitrary coordinatewise rescaling, so it is intended for variables on a common scale.
(i) Scale dependence. Methods that identify a linear Gaussian SEM beyond its Markov equivalence class compare error variances across variables, so none of them is invariant to arbitrary coordinatewise rescaling (Peters and Bühlmann, 2014; Ghoshal and Honorio, 2018; Park, 2020; Xu et al., 2024). A common change of unit and variable-specific shifts leave the population PASS order unchanged (Proposition B.1). We stated the scope of PASS explicitly in Section 5.1 and the conclusion of the revised manuscript.
(ii) Restrictiveness. The condition of PASS includes the equal-variance condition of Peters and Bühlmann (2014) and the Gaussian variance-ordering condition of CaPS as special cases. It also covers general SCMs and orderings driven by scale, tail shape, or both. Its ordering step needs only the recursive sink separation condition (5), which is weaker than the edgewise condition of Corollary 5.1. PASS remains the most accurate method when the depth-based scale levels of the Table 1 generator are removed (see our answer to W1-2).
(iii) Applicability to real systems. By Corollary 5.1, the recursive sink separation condition (5) holds whenever the dispersion of each variable given its parents does not decrease along the edges, which is natural for variables from a similar domain (Peters and Bühlmann, 2014; Park, 2020). River discharge is such a case, since all stations measure the same physical quantity. On the Danube discharge network, PASS has the highest F1 among the methods in Table 4 (see our answer to Q1).
W1-2. The main HNM generator
PASS remains the most accurate method in every noise setting when the depth-based scale levels are removed. We removed them from the Table 1 generator and kept everything else.
This agrees with Theorem 5.1. The ordering step of PASS needs only the recursive sink separation condition (5), which is weaker than the edgewise condition of Corollary 5.1 that the depth-based scale levels favor. We added the results of all methods without the depth-based scale levels to Appendix G.2.7 of the revised manuscript.