- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper introduces CAPE, a no-gradient forecasting method for time series forecasting and zero-shot. They fold a time series based on a detected period and align observations by phase across cycles, and then estimate a forecasting operator through a single Tikhonov-regularized closed-form solution. They connect this construction to a finite-dimensional EDMD approximation of cycle-level Koopman evolution. The method is lightweight and empirically evaluated on standard forecasting and transfer benchmarks. The paper also includes useful ablations against ridge regression.
Critical strengths
Computational simplicity and efficiency that reduces forecasting to a small closed-form linear solution and avoids iterative gradient-based training.
Critical weaknesses
1 Figure 1 and Figure 2 are low quality and hard to understand. Especially for figure 2, there are no clear differences except color between the upper panels with the lower panels. Given that these figures introduce the main idea, I believe they should be substantially redesigned.
2 The theoretical contributions appear to be limited. The four parts of theorem 1 seem to be very standard. I don’t feel proposition 1 explains the “stronger zero-short transfer” more than comparing two different spectral filters. Besides, these two spectral filters are both smooth spectral filters.
3 The main Table 1 does not use a matched lookback length across methods. Besides, the baseline comparison is not sufficiently comprehensive to support a strong SOTA claim. Several relevant recent forecasting methods using periodic information are absent. For example, WaveletMixer and WPMixer use multi-resolution wavelet decomposition and mixing; D-PAD explicitly models multi-frequency decomposition and fusion. Without comparison against such methods, especially those targeting closely related multi-scale or frequency-structured forecasting, it is difficult to assess the claimed state-of-the-art advantage.
[1] Zhang, Zichi, et al. "WaveletMixer: a multi-resolution wavelets based MLP-mixer for multivariate long-term time series forecasting." Proceedings of the AAAI Conference on Artificial Intelligence. Vol. 39. No. 21. 2025.
[2] Murad, Md Mahmuddun Nabi, Mehmet Aktukmak, and Yasin Yilmaz. "Wpmixer: Efficient multi-resolution mixing for long-term time series forecasting." Proceedings of the AAAI conference on artificial intelligence. Vol. 39. No. 18. 2025.
[3] Yuan, Xiaobing, and Ling Chen. "D-pad: Deep-shallow multi-frequency patterns disentangling for time series forecasting." arXiv preprint arXiv:2403.17814 (2024).
4 The paper does not report the number of seeds. The reported number seems to be very close in Table 14, the reported improvement over SparseTSF is only 0.1% at H=96 (0.3615 vs. 0.3620), and all less than 3% difference, yet this result is used to support the claimed advantage over gradient-based methods.
5 Appendix Table 12 exists the resolution mismatched issues labeled ETTm1→ETTh1 transfers with the same numerical 24 to 24 periods as “matched,” despite the same resolution mismatch. The paper also states that a daily cycle in ETTm corresponds to 96 steps.
6 The evaluation does not sufficiently test the claimed robustness beyond the standard benchmark setting.
Questions for authors
Questions:
1 Can authors guide me through the logic in figure 1 and figure 2. Especially the figure 2 to understand what it actually means.
2 What specifically in Proposition 1 justifies the stronger zero-shot transfer claim?
3 What are the lookback lengths across methods in the main Table 1? Are they under fair comparisons? Can the author provide statistical significance when compared with these different methods with such close performances?
4 Can the authors compare against more recent frequency-/multi-scale methods such as WaveletMixer, WPMixer, and D-PAD?
5 What exactly does “matched” mean in Appendix Table 12, given the 24-step vs. 96-step daily-cycle difference between ETTh and ETTm?
6 Can the authors evaluate robustness under missing data, irregular sampling, weaker periodicity, and broader zero-shot benchmarks such as GIFT-Eval?
Aksu, Taha, et al. "Gift-eval: A benchmark for general time series forecasting model evaluation." arXiv preprint arXiv:2410.10393 (2024).
5 comments
Part 2/2
W5 + Q5. "Matched" in Table 12
"Matched" referred to sampling resolution, not to the fold. We relabel each pair by fold type (true period, divisor, misaligned). We also tested the remedy on the cross-resolution pairs: re-detecting the period on the target (p=96 on ETTm2) improves both pairs at both look-backs (ETTh1→ETTm2: 0.297 → 0.291 and 0.296 → 0.289. ETTh2→ETTm2: 0.275 → 0.271 and 0.273 → 0.269).
W6 + Q6. Robustness beyond the standard setting
Models are trained on clean data. At test time 5/10/20% of look-back values are hidden at random (3 masks per setting). Change in MSE relative to clean input:
| Dataset | Model | Clean | Zero-fill 5% | Zero-fill 10% | Zero-fill 20% | Interp. 20% |
|---|---|---|---|---|---|---|
| ETTh1 | CAPE | 0.399 | +0.7% | +2.2% | +7.9% | +0.2% |
| ETTh1 | SparseTSF | 0.406 | +0.9% | +2.6% | +8.5% | +0.4% |
| ETTh1 | DLinear | 0.437 | +1.8% | +4.8% | +12.7% | +0.8% |
| ETTh2 | CAPE | 0.332 | +4.6% | +13.1% | +41.5% | +0.1% |
| ETTh2 | SparseTSF | 0.361 | +5.0% | +14.0% | +43.2% | +0.3% |
| ETTh2 | DLinear | 0.479 | +11.6% | +25.8% | +57.4% | +0.9% |
CAPE degrades least in every setting and remains the most accurate model. With linear interpolation before folding (Appendix F), 20% missing data changes its MSE by at most +0.2%. Weak periodicity is covered by Exchange-Rate (Table 6), where the detector selects p=1 and CAPE reduces to a ridge autoregressor. Robustness to the folding period is tested on four datasets (see our response to Reviewer uZZE, W3). A full GIFT-Eval evaluation is left for future work.
We hope these results address your concerns and would appreciate you reconsidering your score.
Dear Reviewer YQ4p, thank you again for your review. As the discussion period is ending, we wanted to check whether our response and the new results (WPMixer and WaveletMixer under a matched protocol, the 5-seed SparseTSF comparison, and the missing-data study) address your concerns. We are happy to clarify anything further.
Part 1/2
We thank the reviewer for the constructive questions. We ran every requested experiment: matched-protocol comparisons with WPMixer and WaveletMixer, a 5-seed significance test, and a missing-data study. We answer each weakness together with its related question.
W1 + Q1. Figures 1 and 2
Figure 1. The series is folded into an S×p matrix, with cycles as rows and phases as columns. Each column is one phase sequence, which Theorem 1(1) makes cycle-stationary. A single W∈RS×M maps the last S cycles of every column to its next M cycles.
Figure 2. The solid path estimates W in one closed-form solve on the training data. The dashed path is zero-shot: the source W is applied to the folded target windows with no fitting. The two panels differ in exactly this respect: estimate W, or reuse it. We added this walkthrough to the captions.
W2 + Q2. Theoretical contribution and Proposition 1
Theorem 1 provides what no prior period-sparse forecaster states: why one operator can be shared across phases and channels (Part 1), what it estimates, namely the Galerkin projection of the cycle Koopman operator (Part 2), and when it is exact (Part 4). Part 4 yields a transfer result: under shared cycle dynamics the source operator is optimal on the target (see our response to Reviewer uZZE, W1).
Proposition 1 isolates the single difference between CAPE and an SGD-trained forecaster on the same design: the spectral filter. Both filters are smooth, as you note. The gradient-flow filter depends on the stopping time and learning rate, which are fixed by source-specific optimization. The Tikhonov filter is explicit and computed in one solve. The direct test is SparseTSF, the same folded model class trained by SGD: CAPE achieves lower zero-shot MSE on all 8 ETT transfer pairs (table in our response to Reviewer uZZE, W1).
W3 + Q3. Look-back lengths, fairness, and significance
Table 18 compares all methods at L=96 in one pipeline. We added TimeMixer++. Traffic is compared under the matched L=720 protocol in the table below. CAPE has the best MSE on ETTh1 (0.438), ETTh2 (0.373) and ETTm1 (0.386). At L=96 the dictionary holds only S=L/p=4 daily cycles on hourly data, and none on Weather, where one day spans 144 steps. CAPE leads wherever the window contains several cycles, which is its intended regime.
Significance and strength of the claim. CAPE is deterministic, so variance comes only from the baselines. SparseTSF's seed std is about 0.004 (1%). Under the matched L=720 protocol below, CAPE's MSE margins over the better of WPMixer and WaveletMixer are 2.4% to 9.3% on all seven datasets, well beyond that variance. We now state each claim with its protocol.
W3 + Q4. WPMixer, WaveletMixer, D-PAD
Same protocol as CAPE (L=720, same splits and pipeline, official code and hyperparameters). MSE / MAE averaged over H:
CAPE has the best MSE on all 7 datasets and the best MAE on 6 of 7, with a single closed-form solve. D-PAD has no public implementation that we could find, so it cannot be run under the matched protocol. We cite and discuss it in related work.
W4. Seeds and the comparison with SparseTSF (Table 14)
SparseTSF at the same period (p=24) over 5 seeds, against CAPE, which is deterministic:
CAPE is better at every horizon, and significantly so at H=336 and H=720 (one-sample t-test, p<0.05). At short horizons it matches SparseTSF within seed variance, with no gradient training. The advantage over gradient-based training is therefore equal or better accuracy from a single solve.