Evaluating the Robustness of PCMCI+ for Causal Discovery of Flood Drivers
Bibliographic record
Abstract
Abstract Estimating causal drivers of high-impact extreme events such as floods from data is an aspiring pursuit. Time series causal discovery methods, such as the conditional-independence-based PC Momentary Conditional Independence (PCMCI) framework, are designed to identify causal relationships from complex multivariate observational time series. However, the application to extreme event data remains a challenge due to, by the nature of extremes, data length limitations, conditional independence testing for nonlinear relationships, and potential violations of the methods’ assumptions. So far, these challenges have mostly been explored on synthetic data with limited transferability to real-world applications. In this study, we evaluate causal discovery on real and pseudoreal data generated with a hydrological model across 45 catchments with varying flood-generating processes. Because no detailed causal ground truth exists, we focus on the robustness of output graphs. To this end, we simulate a large sample, identify discharge peaks, and investigate the robustness of the causal discovery algorithm PCMCI+ when applied to different realizations of the same setting for various sample sizes. We find that the robustness generally increases with sample size, yet a significant proportion of inferred causal edges remain inconsistent even for large datasets. Notably, while some flood drivers are reliably identified, other key hydrological mechanisms are systematically missed even for very large sample sizes, highlighting methodological limitations. Our study provides a blueprint for investigating the real-world performance of causal discovery methods and illustrates their current limitations for identifying causal drivers of floods. Significance Statement Revealing the causes of extremes in the Earth system, like floods, is important for climate risk assessments. Causal discovery is a modern machine learning approach aiming to find these causal drivers in ever more abundant observational data. However, the reliability of causal discovery algorithms depends on many sources of uncertainty. Here, we evaluate the robustness of causal discovery on real and pseudoreal data generated with a state-of-the-art hydrological model and find that current observational sample sizes may not be enough to reliably estimate causal drivers in such challenging settings.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".