- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SCPEC, a unified workload forecasting framework designed to address the limitations of history-derived pattern reuse under heterogeneous and evolving workload conditions. The authors identify two challenges: insufficient historical pattern coverage and changes in the predictive applicability of similar historical patterns after application events. To address these challenges, SCPEC introduces a learnable pattern-expert bank shared across nodes and a state-conditioned sparse routing mechanism. The routing state integrates temporal dynamics, spectral information, and optional static node context. Selected pattern experts are composed and incorporated into Transformer representations through gated residual connections, followed by a horizon-query readout for multi-step forecasting.
Critical strengths
- The research motivation is supported by a well-grounded quantitative analysis. The paper provides a well-motivated analysis of the limitations of history-based pattern reuse under dynamic workload conditions. By quantifying historical pattern coverage and pattern-transfer ambiguity (PTA), the authors demonstrate how application-state changes can undermine the reliability of similarity-based retrieval. The additional historical-composition diagnostic and node-level bootstrap confidence intervals for the ECW–NewAPP comparisons further strengthen this analysis. These observations provide meaningful empirical motivation for the proposed state-conditioned pattern composition framework.
- The paper demonstrates strong forecasting performance, supported by informative ablation studies. SCPEC demonstrates strong forecasting performance across diverse datasets, achieving the best or tied-best results on 15 of 16 reported MSE/MAE entries at three-decimal precision against 20 baselines. The zero-shot evaluation on NewAPP and Switch using models trained on ECW without retraining further indicates its potential to handle application-state changes. The ablation studies consistently show performance degradation when removing pattern-expert composition or spectral information, while replacing the proposed knowledge module with Meta-pattern Pooling also reduces performance. These results provide encouraging evidence for the effectiveness of the overall framework.
Critical weaknesses
- The independent contributions of different method components have not yet been fully distinguished. Although the ablation studies demonstrate the effectiveness of the overall design, they do not fully disentangle the contributions of the learnable pattern bank, state-conditioned routing, and gated composition. In particular, the w/ MPP variant replaces all three mechanisms simultaneously, making it difficult to determine which component accounts for the observed improvement over history-derived pattern reuse. Furthermore, the expert bank employs an EMA warm-start based on observed training segments, and the influence of this initialization on generalization remains unclear. More fine-grained ablations would help substantiate the claimed advantages of learnable, state-conditioned pattern composition.
- The scope of generalization evaluation and experimental statistical stability still has limitations. The generalization evidence remains limited to a fixed 48-to-24 forecasting configuration with single-channel inputs. Moreover, the two application-event scenarios, NewAPP and Switch, are derived from ECW, and Switch contains only 12 valid forecasting windows under the reported protocol. This relatively small evaluation set limits the strength of conclusions about robustness to application switching. In addition, the main forecasting and ablation results are averaged over only three random seeds without reporting variability or statistical significance, making it difficult to assess the reliability of smaller improvements over competitive baselines.
Questions for authors
Q1. Could the authors provide more fine-grained ablations that separately evaluate the learnable pattern bank, state-conditioned routing, and gated composition? In particular, comparisons between learnable pattern experts with similarity-based routing and history-derived patterns with state-conditioned routing would help clarify the source of the improvements. Additionally, how does the EMA warm-start affect forecasting accuracy and generalization to unseen workload patterns? Q2. How does SCPEC perform under different look-back lengths and prediction horizons? Could the authors also provide additional application-event evaluations beyond NewAPP and Switch, particularly given the limited number of valid windows in Switch? Such experiments would help determine whether the observed generalization improvements extend to a broader range of workload dynamics. Q3. Could the authors report standard deviations or confidence intervals for the results in Tables 1 and 2 and conduct statistical significance tests against the strongest baselines? Since several reported improvements are relatively small, additional statistical evidence would help establish whether these gains are consistent across random seeds.
Response to Reviewer yY8L: component ablations and EMA warm-start, other lengths and unseen nodes, and significance tests
We thank the reviewer for the constructive questions. All results below are in the revised PDF (App. B.3–B.6).
Q1 (W1): Component contributions and the EMA warm-start. We ran the requested ablations, which separate the three mechanisms that w/ MPP replaces at once, in the setting of Table 2 (same backbone, hyperparameters and budget; 3 seeds). Similarity selection scores each pattern by its Pearson correlation with the block's input segment; a history-initialized bank starts from E randomly drawn block-aligned training segments without warm-up and is then learned or kept fixed. MSE, mean of 3 seeds (MAE and stds in App. B.3, Table 8):
Q2 (W2): Other lengths and evaluation beyond NewAPP/Switch.
Q3 (W2): Variability and significance (App. B.4). Table 2 now reports mean ± std, and App. B.4 gives the full Table 1 with stds (Tables 9–10), per-seed values and Welch tests (Tables 11–12). While compiling them, we re-ran SAN on NewAPP/Switch and UniTime on ECL270 and added the missing Crossformer row; no strongest baseline changed. On all 14 entries that SCPEC leads, it wins every seed, and its worst run beats the baseline's best run. Ten of 16 entries reach Welch p < 0.05; ECW MSE (p = 0.218) and Switch MSE (p = 0.108) miss because the baseline has one high-error seed, and ECL270/Traffic852 MAE are borderline (p = 0.054/0.052). Across the eight datasets, an exact Wilcoxon signed-rank test gives p = 0.016 (MSE) and 0.023 (MAE). On NewAPP, SCPEC and FreqMoE are statistically tied (p = 1.000/0.082), and SCPEC beats the next-strongest Fremer on both metrics (p ≤ 0.035). In Table 2, every variant is worse than SCPEC by more than its own std, with p < 0.05 except w/ MPP on Switch (12 windows; p = 0.166/0.072) and on ECL270 MSE (p ≈ 0.05).