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 ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 8 code samples harvested from 1 repository linked to this paper: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 8 samples from 1 repository, 6 ran (6 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

BUAABIGSCity/PDFormer officialmentioned in papermentioned on GitHubpytorchSyntology: 8 samples, 6 ran (0 instrument-failed) · 2 unverified 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 (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is 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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 2 samples that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

BUAABIGSCity/PDFormer official repository 8 samples, 6 ran (0 instrument-failed) · 2 unverified
AbstractModel in 10 papers libcity/model/traffic_flow_prediction/PDFormer.py ran MIT (permissive) · 0e6afce580fb1502 · report fixture: returned AbstractModel · level recorded 2026-09-22
AbstractTrafficStateModel libcity/model/traffic_flow_prediction/PDFormer.py ran MIT (permissive) · 6ba9f3eb4fae249f · report fixture: returned AbstractTrafficStateModel · level recorded 2026-09-22
DataEmbedding in 9 papers libcity/model/traffic_flow_prediction/PDFormer.py ran MIT (permissive) · 6f259d5e72269ce1 · report fixture: returned DataEmbedding · level recorded 2026-09-22
PositionalEncoding in 126 papers
census: 13 implementations from 9 papers, 9 distinct outputs across 5 buckets, one shared input per bucket
libcity/model/traffic_flow_prediction/PDFormer.py ran MIT (permissive) · 1a87dd511edbc83b · report fixture: returned PositionalEncoding · level recorded 2026-09-22
STSelfAttention libcity/model/traffic_flow_prediction/PDFormer.py ran MIT (permissive) · cab1f3e5eb569e31 · report fixture: returned STSelfAttention · level recorded 2026-09-22
TokenEmbedding in 11 papers libcity/model/traffic_flow_prediction/PDFormer.py ran MIT (permissive) · 77819d970a28b38d · report fixture: returned TokenEmbedding · level recorded 2026-09-22
PDFormer libcity/model/traffic_flow_prediction/PDFormer.py unverified MIT (permissive) · 767dff4849d872ef · report
STEncoderBlock libcity/model/traffic_flow_prediction/PDFormer.py unverified MIT (permissive) · fcf9e522129aec3a · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for PDFormer (graph method: PDFormer). 12 bricks; individually on a fixture: 10 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. The assembly has not been run end-to-end.

  1. PDFormer entry · level 0 · unverified · 767dff4849d872ef
  2. AbstractTrafficStateModel helper · level 1 · ran · 6ba9f3eb4fae249f
  3. DataEmbedding model · level 1 · ran · 6f259d5e72269ce1
  4. STEncoderBlock model · level 0 · unverified · fcf9e522129aec3a
  5. TokenEmbedding model · level 1 · ran · 77819d970a28b38d
  6. drop_path helper · level 1 · ran; the contract check could not run · 9bdf2492c6e0a8de
  7. AbstractModel helper · level 1 · ran · 0e6afce580fb1502
  8. LaplacianPE model · level 1 · ran · cdf28431d6d0ca21
  9. PositionalEncoding model · level 1 · ran · 1a87dd511edbc83b
  10. DropPath helper · level 1 · ran · dbb44455f4f7cf38
  11. Mlp model · level 1 · ran · a1715055832f71fd
  12. STSelfAttention model · level 1 · ran · cab1f3e5eb569e31

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2301.07945") returns these assemblies with each brick's role and wiring (how to connect).

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