acceptodds
Under review as a conference paper at ICLR 2027

Do We Still Need Trend Decomposition? Patch-State and Delta-Dynamics Modeling for Time Series Forecasting

Abstract

Time-series forecasting uses trends in historical observations to inform the extrapolation of future trajectories. Decomposition-based forecasting organizes this process around trend and seasonal components, separating sustained changes from recurrent fluctuations and learning their temporal dependencies separately. This component-wise modeling paradigm also extends to patch-based forecasting, where consecutive observations are encoded as local trajectory tokens. However, we find that raw patches already preserve the local tendencies and recurring patterns targeted by decomposition, revealing substantial overlap in their representational roles. Moreover, similar local tendencies and shapes do not uniquely determine the magnitude and evolution of successive changes, motivating explicit modeling of transition dynamics alongside trajectory structure. We therefore introduce a state–dynamics forecasting paradigm and instantiate it as the Patch-State and Delta-Dynamics Network (PaDNet). Delta-Dynamics explicitly represents the direction and magnitude of adjacent changes and compares increments across steps to characterize their evolution. In parallel, Patch-State regularizes trajectory encoding to capture the overall temporal tendency and structure of local trajectories. Together, these representations condition forecasting on both local trajectory states and their transition dynamics. Extensive experiments on time-series datasets demonstrate the effectiveness of PaDNet, achieving average reductions of up to 7.3% in MSE and 5.1% in MAE over the best-performing state-of-the-art baseline.

Primary area:
learning on time series and dynamical systems
Keywords:
Time Series Forecasting, Trend Decomposition, Temporal Dynamics

Reviews

Among:
Shape:
1234this paper, Top 49%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.33 over 3 reviews, above 51% of the others.
Reviewer_nziLOpenReview ↗
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
  1. 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?
  2. 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?
  3. 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 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).

DatasetrCCCDA%Contrast R/S
ETTm10.93260.927886.250.3381/0.2215
ETTm20.89000.874183.370.2797/0.2021
Electricity0.90110.880282.260.8000/0.8120
PEMS080.96540.963590.230.3257/0.1589
Solar0.96400.962591.860.7025/0.4459

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:

HWithout evolution routingPaDNet
960.3169/0.35650.3163/0.3561
1920.3542/0.37940.3537/0.3791
3360.3867/0.40150.3833/0.4006
7200.4485/0.43940.4480/0.4389

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:

SeedRegPaDNet
20260.3793/0.40040.3726/0.3948
20270.3752/0.39860.3709/0.3943
20280.3745/0.39780.3744/0.3961
SD0.0026/0.00140.0018/0.0009

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:

Dataset/HRankSlope R2Cosine R2Sine R2
Electricity/9660.99640.99160.9959
ETTm1/72080.99820.98980.9956
Solar/72060.99570.94320.9967

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:

DatasetHMatched dense encoderPaDNet
ETTm2960.1748/0.25830.1737/0.2571
ETTm21920.2407/0.30250.2394/0.3005
ETTm23360.2992/0.33940.2988/0.3386
ETTm27200.3969/0.39660.3953/0.3952
Exchange960.0791/0.19610.0787/0.1952
Exchange1920.1752/0.29650.1729/0.2949
Exchange3360.3359/0.41990.3191/0.4074
Exchange7200.9164/0.71960.8394/0.6881

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.

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.

Reviewer_27tKOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper revisits the necessity of explicit trend–seasonal decomposition in patch-based time series forecasting. Motivated by the observation that raw patches already preserve substantial local trend and periodic information, the authors propose the PaDNet. The model employs two branches to capture local trajectory structures and successive transition dynamics, producing horizon-wise predictions that are combined through linear fusion. The paper provides a theoretical analysis of the predictive expressiveness of raw patches and decomposed representations, along with conditions under which additional dynamics information can reduce prediction risk. Experiments on ten multivariate time series datasets evaluate the proposed method through comparisons with existing forecasting models, component ablations, and alternative decomposition schemes.

Critical strengths

1.Meaningful research motivation and modeling perspective. The paper revisits the necessity of explicit trend–seasonal decomposition in patch-based forecasting and examines the representational overlap between raw patches and decomposed components. The proposed state–dynamics formulation provides a coherent alternative by jointly modeling local trajectory structures and successive changes. This perspective is valuable for reassessing the role of decomposition and exploring complementary temporal representations. 2.Broad empirical evaluation and competitive forecasting performance. The paper evaluates PaDNet on ten multivariate time series datasets and includes component ablations and comparisons with alternative decomposition schemes. The reported results demonstrate competitive performance across diverse forecasting settings, with particularly notable improvements on PEMS datasets. These experiments provide empirical support for the proposed modeling approach and strengthen its practical relevance.

Critical weaknesses
  1. Limited methodological novelty and insufficient theoretical support. The proposed framework combines low-rank patch projection, first-order differencing, threshold-based state routing, and linear prediction fusion. The theoretical analysis establishes the equivalence of raw patches and decomposed representations in affine predictive expressiveness under specific assumptions and characterizes the conditions under which additional predictive information can reduce prediction risk. These results do not establish the distinctive advantages of Delta-Evolution Routing over simpler difference-based representations. The connection between the theoretical findings and the specific architectural choices remains insufficiently justified, limiting the strength of the claimed methodological contribution.
  2. Insufficient experimental evidence to validate the proposed mechanisms. Although the evaluation includes several recent patch-based forecasting methods and alternative decomposition schemes, the experimental analysis does not sufficiently isolate the contributions of the proposed mechanisms. The component ablations mainly examine the removal of the Delta-Dynamics branch and the Patch-State constraint, without independently evaluating Delta-Evolution Routing against simpler difference-based representations under comparable model capacity. Moreover, the main text does not report multi-seed statistical results, making it difficult to assess the robustness of relatively small performance improvements on several datasets. These limitations weaken the empirical evidence supporting the necessity and effectiveness of the proposed architectural designs.
Questions for authors
  1. How do the theoretical results in Section 3 justify the specific architectural designs of PaDNet?
  2. Does Delta-Evolution Routing provide consistent improvements over simple first-order differencing under comparable model capacity?
  3. Can the authors extend the evaluation to representative datasets such as Weather and Traffic, and include comparisons with recent decomposition-based and patch-based forecasting methods under consistent experimental settings?
  4. Given that the method is patch-based, how do the authors demonstrate that the information contained in the patches is useful for future forecasting and verify its contribution to the method’s performance gains?
1 comment

Thank you for your constructive review. We will revise the manuscript accordingly. Our responses follow.

Unless otherwise stated, table entries are MSE/MAE.

For Q1. Section 3 supports two central architectural choices: modeling raw patches directly and combining state and dynamics at the prediction level.

First, Proposition D.2 establishes equivalent predictive expressiveness between raw patches and losslessly reconstructable decomposed components under complete patch coverage, fixed linear decomposition and unrestricted affine predictors. This supports raw patches as the representation basis. Table3's decomposition controls evaluate this choice through forecasting performance.

Second, Theorem D.4 shows that, for fixed branch responses, optimal affine fusion reduces prediction risk when residual dynamics correlates with the state-only prediction error. This motivates explicitly representing successive changes alongside local trajectory states and combining their predictions. Complementarity is relative to the encoded state response.

The specific low-rank encoding and three-state routing are assessed experimentally: Q2 isolates routing while retaining ordinary differences at nearly identical capacity; Q4 tests the patch code's future predictive usefulness and the constrained projection's contribution within PaDNet. We will clarify how these experiments validate the design choices motivated by the theory.

For Q2. On ETTm1, evolution routing improves both metrics over ordinary differences at all four horizons under nearly identical capacity. We retain both branches, first-order differences, prediction heads and task defaults, removing only the three evolution-state offsets. The remaining affine transformation of the differences can be absorbed into the next linear layer:

HWithout evolution routingPaDNet
960.3169/0.35650.3163/0.3561
1920.3542/0.37940.3537/0.3791
3360.3867/0.40150.3833/0.4006
7200.4485/0.43940.4480/0.4389

This isolates the benefit of routing while retaining the difference branch.

To assess robustness, we compare PaDNet with the original raw/raw two-branch Reg control on ETTh1-H96 using seeds 2026/2027/2028. SD denotes sample standard deviation:

SeedRegPaDNet
20260.3793/0.40040.3726/0.3948
20270.3752/0.39860.3709/0.3943
20280.3745/0.39780.3744/0.3961
SD0.0026/0.00140.0018/0.0009

PaDNet maintains lower MSE and MAE across these seeds, with smaller observed variability.

For Q3. We extended the evaluation to Weather and Traffic, comparing PaDNet with PatchMLP (patch-based) and xPatch (patch-based with explicit decomposition):

DatasetHPatchMLPxPatchPaDNet
Traffic960.4138/0.30310.3854/0.27150.3736/0.2598
Traffic1920.4287/0.30920.4044/0.27990.3956/0.2719
Traffic3360.4400/0.32000.4168/0.28480.4109/0.2796
Traffic7200.4787/0.33930.4491/0.30420.4438/0.2946
Weather960.1597/0.20710.1634/0.20780.1620/0.2077
Weather1920.2080/0.25110.2096/0.24980.2079/0.2496
Weather3360.2652/0.29340.2644/0.29010.2634/0.2893
Weather7200.3457/0.34570.3441/0.34330.3428/0.3421

PaDNet achieves lower MSE and MAE than both baselines at all four Traffic horizons and at Weather horizons 192/336/720.

For Q4. We verify future predictive usefulness with a frozen-representation forecast probe and assess the contribution to full-model accuracy through a component ablation.

We freeze the learned projection and fit a linear ridge probe from its row-space coordinates, concatenated across patches in temporal order, to future H-step targets. Training data fit the probe; validation selects regularization before testing. A training-fitted H-intercept reference uses no patch code but retains identical history-based normalization and inversion. Test results use the train-standardized dataset scale:

DatasetHNo-code referenceFrozen patch-code probe
Electricity960.8337/0.75320.2057/0.3107
Electricity7200.8829/0.76290.2577/0.3449
Solar960.7920/0.71310.2539/0.2887
Solar7200.7683/0.69280.3024/0.3160
PEMS03120.8276/0.78060.0848/0.1816
PEMS03961.0087/0.86640.2078/0.2792

The patch code improves future prediction beyond the retained history statistics in these settings.

For full-model contribution, Table2/Fig.6 compare PaDNet with w/o PSC, which replaces the constrained patch projection with a standard linear projection. Fig.6 reports ETTm1 MAE:

Hw/o PSCPaDNet
960.36220.3561
1920.37950.3791
3360.40370.4006
7200.44240.4389

The future probes establish predictive usefulness, while the component comparison supports the forecasting contribution of the patch-state design.

We will incorporate these results and clarify the theoretical scope, experimental descriptions and manuscript wording.

Reviewer_m3PZOpenReview ↗
Rating
3(+1)
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

The core question addressed in this paper can be summarized in a single sentence: When using "patches" (segmented input sequences), do time-series forecasting models still require explicit trend/seasonal decomposition? The authors argue that they do not, positing that the original patches already inherently contain trend and periodic information. Figure 1 and Appendix E.2 provide a quantitative analysis: the slope consistency between "trend patches" and original patches reaches nearly 90%, while "seasonal patches" (with the trend removed) show no significant improvement in periodic contrast compared to the original patches. Based on this observation, the authors propose PaDNet, which consists of two branches: a "Patch-State" branch that compresses patches into trajectory representations via low-rank projection, and a "Delta-Dynamics" branch that analyzes first-order differences categorizing each position into "rising," "stable," or "falling" states based on the magnitude of change and encodes them accordingly. The outputs from both branches are combined through a linear fusion layer. Theoretically, the authors establish two conclusions: first, that full patches and their linearly decomposed components possess equivalent expressive power under the class of affine predictors; and second, that provided the branch responses remain fixed, the "delta" branch can strictly reduce overall risk as long as it captures components not already explained by the "state" residuals. Experiments across 10 datasets benchmarked against 8 models, including DLinear, PatchTST, and XPatch that show an average 7.3% reduction in MSE on the PEMS07 dataset. The paper also includes ablation studies, an analysis of patch-length sensitivity, an evaluation of the method’s portability to XPatch, and an efficiency analysis.

Critical strengths

1-The logical progression is sound: the authors present data, draw conclusions, and then propose a method. Figure 1 serves a substantive purpose rather than being merely decorative. Appendix E.2 provides a detailed breakdown of the calculations for slope consistency and periodic contrast, a level of rigor superior to many papers that merely make bold claims in their introductions. The method itself is straightforward. The "delta routing" mechanism essentially boils down to normalized differential ratios, threshold-based ternary classification, and learnable offsets; the low-rank projection is simply a form of matrix factorization. The architecture is not overly complex, making it easy to reproduce. As shown in Figure 10, the model is efficient in terms of both parameter count and FLOPs, while achieving superior accuracy.

2-The theoretical section avoids overpromising. The assumptions for Proposition D.2 and Theorem D.4 are explicitly stated, and D.5 further clarifies that these conclusions do not necessarily apply to deep models trained end-to-end. This practice of clearly defining the scope is commendable unlike many papers that claim "theoretical guarantees" while relying on assumptions that do not align with the actual models used.

3-The experimental evaluation is quite comprehensive: it includes comparisons of decomposition variants (Reg vs. MA/EMA/DEMA), replications using the XPatch framework, full results across various horizons, and training dynamics curves. The fact that "Reg" outperforms "EMA" within the XPatch framework suggests that the observation that "gains from decomposition are limited"—is not merely an artifact of the authors' own specific architecture.

Critical weaknesses

1-The empirical evidence for the core argument is too narrow. The entire claim that "decomposition is useless" rests on a single variable from the ETTh1 dataset, with fixed EMA parameters and periodicity assumptions. ETTh1 is a rather unique dataset; relying on a single variable and a single experimental setup to support such a broad claim is unconvincing. At the very least, the analysis should have been repeated on datasets like ETTm, Electricity, and PEMS before drawing such conclusions. The main results table also reveals inconsistent performance: ETTm1 underperforms compared to DeformTST, ETTm2 lags behind SST, PEMS04 shows a slightly higher MSE than PatchMLP, and DLinear performs significantly better on the Exchange dataset at a 720-step horizon. Furthermore, the "average reductions of up to 7.3%" mentioned in the abstract actually pertain only to the PEMS07 dataset; this phrasing is potentially misleading and should be revised.

2- The theoretical conclusions are somewhat trivial. When full patches cover the entire input sequence, and the original sequence can be reconstructed from the trend and residual components, a linear predictor absent any additional constraints is mathematically equivalent to one operating on the raw data; this is essentially a matter of definition. The truly interesting question where the practical gains from such representations actually originate (e.g., inductive bias, optimization dynamics, or regularization effects) remains unanswered. Additionally, the condition for strict improvement in Theorem D.4 (C≠0C \neq 0) is never empirically verified; even a simple correlation check would have been helpful.

3-The ablation studies fail to clearly identify the source of the observed performance gains. The two ablation studies provided "w/o DD" and "w/o PSC" that only demonstrate that "retaining both components is better than removing one." They fail to address more granular questions: Does the performance gain stem from the original differential formulation itself, or from the three-state routing mechanism? Furthermore, would representing the evolutionary delta as a continuous value rather than discretizing it into three distinct categories yield similar results? The benefits of low-rank projection are also not disentangled from the capacity gains that would naturally arise from adding a parallel branch; thus, it remains unclear whether the model has truly learned "trajectory states" or simply gained additional representational capacity.

4-There is no sensitivity analysis for key hyperparameters. Parameters kk, τ\tau, and rr are the core "knobs" of this method, yet the main text only provides default values ​​(k=4,τ=0.1,r=6k=4, \tau=0.1, r=6), and Table 7 only explores the patch length. Readers have no way to determine how much of the performance improvement on the PEMS dataset is merely a result of tuning these three parameters; at the very least, a sensitivity table or a heatmap for kk and τ\tau should be included.

5-There are also issues regarding statistical rigor and manuscript presentation. All experiments rely on a single random seed (seed=42), and since the performance gaps in the main tables are generally on the order of 10−310^{-3} without any reported mean or variance—it is impossible to distinguish between genuine improvements and stochastic training fluctuations. Several mathematical expressions contain formatting errors (e.g., gradient symbols near Eq. 71, and the CCC formula in Appendix E.2). Additionally, the color-coding (red/blue) used to denote optimal results in Table 1 cannot be verified in the text-only version. Finally, when discussing theoretical conclusions in Section 3, the scope of applicability is not sufficiently emphasized; this could lead readers to mistakenly assume that Proposition D.2 applies directly to deep, non-linear models like XPatch. It is recommended to explicitly clarify the scope of these claims within the main text.

Questions for authors

Refer to Critical Weaknesses

2 comments

Thank you for your constructive review. We will revise the manuscript accordingly. Our responses follow.

For W1. We examined trend alignment and periodic contrast on the following datasets, alongside forecasting controls (§5.3.2/Table3), to assess predictive performance. Channel-1 training diagnostics use period-covering histories: r/CCC measure raw-trend slope agreement; DA is direction agreement (%); contrast compares periodic/non-periodic similarity (raw/seasonal).

DatasetrCCCDA%Contrast R/S
ETTm10.93260.927886.250.3381/0.2215
ETTm20.89000.874183.370.2797/0.2021
Electricity0.90110.880282.260.8000/0.8120
PEMS030.96450.963889.920.3461/0.1776
PEMS040.95130.949087.310.2150/0.0691
PEMS080.96540.963590.230.3257/0.1589
Solar0.96400.962591.860.7025/0.4459

Together with Table3's forecasting controls, these findings identify a common issue across the tested datasets: substantial overlap between raw patches and decomposed representations. This motivates modeling patch states and complementary dynamics directly from raw patches.

For W2. Affine equivalence concerns expressiveness, not optimization/regularization. D.4 is conditional on fixed responses. After fitting residualizers on validation responses, we estimated C=E[e*v_perp^T] on held-out responses. At H96, RMS entries of C_ij/sqrt(E[e_i^2]E[v_perp_j^2]) are 0.0523 (ETTh1) and 0.0509 (ETTm1). These are empirical associations, not proof of the population condition. Separately, train-fitted, validation-selected ridge fusion yields favorable predictive gains in a range of tested settings, supporting complementary forecasting information.

For W3. We tested four controls: remove evolution routing but retain both branches and first-order differences; replace discrete offsets with continuous evolution; widen the patch-only predictor to nearly match total parameters; replace low-rank encoding with a dense encoder while matching encoder parameters and keeping the prediction-head architecture unchanged. Task defaults are unchanged. The dense control changes encoder width/convolution geometry and reinitializes three encoder layers. Results are MSE/MAE.

ETTm1:

HWithout evolution routingPaDNet
960.3169/0.35650.3163/0.3561
1920.3542/0.37940.3537/0.3791
3360.3867/0.40150.3833/0.4006
7200.4485/0.43940.4480/0.4389

Exchange:

HContinuous evolutionWidened patch-onlyMatched dense encoderPaDNet
960.0787/0.19520.0800/0.19580.0791/0.19610.0787/0.1952
1920.1729/0.29490.1740/0.29520.1752/0.29650.1729/0.2949
3360.3191/0.40740.3427/0.42250.3359/0.41990.3191/0.4074
7200.8403/0.68840.8599/0.69540.9164/0.71960.8394/0.6881

ETTm2:

HMatched dense encoderPaDNet
960.1748/0.25830.1737/0.2571
1920.2407/0.30250.2394/0.3005
3360.2992/0.33940.2988/0.3386
7200.3969/0.39660.3953/0.3952

In these comparisons, PaDNet's performance supports the effectiveness of evolution routing and low-rank patch encoding.

For W4. We varied one hyperparameter at a time on ETTh1-96, Electricity-96 and PEMS07-12. Results are MSE/MAE.

ParameterValueETTh1-96Electricity-96PEMS07-12
k10.3710/0.39520.1302/0.22630.0511/0.1449
k20.3709/0.39500.1302/0.22630.0511/0.1449
k40.3707/0.39480.1302/0.22630.0511/0.1449
k80.3711/0.39520.1302/0.22630.0511/0.1449
tau00.3707/0.39490.1302/0.22630.0511/0.1449
tau0.050.3707/0.39480.1302/0.22630.0511/0.1449
tau0.10.3707/0.39480.1302/0.22630.0511/0.1449
tau0.20.3707/0.39480.1302/0.22630.0511/0.1449
r20.3750/0.39690.1316/0.22720.0522/0.1466
r40.3733/0.39600.1306/0.22660.0514/0.1452
r60.3707/0.39480.1302/0.22630.0511/0.1449
r80.3707/0.39420.1303/0.22590.0515/0.1454

The small variations in MSE and MAE indicate robustness to the tested choices of k, tau and r across these datasets.

For W5. We ran PaDNet with seeds 2026/2027/2028 on all 40 tasks and repeated Reg/MA/EMA/DEMA on ETTh1/ETTm1. Below are ETTh1-H96 results (MSE/MAE); SD is the sample standard deviation:

SeedRegPaDNet
20260.3793/0.40040.3726/0.3948
20270.3752/0.39860.3709/0.3943
20280.3745/0.39780.3744/0.3961
SD0.0026/0.00140.0018/0.0009

Across all three seeds in this setting, PaDNet maintains favorable forecasting performance: both MSE and MAE remain below Reg, with smaller observed variability.

Additional learning-rate results on PEMS07-H12:

Learning rateMSEMAE
1e-50.05400.1502
1e-40.05110.1449
1e-30.05200.1470

The learning-rate sweep shows modest performance variation across the tested range.

For writing and formatting. We will improve wording, fix mathematical notation and formula formatting, and identify best/second-best results beyond color alone. We will clarify theoretical assumptions, applicability, and the scope and averaging of improvements in the abstract.

Reviewer_m3PZOpenReview ↗

Reply

Thank you for your response and the additional experiments. Most issues have been addressed, and the score has been raised from 2 to 3. Points W2 and W4 are resolved.

Regarding the others:

W1: The diagnostic analysis on the 7 datasets is helpful; however, please provide a comparison of predictions between the "Reg" (regression) component and the MA/EMA/DEMA-based approaches, averaged across three random seeds. Additionally, does the figure "up to 7.3%" mentioned in the abstract come solely from the PEMS07 dataset?

W3: For the ETTm1, Electricity, and PEMS07 datasets, varying hyperparameters such as kk and τ\tau appear to have little impact on the results. Does this suggest that the three-state routing mechanism plays a negligible role? Are the differential branches and low-rank encoding the actual drivers of performance? If so, the descriptions in the paper concerning the routing mechanism should be rephrased.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.