- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposed to use quantile conditioned context aggregation for probabilistic time series forecasting. Specifically, for each quantile, a query vector is constructed and is used to compute weights to combine different patches in the context, resembling the attention mechanism. On a comparison to 10 other probabilistic forecasting baselines, the proposed method seems outperform all the others on both CRPS (for probabilistic forecasts accuracy) and NMAE (for point forecasts accuracy). The proposed model is also very fast in inference due to its small size.
Critical strengths
- The paper is easy to read and follow.
- The proposed idea is simple and seems to working well compared with other baselines.
- The proposed model is small and fast in inference.
Critical weaknesses
- The motivation is not clear to me. The author wrote "...the relevance of historical information may vary across quantile levels." Why is this true? Why would a quantile focus more on an earlier path than the later patch? In the extreme case, for a short context window that contains only one patch, one would still expect good predicted quantiles.
- The importance of the proposed query dependent patch aggregation machanism is not clear to me. I can think of two more variants of the methods: a) same weights for all the queries b) instead of trying to aggregate patches, just concatenate patches as longer input (no aggregation will be needed). The comparison to a highlights the impact of the query dependence; the comparison to b indicates if we should do aggregation at all.
Questions for authors
- Besides my comments on the paper weakness, can the authors explain how did they ensure the baselines are correctly implemented and used? Why did they choose those 10 baselines not the others?
- There is a typo in Line 257, what is ?
9 comments
Response to authors
Thank you for the reply and the extra ablation.
Figure 3 indeed shows that QUEST assign different weights of patches for different queries. Having a look of the new ablation table (Table 3), the shared weights (same weights for all patches) is only slightly worse than QUEST. And the biggest improvement QUEST get is over the SharedContext baseline.
How is SharedContext implemented? Do you still learn key and values for SharedContext or there is no attention module in that setting?
Thank you for your further feedback. Your understanding is correct. In SharedContext, there is no attention module, and the encoded historical patches are directly concatenated to construct a shared historical context. Therefore, no Key or Value projections are learned.
Response to Reviewer t48m
We sincerely thank you for your detailed review and for recognizing the simplicity of our approach, the clarity of our paper, and the compact model size and fast inference of QUEST. We hope the following responses address your concerns.
W1: Motivation and the single-patch case
Thank you for pointing out the ambiguity in our motivation. We would like to clarify that different quantiles may benefit from different historical information, regardless of its position within the observed window. To make this motivation clearer, we revised the Abstract (lines 17–20) of the revised manuscript.
To further illustrate this, we added visualizations in Section 5.3.1, Figure 3 of the revised manuscript, with additional examples in Appendix B.4, Figures 6–9. For example, in Appendix B.4, Figure 6, as the quantile level increases from 0.05 to 0.95, the middle patch's weight increases from 5.2% to 85.9% in one ETTh1 example and decreases from 73.2% to 5.2% in another. These results illustrate that historical selection depends on both the input history and the target quantile.
Dividing historical observations into multiple patches is a common practice in time series forecasting [1–3], enabling compact representations of local historical patterns. In the single-patch case, the aggregation weight is 1, and QUEST can still produce different quantile forecasts through its quantile-conditioned decoder. With multiple patches, QUEST can further select historical information according to different quantile levels.
[1] Nie et al. A Time Series Is Worth 64 Words: Long-term Forecasting with Transformers. ICLR 2023.
[2] Lee et al. Learning to Embed Time Series Patches Independently. ICLR 2024.
[3] Wu et al. Enhancing Time Series Forecasting through Selective Representation Spaces: A Patch Perspective. NeurIPS 2025.
W2: Importance of query-dependent patch aggregation
Thank you for your suggestion. To further validate the effectiveness of query-dependent patch aggregation, we conducted two ablation studies following your recommendation: SharedWeight, which uses shared aggregation weights across quantiles, and SharedContext, which concatenates encoded historical patches. In addition, we conducted a SharedQuery ablation to examine the effect of sharing queries across quantile levels.
The table below reports CRPS / NMAE averaged over four forecasting horizons (lower is better).
These results support the effectiveness of query-dependent patch aggregation.
The ablation results are presented in Section 5.4.1, Table 3 of the revised manuscript, with detailed results for each forecasting horizon provided in Appendix B.1, Table 5.
Q1: Baseline selection and implementation
1. Baseline Selection
Thank you for your question. To cover different probabilistic forecasting paradigms, we selected representative baselines based on the discussion in the Introduction. We also added two recent methods, CWFlow and TimePrism, bringing the total to twelve baselines.
2. Implementation and Fair Comparison
To ensure a fair comparison, we used the baseline implementations already available in ProbTS [4] and integrated the publicly available code of additional baselines into the same framework. All methods followed consistent data splitting, preprocessing, and evaluation protocols. The experimental settings are described in Section 5.1 (lines 338–364), and the code repositories are provided in Appendix A.4, Table 4.
[4] Zhang et al. ProbTS: Benchmarking Point and Distributional Forecasting across Diverse Prediction Horizons. NeurIPS 2024.
Q2: Typo
Thank you for pointing out the typo. We corrected the notation to {eq}q=1Q in Section 4.2.1, line 264 of the revised manuscript, where eq is the query for the q-th target quantile and Q is the number of target quantile levels. We also carefully checked the manuscript for similar errors.
We hope that our clarifications and additional experiments address your concerns and provide a clearer understanding of our motivation and the effectiveness of the proposed method. Thank you again for your valuable feedback and consideration.