A Recovered Average Is Not a Defended Corridor: What Adversarial Training Buys Spatiotemporal Traffic Forecasters, Why the Case That Static Methods Fail Rests on Node Selection While the Evidence of Failure Comes From Attack Shape, and the Evaluation

(c) 2026 Pranay Mahendrakar. Licensed under CC BY 4.0. Life of Research Spatiotemporal graph networks forecast speed and flow across road sensor networks, and a line of work since 2021 shows that a few perturbed sensors can wreck those forecasts. Whether adversarial training repairs the damage is disputed. One position, stated most sharply by the reinforced dynamic adversarial training (RDAT) paper at KDD 2023, holds that adversarial training designed for static domains does not carry over to traffic, because the attacker picks different victim sensors at each moment, and that defence needs a learned, time-varying choice of training nodes. A second position, from attack papers, time-series robustness studies and a 2025 study of forecasting foundation models, reports that ordinary adversarial training, or for the foundation models lightweight latent adversarial fine-tuning, already recovers most of the lost accuracy. A third, from a 2026 re-evaluation, holds that adversarial training tuned to norm-bounded perturbations barely transfers to targeted, congestion-shaped attacks, and that even training on the attack itself loses ground when the attack's reach changes. In this analysis the author reviews and synthesises published results to show that the three positions are answering different questions under one word. A "dynamic attack" can vary in at least five things: which sensors it touches over time, the shape and size of the perturbation, the objective, the attacker's knowledge, and the metric used to score it. The dynamic-domain thesis concerns only the first. In RDAT's own main tables, adversarial training with randomly chosen nodes, the baseline RDAT presents as traditional adversarial training and elsewhere labels a dynamic strategy, closes about 93 percent of the attack-induced error on both benchmarks with Graph WaveNet, including against the time-dependent attack. Against that attack the learned selector adds less than two points of the gap, within run-to-run spread; under the other four attacks it stays within the spread on PeMS-D4 but adds 3.3 to 3.8 points on PeMS-BAY, slightly more than AT's seed spread. In the appendix, under the time-dependent attack, the ordering of the two methods flips with architecture while both close only 52 to 71 percent. Node selection is also the smaller lever in the attack literature's own ablations. The failures that are large come from changes in perturbation shape, target and metric. The paper consolidates the measured values in a table and a figure, states a procedure for crediting a robustness gain to a defence's dynamic component, and names the evaluations that would settle what remains open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-22
DOI
https://doi.org/10.5281/zenodo.24430422
Primary Topic
Adversarial Robustness in Machine Learning
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Recovered Average Is Not a Defended Corridor: What Adversarial Training Buys Spatiotemporal Traffic Forecasters, Why the Case That Static Methods Fail Rests on Node Selection While the Evidence of Failure Comes From Attack Shape, and the Evaluation

Pranay M. Mahendrakar
Zenodo (CERN European Organization for Nuclear Research)
Adversarial Robustness in Machine Learning
preprint

A Recovered Average Is Not a Defended Corridor: What Adversarial Training Buys Spatiotemporal Traffic Forecasters, Why the Case That Static Methods Fail Rests on Node Selection While the Evidence of Failure Comes From Attack Shape, and the Evaluation

Pranay M. Mahendrakar
preprint en

Abstract

(c) 2026 Pranay Mahendrakar. Licensed under CC BY 4.0. Life of Research Spatiotemporal graph networks forecast speed and flow across road sensor networks, and a line of work since 2021 shows that a few perturbed sensors can wreck those forecasts. Whether adversarial training repairs the damage is disputed. One position, stated most sharply by the reinforced dynamic adversarial training (RDAT) paper at KDD 2023, holds that adversarial training designed for static domains does not carry over to traffic, because the attacker picks different victim sensors at each moment, and that defence needs a learned, time-varying choice of training nodes. A second position, from attack papers, time-series robustness studies and a 2025 study of forecasting foundation models, reports that ordinary adversarial training, or for the foundation models lightweight latent adversarial fine-tuning, already recovers most of the lost accuracy. A third, from a 2026 re-evaluation, holds that adversarial training tuned to norm-bounded perturbations barely transfers to targeted, congestion-shaped attacks, and that even training on the attack itself loses ground when the attack's reach changes. In this analysis the author reviews and synthesises published results to show that the three positions are answering different questions under one word. A "dynamic attack" can vary in at least five things: which sensors it touches over time, the shape and size of the perturbation, the objective, the attacker's knowledge, and the metric used to score it. The dynamic-domain thesis concerns only the first. In RDAT's own main tables, adversarial training with randomly chosen nodes, the baseline RDAT presents as traditional adversarial training and elsewhere labels a dynamic strategy, closes about 93 percent of the attack-induced error on both benchmarks with Graph WaveNet, including against the time-dependent attack. Against that attack the learned selector adds less than two points of the gap, within run-to-run spread; under the other four attacks it stays within the spread on PeMS-D4 but adds 3.3 to 3.8 points on PeMS-BAY, slightly more than AT's seed spread. In the appendix, under the time-dependent attack, the ordering of the two methods flips with architecture while both close only 52 to 71 percent. Node selection is also the smaller lever in the attack literature's own ablations. The failures that are large come from changes in perturbation shape, target and metric. The paper consolidates the measured values in a table and a figure, states a procedure for crediting a robustness gain to a defence's dynamic component, and names the evaluations that would settle what remains open.

Zenodo (CERN European Organization for Nuclear Research)
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon