A computationally efficient method for probabilistic local warming projections constrained by history matching and pattern scaling, demonstrated by WASP–LGRTC-1.0
Bibliographic record
Abstract
Abstract. Climate projections are made using a hierarchy of models of different complexities and computational efficiencies. While the most complex climate models contain the most detailed representations of many physical processes within the climate system, both parameter space exploration and integrated assessment modelling require the increased computational efficiency of reduced-complexity models. This study presents a computationally efficient method for generating probabilistic projections of local warming across the globe, using a pattern-scaling approach derived from the Climate Model Intercomparison Project phase 5 (CMIP5) ensemble, that can be coupled to any efficient model ensemble simulation of global mean surface warming. While the method can project local warming for arbitrary future scenarios, using it for scenarios with peak global mean warming ≤2 ∘C is problematic due to the large uncertainties involved. First, global mean warming is projected using a 103-member ensemble of history-matched simulations with an example reduced complexity Earth system model: the Warming Acidification and Sea-level Projector (WASP). The ensemble projection of global mean warming from this WASP ensemble is then converted into local warming projections using a pattern-scaling analysis from the CMIP5 archive, considering both the mean and uncertainty of the local to global ratio of temperature change (LGRTC) spatial patterns from the CMIP5 ensemble for high-end and mitigated scenarios. The LGRTC spatial pattern is assessed for scenario dependence in the CMIP5 ensemble using RCP2.6, RCP4.5 and RCP8.5, and spatial domains are identified where the pattern scaling is useful across a variety of arbitrary scenarios. The computational efficiency of our WASP–LGRTC model approach makes it ideal for future incorporation into an integrated assessment model framework or efficient assessment of multiple scenarios. We utilise an emergent relationship between warming and future cumulative carbon emitted in our simulations to present an approximation tool making local warming projections from total future carbon emitted.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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 source (direct Gemma or distilled Codex), 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".