Probabilistic traffic forecasting is essential for reliable Intelligent Transportation Systems (ITS), as it captures uncertainties in complex road networks. Recent diffusion- and flow-based generative models have facilitated uncertainty modeling through a multi-step sampling process. However, beyond slow inference, this process is designed to capture complex multimodal distributions, which misaligns with the limited complexity of the conditional traffic data distribution, causing models to underperform deterministic baselines. To address this, we introduce the Consistency-Relaxed Flow Map (CoReFlow) model, presenting the first effort to leverage the one-step generation capability of flow maps, known as solution operators of probability-flow ordinary differential equations. Besides, we improve accuracy using a concise training objective that supervises the model via interpolation endpoints over finite time intervals. Unlike existing methods (e.g., self-distillation and MeanFlow Identity) that maintain trajectory consistency to model multimodal distributions, our objective leverages conditional mean to restrict the consistency, thereby achieving higher accuracy in the probabilistic traffic forecasting task. Extensive experiments on four real-world datasets show CoReFlow achieves state-of-the-art forecasting accuracy. It surpasses recent baselines, provides competitive uncertainty modeling, and reduces inference costs compared to existing generative baselines.
Figures & tables
Figure 1: Accuracy (RMSE) vs. Inference latency on the PeMS07 dataset. The comparison includes CoReFlow, deterministic baselines, and generative baselines.
Figure 2: Distributions of intra- and inter-class cosine similarity on ImageNet and PEMS07.
Figure 3: Velocity field and flow map defined in the traffic forecasting task.
Figure 4: The Overall Model Structure.
Datasets
#Nodes
#Timesteps
Time Range
PEMS03
358
26,209
09/2018-11/2018
PEMS04
307
16,992
01/2018-02/2018
PEMS07
883
28,224
05/2017-08/2017
PEMS08
170
17,856
07/2016-08/2016
Table 1: Dataset Description
Model
PEMS03
PEMS04
PEMS07
PEMS08
RMSE
MAE
MAPE
RMSE
MAE
MAPE
RMSE
MAE
MAPE
RMSE
MAE
MAPE
HI
49.892
32.619
30.596
61.659
42.353
29.922
71.340
49.288
22.753
50.452
34.661
21.631
GWNet
25.080
14.545
14.857
30.310
18.948
13.469
33.517
20.472
8.683
23.398
14.586
9.659
MTGNN
25.653
14.953
15.523
30.940
19.084
13.407
34.102
20.958
8.985
24.281
15.252
10.001
STNorm
26.129
15.275
14.817
31.440
19.056
12.861
34.488
20.508
8.639
24.860
15.406
9.838
STID
27.606
15.298
16.166
29.909
18.402
12.573
32.741
19.645
8.314
23.350
14.226
9.356
Table 2: Performance comparison with deterministic models. CoReFlow is evaluated based on 1-sample generation ( N=1 ). All results are averaged over three runs with random seeds. Best and second-best results are shown in bold and underlined, respectively.
Metric
DiffSTG
USTD
SpecSTG
CoReFlow
PEMS07
1 sample
RMSE
55.926
40.747
49.917
32.601
MAE
39.047
26.602
35.630
18.783
MAPE
21.431
12.699
19.172
7.752
10 samples
RMSE
44.802
36.934
39.458
32.562
MAE
31.085
24.297
26.298
18.731
MAPE
18.430
12.060
13.759
7.693
Table 3: Performance comparison with generative models. Best and second-best results are shown in bold and underlined, respectively.
Figure 5: Percentage increase in prediction error for different ablated variants on the PEMS07 and PEMS08 datasets, using the proposed CoReFlow model as the baseline.
Figure 6: Inference latency on PEMS07.
PEMS
Parameter
03
04
07
08
EMA decay
0.9995
Learning rate
0.0002
Early stop
10
Batch size
8
clip_grad
0.5
0
0.5
1
Table 4: Model Hyperparameters for Different Datasets.
Parameters
Searching Space
Adaptive weight ( p )
[0.75,1.75]Δ=0.25
sampling mean ( μ )
[−3,3]Δ=0.2
sampling std ( σ )
[0.4,2.2]Δ=0.2
model dim ( D )
{128,256}
Transformer FFN dim
{256,512,1024,2056}
Attention heads
{2,4,8}
Table 5: Hyperparameter Searching Space
Figure 7: The full results of inference latency on PEMS07.
Figure 8: The full results of inference latency on PEMS08.
Traffic forecasting is a challenging spatio-temporal modeling task and a critical component of urban transportation management. Current studies mainly focus on deterministic predictions, with limited considerations on the uncertainty and stochasticity in traffic dynamics. Therefore, this paper proposes an elegant yet universal approach that transforms existing models into probabilistic predictors by replacing only the final output layer with a novel Gaussian Mixture Model (GMM) layer. The modified model requires no changes to the training pipeline and can be trained using only the Negative Log-Likelihood (NLL) loss, without any auxiliary or regularization terms. Experiments on multiple traffic datasets show that our approach generalizes from classic to modern model architectures while preserving deterministic performance. Furthermore, we propose a systematic evaluation procedure based on cumulative distributions and confidence intervals, and demonstrate that our approach is considerably more accurate and informative than unimodal or deterministic baselines. Finally, a more detailed study on a real-world dense urban traffic network is presented to examine the impact of data quality on uncertainty quantification and to show the robustness of our approach under imperfect data conditions. Code available at https://github.com/Weijiang-Xiong/OpenSkyTraffic
Weijiang Xiong, Robert Fonod, Nikolas Geroliminis
Urban Transport Systems Laboratory (LUTS), EPFL, Lausanne, 1015, Switzerland
Accurate uncertainty quantification is critical for many time series forecasting applications, and recent studies have increasingly adopted generative models to capture predictive uncertainty. Existing approaches often combine deterministic forecasting with generative modeling to improve predictive performance. However, their joint training is typically unstable because the deterministic model is embedded within the generative process, resulting in deep computational graphs and changing the probability transport path. In this work, we propose DV-Flow, a unified flow-matching formulation that incorporates the deterministic predictor as a parallel velocity component rather than as the endpoint of the transport path. This design enables stable end-to-end optimization while subsuming several existing formulations as special cases, allowing direct comparisons among them. Extensive experiments on six real-world datasets demonstrate that DV-Flow consistently improves probabilistic forecasting performance over strong baselines. Our code is available at https://github.com/tufts-ml/dv-flow-time-series.
Many scientific forecasting tasks require updating a distribution over future trajectories as new observations arrive. Conventional diffusion and flow models generate each forecast from Gaussian noise, often at the cost of many sampling steps. Warm-start methods reuse earlier predictions to reduce this cost, but their models are not trained to perform the forecast update itself, which can compromise quality under few-step sampling. In this work, we introduce Seq-Flow, a conditional flow model whose ODE transports samples from the previous forecast distribution to the updated one. Because successive forecasts often differ only modestly, this transport starts from an informative distribution and can produce accurate updates with few flow evaluations. Recursive reuse also creates a challenge: errors in one forecast become errors in the initial states of subsequent flows. We address this with self-rollout training, in which a moving average copy of the model generates forecasts that initialize later training updates. Unlike self-forcing methods, which reuse generated outputs as conditioning context, Seq-Flow reuses them as the source of the next flow. Experiments On particle-accelerator beam spill forecasting show Seq-Flow reduces CRPS by 65% under a few-NFE sampling budget, while remaining competitive with strong baselines on fluid-dynamics forecasting tasks. Although trained on self-rollouts of at most four updates, Seq-Flow remains accurate over more than 400 consecutive updates. Our code is available at https://github.com/Graph-COM/Seq-Flow.