Bayesian forecasting of short-term crash risk with conditional extreme value models: A comparison between one-stage and two-stage approaches
Bibliographic record
Abstract
Extreme Value Theory (EVT) has become a widely used approach for quantifying crash risk from traffic conflict data. Most existing applications, however, rely on unconditional models, which fail to adequately capture dependence in extreme traffic conflicts and do not reliably predict future crash risk. To demonstrate the potential of conditional EVT models for advancing short-term crash risk forecasting, this study compares two conditional EVT approaches within a Bayesian framework that address extremal dependence from distinct perspectives. The first approach is the two-stage GARCH-EVT framework, where conditional mean and variance are modeled using GARCH-type specifications before EVT is applied to the standardized residuals. Both traditional and covariate-augmented variants are examined. The second approach uses a one-stage conditional peak-over-threshold (POT) model, represented by the score-driven POT model, which directly captures dynamics in the conditional exceedance probability and the distribution of exceedance sizes. Crash risk is quantified using two conditional tail risk measures, Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR), with forecasting performance evaluated through traditional and comparative backtesting. An empirical study examines rear-end conflicts collected at two signalized intersections over four observation days to generate one-cycle-ahead crash risk forecasts during the out-of-sample period. Traditional backtesting indicates that both the covariate-augmented GARCH-EVT and the score-driven POT approaches produce valid and comparable forecasts, with the two-stage method yielding estimates with lower uncertainty. Comparative backtesting, however, shows that the score-driven POT model achieves slightly superior forecasting accuracy. The weaker performance of the two-stage framework can be attributed to partial removal of extremal dependence, sensitivity to substitute values in cycles without conflicts, and the limitations inherent in its two-stage structure.
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.004 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".