- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces PathFM, a time series foundation model that generates forecast trajectories with flow matching. PathFM predicts competitive marginal quantiles while also producing realistic sample paths with dependence across time steps. The authors introduce a new benchmark (FPS) to evaluate sample paths and show that PathFM sets the state-of-the-art on their benchmark at a reasonable latency (achieved via parallel decoding distillation).
Critical strengths
- FPS fills an important gap in previous literature around evaluating sample paths (rather than just marginal forecasts)
- Flow matching is a well-motivated solution to sample accurately from the joint distribution over future time steps
- PathFM performs competitively to other time series foundation models on marginal accuracy, while providing improved sample paths
Critical weaknesses
-
Missing key details: PathFM is supposedly a near state-of-the-art time series foundation model (even when considering marginal accuracy alone). This is an impressive feat! However, the only information given on the training data is "a 83M-row dataset of real-world and synthetic time series." Additionally, the submission did not include code or model weights (though the authors say these will be released later). This lack of information makes it impossible to reproduce PathFM or decouple the contributions of the training data vs architecture and training objective. I would have quite liked to test out the model as part of this review.
-
Several parts of the paper are written in a way that is quite dense and hard to read (likely AI-generated), which is a shame as I think there are many interesting details that could be made more accessible. This is particularly prevalent in the appendix.
Questions for authors
-
Are there any comparisons between PathFM with stratified noise ("ensemble sampling") against baselines with "fair" sampling? This seems like an unfair comparison as stratified noise could also improve baselines. I would prefer all evaluations to use fair sampling.
-
Can you please provide more details on the training data? As you say this includes real-world time series, is there any risk of leakage/contaimination of the evaluation benchmarks?
-
The baselines with the Gaussian copulas are interesting. How do these compare to the simple method from [1]? Also, for the baselines, you used "constant extension beyond the outer quantiles". Does the IQF approach from [1] improve the baselines?
[1] Baron et al. Efficiently Generating Correlated Sample Paths from Multi-step Time Series Foundation Models. https://arxiv.org/pdf/2510.02224
2 comments
Dear Reviewer NtmG,
Thank you again for your review. In the revision, we released the code and model weights, clarified the training data, added iid-sampling comparisons for all models, evaluated IQF tails and the Baron et al. completion, and revised the writing (including a new appendix overview). We would be glad to clarify anything further before the discussion period ends.
Best regards, Authors
Response to Reviewer NtmG
Thank you for your careful and encouraging review. We address your concerns as below.
We have thoroughly revised the draft, with significant changes highlighted in blue. We extended the pretraining from 1M to 2M steps with the same data and architecture, denoted as "updated PathFM".
Reply to W1 and Q2 (training data, code and weights)
Training data. The general models are trained on an 83-million-row corpus of real and synthetic time series. The real part is drawn from public univariate datasets: energy (Electricity, Solar, Wind Farms, London Smart Meters, Buildings 900K), transport (Mexico City Bikes, Pedestrian Counts, Taxi, Uber TLC, LargeST, Q-Traffic), nature (KDD Cup 2018, USHCN, WeatherBench, Temperature-Rain), cloud operations (Alibaba Cluster Trace 2018, Azure VM Traces 2017, Borg Cluster Data 2011), web (Wiki), and the M4 daily, hourly, weekly and monthly sets. The synthetic part has two kinds of data. Univariate series come from a generator that combines random trend, seasonality and irregular components, and from one that samples random temporal causal graphs and generates series autoregressively. Multivariate series are built from univariate base generators (AR, ETS, the trend–seasonality generator, and KernelSynth) by adding dependence either at the same time step or across time, such as lead–lag relationships and cointegration.
Leakage. The corpus was built to exclude all fev-bench datasets, so the fps-bench tasks are also excluded, and the test portions of every GIFT-Eval task. It does overlap with the training portions of some GIFT-Eval datasets.
Data versus model design. We agree that comparisons with other pretrained models cannot separate these, but Chronos-2 is a close control in both training data (same corpus) and model size. PathFM-126M significantly improves FPS over Chronos-2 with its strongest completion (0.5386 vs. 0.5274; 95% CI [0.0028, 0.0200]). Since the training still differs, this is suggestive.
Code and weights. Thank you for raising this. We now provide the code and weights at https://github.com/pathfm/pathfm-supplementary-submission. The code is also uploaded to the supplementary material of the revised submission. We welcome you to try it directly!
Reply to W2 (dense writing)
Thank you for your thorough review and for recognizing the merits of the Appendix. We agree that parts of the paper, especially the Appendix, are dense. The paper reports a large number of results, and presenting them all compactly is not easy. We have nonetheless done our best to improve the presentation. Specifically, we have:
Reply to Q1 (fair sampling for every model)
Thank you for pointing out an issue in the original comparison. We now compare both PathFM and TimesFM-3 (the strongest baseline) under the same sampling scheme (iid or stratified). Specifically, TimesFM-3 uses a history-fitted AR(1) copula and IQF tails, which is also the strongest completion method we have tested.
We can see that PathFM leads the average FPS in every case except iid sampling + 32 paths. None of these differences from TimesFM-3 is significant. We have refined our claim in the manuscript to "PathFM ranks first in FPS, although its advantage over the second-place method is not significant." The revised manuscript now reports iid and stratified results for all models.
Reply to Q3 (AR completion and IQF tails)
Thank you for the reference. We have cited it and implemented the history-based AR(1) construction of Baron et al. (2025) for quantile baselines. It is the strongest completion we have tested, ahead of the other Gaussian copulas we fitted (residual AR(1), Toeplitz, and nonstationary covariance). We have therefore updated the FPS result table in the paper and in our reply to Q1 above. We specifically compared PathFM with TimesFM-3 + AR(1)/IQF to confirm that PathFM keeps the highest average FPS, though not statistically significant. We have updated our draft to be accurate on this claim.
Thank you again for your review!