cd /news/machine-learning/replication-failure-and-trivial-base… · home › topics › machine-learning › article
[ARTICLE · art-142237] src=arxiv.org ↗ pub= topic=machine-learning verified=true sentiment=↓ negative

Replication Failure and Trivial Baselines in Road-Level Crash Prediction

An independent replication of a recent uncertainty-aware graph neural network for road-level crash prediction found that 7 of 11 design decisions failed to replicate on a second London borough, with 4 of those reversing sign rather than attenuating, according to the arXiv paper 2609.35917v1. The reference architecture showed per-borough seed spreads of up to 35.7 points versus 4 points for the authors' model, and a parameter-free baseline ranking segments by cumulative past crash count matched the authors' model at matched history depth (-0.90 points, p=0.61) while beating the reference architecture on 18 of 18 held-out windows (-17.37, p<10^-6). Sweeping the baseline's lookback horizon produced 22.71% to 83.94% accuracy on that variable alone, and every published figure in this line of work was matched by the baseline at a horizon of one to five years, leading the authors to recommend horizon-matched baselines and multi-seed reporting as minimum practice.

by read1 min views1 publishedSep 30, 2026
arXiv:2609.35917v1 Announce Type: new 
Abstract: Graph neural networks are increasingly applied to road-level crash prediction, but the stability of their reported gains has received little scrutiny. We independently reconstruct the data pipeline of a recent uncertainty-aware model and evaluate eleven of its design decisions across three London boroughs under an expanding-window protocol. Four survive replication on a second borough; seven do not, and four of those reverse sign rather than attenuate. Multi-seed evaluation is decisive: one effect reverses sign between random seeds within a single borough, and the reference architecture exhibits per-borough seed spreads of up to 35.7 points against 4 points for ours. We further compare both networks against a parameter-free baseline that ranks segments by cumulative past crash count. At matched history depth our model is statistically indistinguishable from that baseline ($-0.90$ points, $p=0.61$), and the reference architecture loses to it on 18 of 18 held-out windows ($-17.37$, $p<10^{-6}$). Sweeping the baseline's lookback horizon shows it spans 22.71% to 83.94% accuracy on that variable alone, and that every published figure in this line of work is matched by the baseline at a horizon of one to five years. We argue that the apparent margin of graph networks over historical baselines in this task is substantially an artefact of the short horizons those baselines were computed over, and recommend horizon-matched baselines and multi-seed reporting as minimum practice.
── more in #machine-learning 4 stories · sorted by recency
── more on @arxiv 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
→ Live at https://your-agent.zahid.host ✓
Get free account → Pricing
from €0/mo · no card required
LIVE [news/replication-failure-…] indexed:0 read:1min 2026-09-30 · —