acceptodds
Under review as a conference paper at ICLR 2027

When Correlation Is Not Enough: Utility-Driven Variable Routing for Time Series Forecasting

12 views

Abstract

Multivariate time-series forecasting commonly models variable dependencies through statistical correlations. However, correlation does not necessarily translate into predictive gains, and fixed relationships cannot readily adapt to changing system states. To address these limitations, we propose TimeSpur, a time-dependent sparse predictive-utility routing framework. TimeSpur first establishes a stable independent forecasting basis from each variable’s own history and then constructs a sparse directed candidate graph using lagged relationships estimated from the training data. During training, paired stochastic masking measures the conditional predictive utility of a source variable for all targets against the observed future and uses this signal to calibrate a state-aware router. The model activates only candidate edges with positive utility under the current state and incorporates the resulting cross-variable information into the base prediction as a sparse residual. A single masking operation provides supervision from one source to all targets, avoiding exhaustive variable-wise evaluation in high-dimensional data. At inference, TimeSpur relies solely on the observed history, requiring neither masking nor future observations. Experiments on eight benchmark datasets demonstrate that TimeSpur achieves stable and competitive forecasting performance while controlling computational overhead.

Primary area:
learning on time series and dynamical systems
Keywords:
Multivariate time series forecasting, State dependencies, Channel dependencies

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_BA7YOpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

TimeSpur reframes cross-variable dependency modeling in multivariate time-series forecasting as a predictive-utility routing problem rather than a correlation-discovery problem. It has four parts: (i) an independent per-variable forecasting branch (instance normalization, moving-average decomposition, low-rank variable-specific modulation) that produces a base forecast P0 and a state encoding H; (ii) an offline directed candidate graph built once from the training split via Top-K one-step lagged correlation; (iii) paired stochastic masking, where one sampled source variable per instance is removed and the resulting error increase (measured against the observed future) yields edge-level utility supervision u*; and (iv) a state-conditioned utility router that scores candidate edges from observed history only, binary-gates positive-utility edges, and aggregates their states into a sparse residual Δs. At inference only history is used (no masking, no future). Experiments on 8 benchmarks report "best in 11/16" dataset-metric comparisons, an efficiency study (0.17M params), ablations, routing case studies, and a 3-seed robustness check.

Critical strengths
  1. Novel, well-motivated framing. Separating dependency discovery (cheap correlation candidates) from dependency validation (outcome-grounded utility) is conceptually clean, and the paired-masking trick obtains supervision of one source against all targets from a single extra forward pass, avoiding O(C) masking. This is the paper's most consequential idea and the basis for its appeal.
  2. Strong efficiency with honest analysis. 0.17M parameters, lowest-class latency/memory, a controlled accuracy-vs-sparsity trade-off, and candid limitations/appendix diagnostics (including acknowledging noisy utility labels). This raises confidence and broadens practical applicability.
Critical weaknesses
  1. Marginal, weakly-established empirical gains. Improvements over the strongest baseline are tiny and close to seed variance: ETTm2 Avg MSE 0.258 vs XLinear 0.259 (effectively a tie), ETTh2 0.342 vs 0.349, Weather 0.222 vs 0.225; TimeSpur actually loses on Traffic and ETTm1. Main Table 1 reports no seed variance, and the significance test (Appendix I) is only against XLinear on 4 of 8 datasets. The ablation margins are similarly small (ETTm1 full 0.291 vs Independent 0.297), and notably "Dynamic w/o Utility" (0.298) is no better than no routing at all — undercutting the claim that the mechanism is essential.
  2. The central premise is not convincingly evidenced. Utility labels are noisy single-window counterfactuals: Appendix Table 6 shows active edges have positive measured utility only 52.3% of the time, with ~1e-4 magnitude. Since the router is trained on exactly this signal, the claim that it "activates only edges with positive predictive gain" is not demonstrated at the edge level. Combined with the one-step linear candidate graph, fidelity to the stated goal is uncertain.
Questions for authors
  1. Protocol: were all ten baselines retrained under the same L=320 look-back, splits, and tuning, or copied from their original papers? This directly affects fairness of all comparisons.
  2. Please reconcile the Table 1 vs Table 4 discrepancies (ETTm1 MSE avg; Weather MAE avg).
  3. Can you report seed standard deviations for the main Table 1 results, and a significance test against all baselines (not only XLinear)?
  4. Given Table 6 (52.3% precision, near-zero magnitudes), in what sense is the gate better than chance per edge, as opposed to only at the group level?
  5. Why is "Dynamic w/o Utility" worse than "Independent" on ETTm1? Does the router destabilize when masking supervision is removed?
5 comments

Response to W1: We sincerely thank the reviewer for these valuable comments. To address the concerns regarding limited performance improvements and variability across random seeds, we conducted additional experiments using three random seeds and five competitive baselines. The complete results, including the mean, standard deviation, and statistical analysis, are provided in Appendix I (Robustness across Random Seeds) of the revised manuscript. Regarding the ablation results, we have further clarified why Dynamic w/o Utility may underperform Independent. Please refer to our detailed responses to Q3 and Q5 for the additional experimental evidence and explanations.

Response to W2: We sincerely thank the reviewer for this important and insightful comment. We agree that the results in Table 6 require a more careful interpretation, particularly regarding the relationship between masking-based utility supervision and the actual predictive contributions of activated edges.

We would like to clarify the objective of utility-based routing. The utility estimator is designed to learn the expected predictive contribution of candidate relationships from historical observations, rather than perfectly predict the sign of the realized utility for every individual test window. Since utility targets are obtained through paired masking on individual windows, they may be affected by sample-specific fluctuations. Consequently, even when a relationship has positive estimated utility, its realized contribution may still be negative on certain unseen windows. Table 6 provides evidence of group-level utility discrimination, although it does not establish perfect edge-level selection. Specifically, 52.33% of activated edge instances exhibit positive measured utility, compared with only 26.53% of suppressed instances, representing a difference of 25.80 percentage points. Furthermore, the mean measured utility of activated edges is +1.43 × 10⁻⁴, whereas that of suppressed edges is −4.08 × 10⁻⁴. These results suggest that the learned routing decisions are associated with differences in measured predictive utility, although individual decisions do not always agree with the signs of their realized utilities. We acknowledge that 52.33% positive-utility precision is insufficient to support the stronger claim that every activated relationship provides a positive forecasting gain. We have therefore refined the corresponding discussion to distinguish selection based on expected utility from guaranteed positive realized utility at the individual-edge level. Regarding the candidate graph**, lagged correlation is employed as an efficient prior for identifying potentially informative temporal relationships, rather than as a direct estimate of predictive utility. The subsequent utility-based routing mechanism evaluates these candidates according to the current historical state. Therefore, candidate construction and dynamic activation serve different purposes:

  • Candidate Construction: Restricts the interaction space by identifying potentially informative relationships.
  • Dynamic Activation: Learns which candidate relationships are more likely to provide predictive benefits under the current historical state. Importantly, we do not claim that a correlation-based candidate graph guarantees the identification of all useful dependencies. Instead, our design combines a computationally manageable candidate space with learned, state-dependent utility estimation.

In summary, we acknowledge that the current diagnostic results support a more limited conclusion than perfect edge-level utility identification. The results demonstrate a directional association between routing decisions and measured utility at the group level, while the effectiveness of the overall mechanism is evaluated through forecasting performance and ablation experiments. We have clarified this distinction and revised the corresponding statements to avoid overstating the precision of individual routing decisions. We sincerely appreciate the reviewer's constructive criticism, which has helped us present the motivation, empirical evidence, and limitations of the proposed mechanism more accurately.

Response to Q1: We sincerely thank the reviewer for raising this important concern regarding experimental fairness. We would like to clarify that all baseline comparisons follow consistent experimental settings, including the same input sequence length (L = 320), dataset splits, and data preprocessing procedures, to ensure the comparability of the reported results. Regarding the sources of the baseline results: XLinear and EMAformer: We retrained and evaluated these two models using their official implementations under the same experimental settings, with the input sequence length fixed at L = 320. Other baseline models: Their results were adopted from the baseline comparisons reported in TimeMosaic, rather than directly copied from their respective original papers. These results also correspond to an input length of L = 320 and follow consistent dataset splits and preprocessing settings. Furthermore, to improve experimental transparency and reproducibility, we have explicitly clarified the sources of the baseline results and their corresponding experimental settings in Appendix D of the revised manuscript, allowing readers to verify and reproduce the comparisons. We sincerely appreciate the reviewer's valuable suggestion regarding experimental rigor.

Response to Q2: We sincerely thank the reviewer for identifying the inconsistencies between Tables 1 and 4, specifically regarding the average MSE on ETTm1 and the average MAE on Weather. Table 4 contains the latest experimental results, and we inadvertently overlooked updating the corresponding values in Table 1. We have now corrected these values in Table 1 to ensure consistency between the two tables. We apologize for this oversight and greatly appreciate the reviewer's careful examination of our manuscript.

Response to Q3: We sincerely thank the reviewer for this valuable suggestion. We agree that reporting standard deviations across random seeds and extending statistical comparisons beyond XLinear would provide a more comprehensive evaluation of the reliability of our experimental results. To address this concern, considering the limited time available, we selected five representative and competitive baselines: XLinear, EMAformer, PatchMLP, iTransformer, and TimeMixer, for additional multi-seed experiments. We repeated the experiments using three random seeds (2024, 2025, and 2026) across eight benchmark datasets and four prediction horizons (H ∈ {96, 192, 336, 720}), with the input length fixed at L = 320. We report the mean and standard deviation (Mean ± Std) of MSE and MAE for each experimental setting. The complete results are provided in Appendix I (Robustness across Random Seeds) of the revised manuscript. Furthermore, we extended the statistical analysis to all five selected baselines using two-sided paired t-tests, with Holm correction for multiple comparisons. The results demonstrate statistically significant improvements over PatchMLP, iTransformer, and TimeMixer in both MSE and MAE (adjusted p < 0.05). Although the differences compared with EMAformer and XLinear do not reach statistical significance, TimeSpur still achieves lower overall average MSE and MAE than both EMAformer and XLinear. These findings, together with the consistently small standard deviations across random seeds, further support the robustness and effectiveness of TimeSpur. The detailed experimental results and statistical analysis are provided in Appendix I. Overall, the additional experiments demonstrate that TimeSpur maintains low variability across different random seeds while achieving competitive forecasting accuracy. We sincerely appreciate the reviewer's constructive suggestion, which has helped us strengthen the experimental evaluation and improve the transparency of our manuscript.

Response to Q4: We sincerely thank the reviewer for raising this important question. We acknowledge that the 52.33% positive-utility precision indicates that the model does not achieve highly accurate edge-level utility prediction. Nevertheless, compared with random selection, the learned gate exhibits a modest discriminative advantage, achieving a balanced accuracy of approximately 54.47%. Furthermore, the positive-utility rates of activated and suppressed edges differ by 25.80 percentage points. We would like to clarify that utility-based routing aims to favor relationships with higher expected predictive utility, rather than guaranteeing positive realized utility for every activated edge. For further discussion of the utility supervision mechanism and the interpretation of Table 6, please refer to our Response to W2.

Response to Q5: We sincerely thank the reviewer for raising this important question. We would like to clarify that the inferior performance of Dynamic w/o Utility does not necessarily indicate training instability. Instead, it highlights the difficulty of identifying beneficial cross-variable dependencies without explicit utility supervision. The Independent variant relies exclusively on each variable's historical information, thereby avoiding potentially redundant or misleading information from other variables. In contrast, Dynamic w/o Utility introduces additional cross-variable interactions, but its routing decisions are learned only through the final forecasting loss. This indirect supervision makes it more difficult to determine whether an individual dependency actually contributes to improving prediction accuracy. Consequently, the router may activate relationships that introduce redundant information or estimation noise, causing the additional modeling flexibility to yield limited benefits or even slightly worse forecasting performance. Importantly, suboptimal routing decisions should be distinguished from training instability. Removing masking-based utility supervision does not eliminate the training signal, as the router continues to be optimized through the final forecasting loss. To further investigate this concern, we conducted additional training diagnostics across three random seeds. None of the runs exhibited NaN/Inf losses or gradients, and the final-epoch gate-flipping rates of the Dynamic w/o Utility variant ranged from 0.33% to 1.15%. We also observed no evidence of gradient explosion or loss divergence. These results suggest that removing masking supervision does not lead to apparent numerical instability or persistent gate oscillations in our evaluated runs. Therefore, the primary role of masking-based utility supervision is not to guarantee training convergence, but to provide a more direct signal for evaluating the predictive contribution of individual dependencies. By comparing forecasting errors with and without a candidate relationship, it helps the router distinguish beneficial interactions from redundant or potentially harmful ones.

Finally, we would like to once again express our sincere gratitude to the reviewer for the time and effort devoted to evaluating our manuscript, as well as for the valuable comments and constructive suggestions. We have carefully considered each of your concerns and further improved the manuscript through additional theoretical analysis, experimental results, and clarifications. We sincerely hope that our responses have adequately addressed your concerns and that you will reconsider your evaluation of our work. We greatly appreciate your time and thoughtful feedback.

Reviewer_YNBSOpenReview ↗
Rating
2
Confidence
4
Informativeness
1
Presentation
2
Soundness
2
Read review
Paper summary

This paper proposed a method called TimeSpur, which is motivated by observing that correlation between time series does not necessarily help improve forecasting performance. TimeSpur first builds base models on individual time-series history, and then derives directed graphs using estimated lagged relationships between time series.

Critical strengths
  1. The method is well motivated.
  2. Good experimental results compared to SOTA baselines on forecasting performance.
  3. The proposed method is more size efficient, shown in line 428.
  • Good in showing where the baselines are from in Table 1.
Critical weaknesses
  1. Writing can be much improved. See the points in the end.
  2. In Table 2, it shows that Candidate Proposal only gives marginal gain, which renders that part of the model not very useful.
  • Put i-iv in subfigures in Fig. 2 for easy reference.
  • Fontsize is too small in Fig. 1 to be readable.
  • If the batch size variable B is not used, it should be removed. And also B is double used in line 224, which should be avoided.
Questions for authors
  1. Writing can be much improved. See the points in the end.
  2. In Table 2, it shows that Candidate Proposal only gives marginal gain, which renders that part of the model not very useful.
  • Put i-iv in subfigures in Fig. 2 for easy reference.
  • Fontsize is too small in Fig. 1 to be readable.
  • If the batch size variable B is not used, it should be removed. And also B is double used in line 224, which should be avoided.
3 comments

We sincerely thank the reviewer for the time and effort devoted to reviewing our manuscript, as well as for the valuable comments and constructive suggestions. We have carefully considered each of your concerns and revised the manuscript accordingly. Our detailed responses are provided below.

1. Response Regarding the Contribution of Candidate Proposal

We sincerely thank the reviewer for this insightful comment. We agree that the accuracy improvements attributed to Candidate Proposal in Table 2 are relatively modest. However, we would like to clarify that the primary objective of this component is to provide an efficient and informative candidate selection mechanism, rather than directly determining the final predictive dependencies. Lagged correlation captures temporal associations between variables, allowing the model to identify potential source variables whose historical changes are associated with subsequent changes in a target variable. Compared with random candidate selection, this provides a data-driven prior for constructing a more informative candidate set while avoiding exhaustive cross-variable interactions. Importantly, high lagged correlation does not necessarily imply high predictive utility. A strongly correlated variable may provide redundant information, or its predictive contribution may vary across different temporal states, as illustrated in Figure 1. Therefore, TimeSpur explicitly separates candidate construction from dependency activation:

  • Candidate Proposal: Lagged correlation identifies which variable relationships are worth considering.
  • Utility-based Routing: The subsequent routing mechanism determines which relationships are worth activating under the current historical state.

This separation allows TimeSpur to exploit temporal association priors without treating static correlations as universally useful predictive dependencies. The effectiveness of this design is also supported by Table 2. Compared with the Random Candidates variant, the complete model achieves lower MSE across four datasets. These results suggest that lagged-correlation-based candidate selection provides a more informative starting point than random selection.

Furthermore, to evaluate its computational benefits, we have conducted additional candidate pruning experiments, which are presented in Appendix K (Effect of Candidate Pruning). The results demonstrate substantial improvements in computational efficiency:

  • Electricity: Inference latency is reduced by 77.34%, while peak training GPU memory is reduced by 64.81%.
  • Traffic: Inference latency is reduced by 71.23%, while peak training GPU memory is reduced by 63.66%.

These findings highlight the practical value of restricting the candidate interaction space, particularly for high-dimensional multivariate time series. In summary, we emphasize that the primary contribution of Candidate Proposal is to construct an informative and computationally manageable candidate space, while the subsequent utility-based routing mechanism adaptively selects useful dependencies according to the current historical state.

2. Response Regarding Presentation and Notation

We appreciate the reviewer for pointing out the presentation and notation issues. We have carefully addressed each concern in the revised manuscript.

(1) Component numbering in Figure 2.

We have added (i)–(iv) before the titles of the four corresponding modules in Figure 2, ensuring consistency with their descriptions in the main text and figure caption. This revision facilitates identification and cross-referencing of individual components.

(2) Readability of Figure 1.

We have increased the font sizes throughout Figure 1 to improve its readability in the manuscript layout.

(3) Use of the notation BB.

We have removed the unused batch-size symbol BB from the revised manuscript.

Finally, we would like to once again express our sincere gratitude to the reviewer for the time and effort devoted to evaluating our manuscript, as well as for the valuable comments and constructive suggestions. We have carefully considered each of your concerns and further improved the manuscript through additional theoretical analysis, experimental results, and clarifications. We sincerely hope that our responses have adequately addressed your concerns and that you will reconsider your evaluation of our work. We greatly appreciate your time and thoughtful feedback.

I thank authors for the clarification. Since I don't have access to the revised draft, I am leaning towards keeping my original rating.

Table A. Effect of candidate pruning on forecasting accuracy and candidate edges.

DatasetPruningMSE ↓MAE ↓Edges per Target ↓
Solar✓0.1760.239128
Solar×0.1870.248136
Reduction (%)—5.88%3.63%5.88%
Electricity✓0.1300.22564
Electricity×0.1390.234320
Reduction (%)—6.47%3.85%80.00%
Traffic✓0.4090.281256
Traffic×0.4210.294861
Reduction (%)—2.85%4.42%70.27%

Table B. Effect of candidate pruning on computational efficiency.

DatasetPruningInf. Time (ms/batch) ↓Train Time (ms/step) ↓Inf. Mem. (MiB) ↓Train Mem. (MiB) ↓
Solar✓18.23138.5870.80704.16
Solar×19.19142.9871.42739.49
Reduction (%)—5.00%3.08%0.87%4.78%
Electricity✓9.5582.3499.73303.42
Electricity×42.14282.15154.18862.21
Reduction (%)—77.34%70.82%35.32%64.81%
Traffic✓33.21255.49355.331456.90
Traffic×115.421924.92743.174009.32
Reduction (%)—71.23%86.73%52.19%63.66%

Note: ✓ and × indicate enabling and disabling candidate pruning, respectively. Inference latency and training-step time exclude data loading and CPU–GPU transfers. Training-step measurements include paired masking, backpropagation, and parameter updates. GPU memory values represent peak memory consumption.

We investigate the effectiveness of candidate pruning by comparing TimeSpur with an unpruned variant that considers all non-self source variables for each target. Both variants preserve correlation weighting, utility supervision, and dynamic gating, and are evaluated under identical experimental settings. Inference latency and training-step time exclude data loading and CPU--GPU transfers, while training-step measurements include paired masking, backpropagation, and parameter updates. As shown in the two tables above, candidate pruning consistently improves forecasting accuracy while reducing computational overhead across all three datasets. Specifically, it reduces MSE by 3.30%3.30\%, 6.47%6.47\%, and 2.85%2.85\% on Solar, Electricity, and Traffic, respectively, with corresponding MAE reductions of 3.63%3.63\%, 3.85%3.85\%, and 4.42%4.42\%. The efficiency improvements are particularly pronounced on high-dimensional datasets. On Electricity, pruning reduces the number of candidate edges per target from 320320 to 6464, decreasing inference latency by 77.34%77.34\% and peak training memory by 64.81%64.81\%. Similarly, on Traffic, the candidate edges decrease from 861861 to 256256, yielding reductions of 71.23%71.23\% in inference latency, 86.73%86.73\% in training time, and 63.66%63.66\% in peak training memory.

The above tables and analysis are reproduced from Appendix K (Effect of Candidate Pruning) of our revised manuscript. We have included them directly in this response to ensure that the reviewer can access and evaluate the additional experimental evidence.

Regarding the other concerns related to figure readability, formatting, and presentation, we have carefully addressed them in the revised manuscript, including enlarging the figure fonts and improving the corresponding layouts and annotations.

Once again, we sincerely thank the reviewer for their time and constructive feedback. Since several of your comments concerned figure readability, formatting, and presentation, we had hoped to demonstrate our revisions more clearly through an updated PDF. However, we were unaware that the revised manuscript was not accessible to reviewers at this stage, and we sincerely apologize for this misunderstanding. We have therefore presented the supplementary experimental results from Appendix K directly in this response, while also addressing the remaining formatting and presentation issues in the revised manuscript. We hope these clarifications and additional results help address your concerns, and we would be grateful if you could reconsider your evaluation in light of the additional evidence.

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

This paper proposes TimeSpur, a state-dependent sparse utility routing framework for multivariate time-series forecasting. Experiments on eight benchmark datasets demonstrate the effectiveness of the proposed method against representative baselines.

Critical strengths

S1. The paper offers a new perspective that distinguishes superficial correlations from genuine predictive information, which is an interesting and well-motivated direction.

S2. The architecture of the proposed method is clearly illustrated in Figure 2, and the four components are described in a well-organized manner in the Method section.

S3. Extensive experiments are conducted on eight benchmark datasets, and the results consistently support the effectiveness of the proposed method.

Critical weaknesses

W1. No theoretical analysis is provided for either the utility estimation or the dynamic sparse routing mechanism. The authors should offer theoretical justification (e.g., properties of the utility estimator, or the conditions under which the sparse routing preserves predictive information) to substantiate the design.

W2. The font sizes in Figures 3, 4, and 5 are too small to be legible, which hinders the readability of the experimental results.

Questions for authors

Please address the weaknesses in your rebuttal.

1 comment

Response to W1: We sincerely thank the reviewer for this valuable suggestion. We acknowledge that the original manuscript lacked sufficient theoretical justification for the proposed utility estimation and dynamic sparse routing mechanisms. To address this concern, we have added a new theoretical analysis in Appendix L (Theoretical Analysis and Proofs) of the revised manuscript. Specifically, we introduce two propositions with detailed proofs:

  • Proposition 1 (Optimal Utility Estimation): Establishes the statistical properties of the utility estimator under squared-error supervision.
  • Proposition 2 (Sparse Routing Performance Bound): Derives a conditional performance bound for sparse routing and identifies sufficient conditions for preserving forecasting performance, including adequate candidate coverage, accurate utility estimation, and bounded cross-edge interactions.

These theoretical results provide further support for our design and clarify the conditions under which the proposed mechanisms can effectively preserve forecasting performance.

Response to W2: We appreciate the reviewer for pointing out the readability issues in Figures 3, 4, and 5. In response, we have increased the font sizes throughout all three figures, including titles, axis labels, tick labels, legends, and annotations. We have also refined the layouts and spacing to ensure that the enlarged text remains clear and does not overlap with other visual elements. These revisions substantially improve the readability of the figures without altering any of the underlying experimental results.

Finally, we would like to express our sincere gratitude to the reviewer once again for the positive assessment of our work and for the valuable time and effort devoted to reviewing our manuscript. Your encouraging evaluation is greatly appreciated, and your thoughtful comments and constructive suggestions have been instrumental in helping us further improve the quality and presentation of our paper.

We sincerely appreciate your recognition, support, and valuable feedback.

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

Related papers

Loading the map…

Discussion (0)

Sign in to comment.