TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts

Hyunwoo Lee, Sungahn Ko
2/12/2026

No official code found. Best implementation: HyunWookL/TESTAM (70 stars, MIT, last commit 2024-08-13).

Abstract

Accurate traffic forecasting is challenging due to the complex dependency on road networks, various types of roads, and the abrupt speed change due to the events. Recent works mainly focus on dynamic spatial modeling with adaptive graph embedding or graph attention having less consideration for temporal characteristics and in-situ modeling. In this paper, we propose a novel deep learning model named TESTAM, which individually models recurring and non-recurring traffic patterns by a mixture-of-experts model with three experts on temporal modeling, spatio-temporal modeling with static graph, and dynamic spatio-temporal dependency modeling with dynamic graph. By introducing different experts and properly routing them, TESTAM could better model various circumstances, including spatially isolated nodes, highly related nodes, and recurring and non-recurring events. For the proper routing, we reformulate a gating problem into a classification problem with pseudo labels. Experimental results on three public traffic network datasets, METR-LA, PEMS-BAY, and EXPY-TKY, demonstrate that TESTAM achieves a better indication and modeling of recurring and non-recurring traffic. We published the official code at https://github.com/HyunWookL/TESTAM

View on arXivView PDF

Code Implementations(1)

HyunWookL/TESTAMCommunity61%
MIT

Official Code of TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts

708PythonMar 5, 20242 years agoMIT

Similar Papers

Cite this paper

@article{lee2026testam,
  title  = {TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts},
  author = {Hyunwoo Lee and Sungahn Ko},
  year   = {2026},
  eprint = {2403.02600},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2403.02600},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.02600.svg)](https://codeofpaper.com/paper/2403.02600)

Discussion