- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper revisits trend decomposition in patch-based forecasting and proposes PaDNet, which combines low-rank patch encoding with a difference-based branch using categorical delta-evolution modulation. Validation includes forecasting on datasets, component ablations, comparisons against decomposition alternatives, and theoretical analysis of predictive expressiveness and feature fusion.
Critical strengths
- Experiments cover public datasets and multiple forecasting horizons, demonstrating competitive performance across different temporal characteristics.
- The raw-input and decomposition controls, including experiments within xPatch, directly examine the motivating question and provide useful evidence about alternative input representations.
Critical weaknesses
- The method mainly combines low-rank projection, first-order differences, and categorical modulation within a dual-stream architecture resembling xPatch. The paper does not clearly identify a concrete predictive failure of existing methods or establish why these modifications constitute a new paradigm. Figure 1’s single-channel correlation analysis does not demonstrate that decomposition is unnecessary, and the general risk-reduction arguments do not uniquely justify the proposed mechanisms. Repetitive, abstract writing and crowded figures with small fonts further obscure the motivation, technical distinctions, and supporting logic.
- Table 2 shows mostly modest improvements, while Table 3 reports MSE reductions below 1% over the raw-input control on ETTh1, Electricity, and PEMS03. Electricity MAE slightly worsens, and PEMS03 MAE remains unchanged. Larger improvements occur in some settings, but only one training seed is reported, leaving the reliability of small gains unclear. Moreover, removing the entire dynamics branch does not isolate the contribution of evolution routing. A matched comparison against ordinary differences is essential to establish the value of the proposed design.
Questions for authors
- What specific predictive limitation motivates the proposed state-dynamics formulation, and which result demonstrates an advance beyond a dual-stream model using raw observations and ordinary differences?
- Can you provide a matched ablation that removes evolution routing while retaining the difference branch, and assess whether the improvements over Reg persist across multiple training seeds?
- What evidence shows that the low-rank projection preserves trajectory tendencies and periodic structure, rather than providing generic dimensionality reduction?
3 comments
Thank you for the additional experiments. They partly address my concerns, but the gains from evolution routing remain small. The novelty concern remains, so I maintain my rating.
Thank you for your thoughtful feedback and for taking the time to review our additional experiments. Our primary aim is to demonstrate that, in the settings we study, forecasting directly from raw patches can match or outperform forecasting with both patching and explicit trend–seasonal decomposition. Many current forecasting methods combine the two on the intuition that they will complement each other. We test that intuition by asking what happens to forecast accuracy when we keep the patches but omit the decomposition.
In Table 3, the raw-patch control achieves performance comparable to the variants that use decomposition. We also test the same idea within xPatch, where the raw-input variant outperforms its EMA counterpart. These comparisons show why a raw-patch control matters: strong results from a model that uses both techniques do not, on their own, establish that decomposition improves on patching alone.
Building on this finding, we offer PaDNet’s two-branch design as one way to model raw patches further: one branch represents the local trajectory within a patch, while the other uses successive changes to supplement its forecast. We agree that evolution routing yields a modest gain over ordinary differencing. Our aim with this design is to explore how to model patch dynamics once explicit decomposition is omitted. The evidence for our main finding comes from the direct comparisons between raw and decomposed inputs. We will make this distinction clearer in the abstract and introduction.
Thank you for your constructive review. We will revise the manuscript to clarify the motivation and strengthen the empirical support. Our responses follow.
For Q1. We found substantial agreement between raw patches and trend patches, while raw patches also retain periodic structure (Fig.1/App.E.2). This led us to test whether explicitly separating these components provides additional forecasting value.
We extended these channel-1 training diagnostics to the following datasets using period-covering histories. r/CCC measure raw-trend slope agreement; DA is direction agreement (%); contrast compares periodic/non-periodic similarity (raw/seasonal).
The consistency across these datasets indicates a common structural overlap. At the forecasting level, Table3 compares raw/raw Reg with MA/EMA/DEMA and shows limited additional benefit from decomposition. Table2's patch-only variant (w/o DD) also matches or improves on Table3's decomposition variants on their shared datasets. These results establish raw patches as an effective forecasting basis.
With this basis established, we explicitly model how local trajectories evolve. Two rising trajectories, for example, exhibit different evolution patterns when their increments grow versus shrink. Patch-State summarizes local trajectory structure, while increment magnitude and evolution provide a complementary description of change.
We therefore propose PaDNet's Patch-State and Delta-Dynamics formulation: retain local trajectory structure through Patch-State and explicitly represent successive increments and their cross-step evolution through Delta-Dynamics. Table2's full-model versus w/o DD comparison supports the forecasting benefit of this complementary design. The comparison with ordinary differences is given in Q2.
For Q2. We retain both branches, first-order differences, prediction heads and task defaults, removing only the three evolution-state offsets. The remaining a*delta+b can be absorbed into the next linear layer, yielding an ordinary-difference control with nearly identical capacity. ETTm1 results are MSE/MAE:
PaDNet lowers both errors at all four horizons in this comparison.
Reg is the original raw/raw two-branch control. We evaluated PaDNet and Reg on ETTh1-H96 using seeds 2026/2027/2028. Results are MSE/MAE; SD is sample standard deviation:
PaDNet maintains lower MSE and MAE than Reg across all three seeds in this setting, with smaller observed variability.
For Q3. Our low-rank projection is a compact encoding trained for forecasting. We test structure retention and predictive utility separately.
First, we freeze the projection and fit linear readouts from an orthonormal basis of its rowspace to recover input-patch slopes and Fourier coefficients. Readouts use training data, validation selects regularization, and recovery is evaluated on test patches. Frequencies are selected on training data only. R2 measures recovery quality (1 is perfect); cosine/sine refer to Fourier bin1 in 16-step patches:
These results show that local trends and oscillations remain decodable after compression.
Second, we replace low-rank encoding with a dense encoder of similar encoder parameter count, keeping the prediction-head architecture unchanged. Encoder width/convolution geometry change and three encoder layers are reinitialized. Forecasting results on ETTm2 and Exchange are MSE/MAE:
The probes measure retained local structure; the matched comparison shows forecasting gains at similar capacity. Together, they support a compact representation trained for forecasting.
For presentation. We will reduce repetitive and abstract wording, clarify the motivation and technical distinctions, and simplify crowded figures with larger labels and fonts.