- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes LatentTime, a framework for efficient long-context time-series foundation models that reduces computational overhead from long input contexts and variable-length padding. Specifically, LatentTime introduces (i) Latent Forecasting, which uses a lightweight autoencoder to compress input sequences by 2× and reconstruct forecasts through temporal super-resolution, and (ii) Length-Aware Bucketing, which reduces padding overhead and controls training exposure across different context lengths. Experiments on the GIFT-Eval benchmark demonstrate forecasting performance comparable to raw-space PatchTST with lower computational costs.
Critical strengths
-
While most time-series foundation models focus on autoregressive forecasting and Transformer architectures in the raw input space [1, 2], this paper explores a meaningful direction toward improving long-context efficiency through latent-space forecasting.
-
The Length-Aware Bucketing strategy is a practical approach that improves computational efficiency over conventional padding methods by reducing unnecessary computation, while also demonstrating improved forecasting performance in the experiments.
Critical weaknesses
-
I believe that demonstrating how to construct effective latent representations is crucial to this paper. However, the latent representation design is not explored in sufficient depth, as the proposed method largely relies on a conventional autoencoder. While the spectral alignment loss is introduced to improve latent representations, Figure 11 only provides visualizations of selected examples. Quantitative comparisons are needed to demonstrate its effectiveness in learning suitable latent representations for forecasting.
-
The effectiveness of latent forecasting is not sufficiently clear. As shown in Figure 5, LatentTime achieves nearly identical performance to PatchTST-WB, with only a 0.002 difference in MASE. However, LatentTime switches to raw-space forecasting for context lengths below 512, and the proportion of such cases in the evaluation is not reported. If these cases account for a substantial portion of the benchmark, the overall results may mask a larger performance gap between latent-space and raw-space forecasting.
Questions for authors
-
Could you provide a quantitative ablation study on the effectiveness of the spectral alignment loss, particularly for latent representation quality and downstream forecasting performance?
-
Could you provide a separate comparison between LatentTime and PatchTST baselines in Figure 5 using only evaluation cases with context lengths of at least 512? I think it is important to isolate the performance of latent forecasting from raw-space forecasting.
-
Have you explored alternative latent compression methods, including but not limited to cross-attention-based approaches [3, 4]? How do they compare with the proposed autoencoder-based design?
[1] Das et al., "A Decoder-Only Foundation Model for Time-Series Forecasting", ICML 2024
[2] Shi et al., "Time-MoE: Billion-Scale Time Series Foundation Models with Mixture of Experts", ICLR 2025
[3] Lee et al., "TimePerceiver: An Encoder-Decoder Framework for Generalized Time-Series Forecasting", NeurIPS 2025
[4] Liu et al., "UniTST: Effectively Modeling Inter-Series and Intra-Series Dependencies for Multivariate Time Series Forecasting", TMLR 2025
9 comments
W2: The effectiveness of latent forecasting is not sufficiently clear. As shown in Figure 5, LatentTime achieves nearly identical performance to PatchTST-WB, with only a 0.002 difference in MASE. However, LatentTime switches to raw-space forecasting for context lengths below 512, and the proportion of such cases in the evaluation is not reported. If these cases account for a substantial portion of the benchmark, the overall results may mask a larger performance gap between latent-space and raw-space forecasting.
Thank you for your valuable comments. We agree that this is an important question and have discussed it in detail in Appendix D.3. Among the 97 evaluation tasks in the GIFT-Eval benchmark, approximately 19 tasks, or 20%, use [RAW] for contexts shorter than 512. The remaining 78 tasks, or approximately 80%, have minimum context lengths greater than 512 and use only the [LAT] token for latent-space forecasting. So the majority of benchmark tasks are forecast entirely in the latent space. We provide further quantitative analysis of this issue in our response to Q2.
Q1: Could you provide a quantitative ablation study on the effectiveness of the spectral alignment loss, particularly for latent representation quality and downstream forecasting performance?
Thank you for your constructive suggestion. We have added an ablation study in RQ2 to evaluate the effect of the spectral alignment loss. The results are shown as "w/o Align" in the updated Figure 7. We conduct the ablation from three perspectives: reconstruction loss, robustness to missing values, and downstream forecasting. The results show that this loss has a limited effect on the reconstruction performance of TS-AE. However, when the model is applied to downstream forecasting, its forecasting performance declines noticeably without the loss.
This loss was designed to address the inverted latent representations produced by the original autoencoder and the insufficient detail in their periodic components. By constraining the power spectral density, it helps the model preserve some linear correlations during compression, thereby substantially improving the details retained in the latent representations. For this reason, our forecasting performance in the latent space has also been greatly enhanced. We have revised Section 4.2 to address this issue.
Q2: Could you provide a separate comparison between LatentTime and PatchTST baselines in Figure 5 using only evaluation cases with context lengths of at least 512? I think it is important to isolate the performance of latent forecasting from raw-space forecasting.
Following your suggestion, we have added an analysis in Appendix D.3. Based on the use of [RAW] and [LAT], we identified 78 evaluation tasks whose minimum context length is greater than 512 and which use only [LAT] for latent-space forecasting. In the remaining tasks, 15 use only [RAW] for forecasting in the original space, while 4 use a mixture of the two modes. The dataset statistics and partitioning are provided in Tables 27 and 28. Following the original metric computation procedure, we calculated results for these two task groups, as shown below and in Table 29. The 78-task group isolates [LAT] tasks. It does not include [LAT] windows from the four mixed-mode tasks.
| Minimum context length | Model | Gmean MASE | Median MASE | Gmean CRPS | Median CRPS |
|---|---|---|---|---|---|
| (78) | PatchTST | 0.795 | 0.755 | 0.444 | 0.423 |
| PatchTST-WB | 0.793 | 0.732 | 0.434 | 0.412 | |
| LatentTime | 0.795 | 0.741 | 0.437 | 0.408 | |
| PatchTST-P32-WB | 0.811 | 0.781 | 0.449 | 0.475 | |
| PatchTST-P32 | 0.814 | 0.766 | 0.466 | 0.467 | |
| (19) | PatchTST | 0.513 | 0.625 | 0.799 | 0.84 |
| PatchTST-WB | 0.492 | 0.617 | 0.765 | 0.78 | |
| LatentTime | 0.494 | 0.621 | 0.768 | 0.785 | |
| PatchTST-P32-WB | 0.493 | 0.608 | 0.749 | 0.796 | |
| PatchTST-P32 | 0.491 | 0.64 | 0.776 | 0.764 |
On the 78 LAT-only tasks, LatentTime matches PatchTST in geometric-mean MASE at the reported precision and improves on its other three metrics. It also outperforms both patch-size-32 variants on all four metrics. Compared with PatchTST-WB, LatentTime remains close in geometric-mean MASE (0.795 vs. 0.793) and CRPS (0.437 vs. 0.434), while achieving a lower median CRPS (0.408 vs. 0.412). LatentTime achieves these results with a compressed input context; the RQ6 measurements show lower FLOPs and latency for longer contexts under the tested settings.
These results support the effectiveness of LatentTime's latent-space forecasting, while the RQ6 experiments provide evidence of its efficiency in processing long-context sequences.
Q3: Have you explored alternative latent compression methods, including but not limited to cross-attention-based approaches [3, 4]? How do they compare with the proposed autoencoder-based design?
This is an interesting question. We did try different architectures and ultimately chose the one we are currently using. Most of the references you provided use Transformer architectures. Our initial compression model was also Transformer-based. Compared with our current convolutional model, its main advantage is that compressed patch representations can be retained directly as downstream tokens. Transformers also have better support for software and hardware acceleration techniques such as FlashAttention and KV caching.
However, we observed a serious issue: compression with the Transformer architecture appeared to be generative. Both latent compression by the encoder and reconstruction from the compressed latent representation by the decoder seemed to require the model to "generate" a new output. In contrast, time-domain convolutions act as natural filters: each convolution can be understood as extracting and filtering features from the existing representation through a linear transformation, rather than generating a new result in the same way. We analyze this phenomenon in detail in Appendix B.6. Figure 14 compares the latent spaces constructed by the convolutional and Transformer architectures. The Transformer-generated representations appear overly smooth and fail to reflect trend variations and periodic details.
We also conducted reconstruction and forecasting experiments on the Transformer-based TS-AE, following an approach similar to that used in Q1. The results are presented in RQ2 of Section 4. Although its latent-space characteristics are noticeably weaker than those of the convolutional model, the Transformer-based model can still achieve good compression and reconstruction of time series. However, it performs poorly on downstream time-series generation. We believe this may be because its latent representation is generated rather than obtained through natural filtering. In other words, details in the latent space are also critical to whether the forecasting model can learn predictive representations and successfully forecast in the latent space. For this reason, we ultimately chose a convolutional network as the main architecture of TS-AE. We have included the paper you mentioned in the discussion of our paper.
We thank you again for your time and constructive feedback. We hope that our responses and revisions address your concerns, and we look forward to your further feedback.
Dear Reviewer,
Thank you for your time and effort in providing constructive feedback on our paper. We have further explored the module architecture and pre-training loss of TS-AE in the paper. In our latest updated PDF of the paper, we have marked the revisions in blue. All section references below are to the revised manuscript. Below, we will answer your questions one by one.
Thank you for your question. We would like to clarify the following five points:
We sincerely hope that these responses address your concerns.
Thank you for your valuable feedback. We have added an ablation experiment for this loss in Section 4, RQ2, and the specific experimental results are shown in the updated Figure 7. In our response to Q1, we provided a detailed analysis of the problem, experimental results, and reasons.