Papers › PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction

PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction

19 Jan 2023arXiv:2301.07945archive 2025-07-28

Jiawei Jiang, Chengkai Han, Wayne Xin Zhao, Jingyuan Wang

As a core technology of Intelligent Transportation System, traffic flow prediction has a wide range of applications. The fundamental challenge in traffic flow prediction is to effectively model the complex spatial-temporal dependencies in traffic data. Spatial-temporal Graph Neural Network (GNN) models have emerged as one of the most promising methods to solve this problem. However, GNN-based models have three major limitations for traffic prediction: i) Most methods model spatial dependencies in a static manner, which limits the ability to learn dynamic urban traffic patterns; ii) Most methods only consider short-range spatial information and are unable to capture long-range spatial dependencies; iii) These methods ignore the fact that the propagation of traffic conditions between locations has a time delay in traffic systems. To this end, we propose a novel Propagation Delay-aware dynamic long-range transFormer, namely PDFormer, for accurate traffic flow prediction. Specifically, we design a spatial self-attention module to capture the dynamic spatial dependencies. Then, two graph masking matrices are introduced to highlight spatial dependencies from short- and long-range views. Moreover, a traffic delay-aware feature transformation module is proposed to empower PDFormer with the capability of explicitly modeling the time delay of spatial information propagation. Extensive experimental results on six real-world public traffic datasets show that our method can not only achieve state-of-the-art performance but also exhibit competitive computational efficiency. Moreover, we visualize the learned spatial-temporal attention map to make our model highly interpretable.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2301.07945")

Code

Syntology Ran 6 of 8 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 6 ran with no contract checked.

By repository: official repository: 8 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

BUAABIGSCity/PDFormer officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 6 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

6ran
2unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from BUAABIGSCity/PDFormer. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

AbstractModel BUAABIGSCity/PDFormer/libcity/model/traffic_flow_prediction/PDFormer.py official repository ran MIT (permissive) · 0e6afce580fb1502 · report
AbstractTrafficStateModel BUAABIGSCity/PDFormer/libcity/model/traffic_flow_prediction/PDFormer.py official repository ran MIT (permissive) · 6ba9f3eb4fae249f · report
DataEmbedding BUAABIGSCity/PDFormer/libcity/model/traffic_flow_prediction/PDFormer.py official repository ran MIT (permissive) · 6f259d5e72269ce1 · report
PositionalEncoding BUAABIGSCity/PDFormer/libcity/model/traffic_flow_prediction/PDFormer.py official repository ran MIT (permissive) · 1a87dd511edbc83b · report
STSelfAttention BUAABIGSCity/PDFormer/libcity/model/traffic_flow_prediction/PDFormer.py official repository ran MIT (permissive) · cab1f3e5eb569e31 · report
TokenEmbedding BUAABIGSCity/PDFormer/libcity/model/traffic_flow_prediction/PDFormer.py official repository ran MIT (permissive) · 77819d970a28b38d · report
PDFormer BUAABIGSCity/PDFormer/libcity/model/traffic_flow_prediction/PDFormer.py official repository unverified MIT (permissive) · 767dff4849d872ef · report
STEncoderBlock BUAABIGSCity/PDFormer/libcity/model/traffic_flow_prediction/PDFormer.py official repository unverified MIT (permissive) · fcf9e522129aec3a · report

Tasks

Computational EfficiencyGraph Neural NetworkPredictionTime Series AnalysisTime Series PredictionTraffic Prediction

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Traffic Prediction PeMS04 PDFormer 12 Steps MAE 18.32 #7 of 12 Archive leaderboard report
Traffic Prediction PeMS07 PDFormer MAE@1h 19.83 #10 of 17 Archive leaderboard report
Traffic Prediction PeMS08 PDFormer MAE@1h 13.58 #8 of 13 Archive leaderboard report
Traffic Prediction PeMSD4 PDFormer 12 steps MAE 18.32 #5 of 13 Archive leaderboard report
Traffic Prediction PeMSD7 PDFormer 12 steps MAE 19.832 #6 of 8 Archive leaderboard report
Traffic Prediction PeMSD8 PDFormer 12 steps MAE 13.58 #7 of 13 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Graph Neural Network

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections