- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies long-horizon time series forecasting, where a model takes a look-back window of length and outputs the next steps. The authors propose CrossForest, which splits the -step horizon into interleaved sub-sequences by phase, so that learner is responsible for the timestamps whose absolute index is congruent to , and each learner owns its own parameters. Two design choices are emphasized: phase labels are assigned by the absolute timestamp index rather than by the position inside a sliding window, and under this global routing every timestamp is consumed exactly once, which removes the duplicate consumption of the window-local protocol. The framework is backbone-agnostic and is instantiated on nine LTSF models. Across 324 matched comparisons the macro-average MSE/MAE drop by 7.84%/4.76%, with 8 of 9 backbones improving on both metrics.
Critical strengths
- A broad, systematic empirical study. 324 matched comparisons (nine backbones × nine datasets × four horizons), and an explicit channel-count and phase-count sensitivity sweep, is more empirical work than is typical, and the sensitivity analysis is honest — the authors report that the benefit shrinks with the number of channels and turns negative on Traffic, rather than hiding it.
- Simple, cheap, and backbone-agnostic. The framework requires no change to the underlying architecture and adds only routing/aggregation, which is attractive for practitioners who already have a tuned backbone. The global-routing + dedup protocol is a clean fix to a real inefficiency of window-local phase assignment.
Critical weaknesses
- I am not fully convinced that the phase decomposition is new enough. Splitting the horizon into interleaved sub-sequences and giving each sub-sequence a separate model is very close to SutraNets, which also assigns a separate sequence model to every -th value, and SparseTSF is the shared-parameter version of the same construction. My understanding is that the two advertised contributions are a routing convention (phase labels from the absolute index rather than the window position) and a computational saving (dedup), rather than a new modelling principle. It would help if the paper could state more explicitly what it adds beyond this literature.
- I am also not able to tell how much of the gain comes from the method itself and how much from the extra parameters. Each phase learner has its own parameters, so the -phase model has roughly times the parameters of the control, and no parameter-matched control is reported. The closest available control, independent vs. shared phase parameters, wins only 25/36 comparisons, which, at least to me, suggests that specialization alone contributes little. A single learner widened to the same total parameter count as the -phase model would go a long way toward separating the two effects, and I would encourage the authors to add it.
Questions for authors
1, Please report a parameter-matched control: a single learner with the same total parameter count as the -phase CrossForest. How much of the gain survives? 2, Given Figure 2, under what conditions do you recommend CrossForest? Is there a principled rule (in terms of channel count, horizon, or periodicity) that predicts when it will help?
Thank you for raising this point. We added a parameter-matched experiment in Section 4.4.1, “Parameter Sharing and Parameter-Matched Controls.”
We adjusted the model width
dmodelof the single-learner control so that its total trainable parameter count was within 2% of that of the corresponding CrossForest model. In this experiment, CrossForest consistently achieved lower MSE and MAE than the parameter-matched single learner. These results indicate that the increase in parameter count alone does not explain CrossForest’s gains.At present, we can identify only one clear limitation: CrossForest’s performance deteriorates substantially on high-dimensional data with many channels.