- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This empirical study examines the interaction between patch size and encoder-only versus decoder-only TSFM training recipes. The authors train both model families from scratch at approximately matched parameter scales, using a common pretraining data mixture, number of optimization steps, and basic hyperparameters. Patch size is varied within each family, and context length is additionally varied for the encoder. Evaluation includes the 97 GIFT-Eval forecasting tasks, linear classification probes on frozen representations across UCR-91, training FLOPs, and CPU inference latency. In the main setting of approximately 260M parameters and 100k training steps, encoder forecasting improves as patches become smaller, whereas the decoder obtains its best aggregate forecasting results around P=64. The decoder's task-level preferred patch size varies across forecast-horizon groups. Smaller patches also benefit encoder classification. The appendix provides two important qualifications: the forecasting optimum for an approximately 35M-parameter encoder shifts to P=16, and comparisons of intermediate checkpoints with matched patch-token budgets favor coarser patches trained for longer, although those comparisons are confounded by differences in learning-rate annealing.
Critical strengths
- A reasonably systematic controlled study of a practical design question. The two families share the data mixture and number of optimization steps. The encoder's internal masking span is also fixed at 128 time points, avoiding a change in the masking task itself when patch size changes. Aggregate GIFT-Eval scores, task-level win rates, and context-length sweeps provide complementary evidence. For example, at C=2048, the P=8 encoder obtains the best MASE on 57/97 tasks and the best CRPS on 64/97 tasks (p. 6). This is useful evidence for design choices within the evaluated model families.
- Evidence across tasks, model scales, and budgets. Frozen linear probes on UCR-91 provide observations on another task, and the approximately 35M-parameter models reveal scale dependence. Appendix A.6 reports that matched-token checkpoint comparisons favor coarser patches. The authors also specify the conditions of the single-CPU latency measurements and acknowledge that the large speedups at long horizons are not accompanied by accuracy evaluations. This transparency strengthens the credibility of the empirical contribution.
Critical weaknesses
- The findings are specific to training recipes and budget definitions. The model families differ in tasks, normalization, the arcsinh transformation, positional encoding, heads, and training quantiles (pp. 3–5; Appendix A). Table A.1 uses 99 encoder quantiles versus 9 decoder quantiles; evaluating both on nine does not remove this objective difference. Equal optimization steps also do not imply equal FLOPs. In Table A.4, 2P@100k beats P@50k in every matched-token comparison, but the 50k checkpoints have not completed annealing, so this does not establish greater compute efficiency for coarser patches. The abstract and design recommendations should tie conclusions to the tested recipe, scale, and budget, rather than imply general architectural properties or compute-optimal scaling laws.
- Horizon trends and boundary configurations need stronger validation. Table A.2 (p. 14) reports 1/2/3/3/3 seeds for decoder P=16/32/64/128/256, with additional seeds allocated according to initial performance. A non-converged small-decoder run at P=16 was excluded (p. 16), leaving important boundary settings insufficiently replicated. The short/medium/long groups contain 55/21/21 tasks, so their win rates may reflect dataset composition as well as horizon. Establishing that larger patches become preferable as a task’s horizon grows requires paired analysis within shared datasets and frequencies. Current evidence supports an association across groups without fully attributing it to horizon.
Questions for authors
- Scope clarification. Would the authors limit the main findings to approximately 260M parameters, the current data mixture, and the fixed-step recipe? Are fully annealed results with matched FLOPs or token budgets available? Otherwise, can compute-optimal patch size remain an open question rather than an inference from intermediate checkpoints?
- Analysis of existing results. Within datasets and frequencies evaluated at multiple horizons, how do patch rankings change? Please provide seed-level results for key decoder configurations. Do trends persist when stability statistics include failed runs or comparisons use matched seed sets?
- Efficiency verification. Figure 5 uses one warm-up and one timed iteration (Appendix A.5). Is its low-latency Pareto frontier stable under repeated measurements with reported distributions? Please retain the qualification that Figure 6’s up-to-30× speedup applies to the specified CPU and generation strategies, without corresponding accuracy measurements.
We thank the reviewer for their thorough analysis of the paper and insightful comments which allowed us to significantly improve the paper. We have provided a general overview of the modifications in the general comment and we provide answers to the points raised below.
W1 + Q1.
W2 + Q2.
We further provide more fine-grained results based on the GIFT-Eval forecasting lengths in Appendix A.5 where we have restricted every term to the 21 dataset–frequency pairs that GIFT-Eval scores at all three terms. On these 21 datasets, the encoder continues to favor fine patches. For the decoder, the MASE gap between P=16 and the intermediate patch sizes widens as the horizon grows, showing that the pattern persists with the dataset and frequency composition held fixed (Fig. A.3).
Q3. We agree that the latency results are limited in scope. We have moved it to the appendix since it is not the main focus of the paper. Nonetheless, we have conducted further experiments in a more controlled environment that is described in Appendix A.6, with more warm-up iterations, more timed iterations and in a clearly specified environment. Qualitatively, the results are the same for CPUs. We now discuss them more in depth and make it clear that they are only applicable to low throughput CPU regimes. We also provide results obtained on an A40 GPU, on which the encoder-only models are faster than the decoder-only models due to the accelerations.
[1] Y. Wen, W. M. Gifford, C. Reddy, L. M. Nguyen, J. Kalagnanam, and A. A. Julius. Revisiting the generic transformer: Deconstructing a strong baseline for time series foundation models, Neurips 2026