Transferable Traffic State Forecasting Using Meta-Learning with a Multi-Dimensional Spatio-Temporal Graph Attention Model
Bibliographic record
Abstract
Traffic state forecasting plays a critical role in developing effective traffic control and management strategies. While machine learning (ML) approaches have become popular, owing to automatic spatio-temporal feature extraction, traditional ML approaches fail to generalize and adapt to unseen datasets, limiting their practical applicability. To boost generalization, researchers are increasingly turning to few-shot adaptation techniques, such as meta-learning, which focuses on learning how to learn and enabling rapid adaptation to unseen datasets using limited data. This study applies the Model-Agnostic Meta-Learning framework to a multi-dimensional spatio-temporal graph attention-based traffic prediction model (M-STGAT), producing a new model, called Meta M-STGAT. The goal is to improve forecasting performance through faster adaptation to unseen time periods. This study uses open-access traffic speed and lane closure data from the California Department of Transportation Performance Measurement System and corresponding weather data from the National Oceanic and Atmospheric Administration’s Automated Surface Observing System. Meta M-STGAT is compared against state-of-the-art traffic state forecasting models, including traditional M-STGAT, a multi-dimensional graph attention network, and a multi-dimensional long short-term memory network. Model performance is evaluated for 30-, 45-, and 60-min prediction horizons on one primary and three transfer datasets. Results show that Meta M-STGAT consistently outperforms all alternative state-of-the-art models across all transfer datasets and prediction horizons. The findings underscore the potential of meta-learning in enhancing traffic state forecasting and its practical implications for traffic management systems.
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.003 |
| 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.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".