- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes TVTS, a multivariate time series forecasting framework that jointly models time-varying temporal dynamics and directed cross-variable dependencies. The method consists of a Time-Varying Convolutional Filtering module and a Directed Geometric Clustering module, and combines topology-guided attention with frequency-domain residual prediction to produce the final forecasts.
The authors conduct relatively extensive experiments on long-term, short-term, and several additional forecasting benchmarks, reporting good forecasting accuracy and computational efficiency.
Critical strengths
S1: The motivation of the paper is relatively clear. It considers both time-varying patterns and directional cross-variable dependencies, and the overall framework is relatively complete.
S2: The experimental coverage is relatively broad, including recent competitive baselines, as well as ablation, stability, and computational efficiency analyses.
S3: The model achieves good forecasting performance, particularly showing relatively significant advantages on the PEMS datasets.
Critical weaknesses
W1. The novelty of the core method is incremental.
TVCF mainly implements time-varying filtering through position-dependent coefficients and shared basis expansion, while DGC constructs an asymmetric adjacency matrix through independent source and target embeddings and Top-k selection. These core designs all have corresponding technical foundations in existing research.
W2. The independent benefits of directed dependency modeling are limited, and ablation validation on key high-dimensional datasets is insufficient.
Although Table 4 provides an ablation comparison with bidirectional topology (Dual-A), the performance differences between the two designs are small on most datasets, which is insufficient to fully demonstrate the necessity of directed topology. In addition, the ablation experiments lack results on high-dimensional traffic datasets such as Traffic and PEMS. Considering that directed propagation among traffic sensors is one of the main research motivations of this paper, and that the model achieves relatively significant performance advantages on the PEMS datasets, the existing experiments are insufficient to verify the independent contribution of directed dependency modeling in these scenarios.
W3. Some baseline results are inconsistent with the metrics reported in existing literature, and the experimental configurations and result sources are not sufficiently transparent.
The experimental results of some baseline models differ from the metrics reported in their original papers or official implementations, but the paper does not sufficiently explain the sources of these differences.
W4. The data source and illustrative nature of Figure 1 are unclear.
Figure 1 shows directed propagation paths among traffic sensors, but it does not clearly indicate whether the figure is based on real traffic data and sensor topology or is merely a conceptual illustration used to explain the research motivation. If it is based on real data, the data source and the basis for determining propagation directions should be explained. If it is only an illustration, this should be clearly stated in the figure caption to avoid interpreting hypothetical propagation relationships as empirical observations.
Questions for authors
Q1: Which designs in TVCF and DGC constitute substantive innovations compared with existing methods? Can more direct comparative experiments be provided to verify the independent contributions of these designs?
Q2: How is Dual-A in Table 4 constructed? Why are the performance differences between directed and bidirectional topologies small on most datasets? Can ablation experiments on the Traffic and PEMS datasets be added, including controlled comparisons among directed topology, symmetric topology, and standard full Attention?
Q3: DGC constructs an asymmetric adjacency matrix through two sets of static node embeddings. How do the authors verify that the learned asymmetry corresponds to real directional predictive dependencies, rather than merely increasing the flexibility of relational representations? Can quantitative validation be provided on data with known directional relationships?
Q4: The position-dependent coefficients (C) in TVCF are globally learnable parameters and do not vary with input samples. How do the authors explain the adaptability of this design to non-stationary dynamics across different samples? Compared with standard convolution and directly learning position-dependent convolution kernels, how much additional benefit does structured basis expansion provide? Can corresponding comparative experiments be added?
Q5: For baselines whose reported metrics differ from those in the original papers or official implementations, can the authors explicitly list the result sources, training and evaluation configurations, and specific adjustments made relative to the official settings, and explain the performance differences caused by these adjustments?
Q6: Is Figure 1 drawn based on real traffic sensor data, or is it merely a conceptual illustration? If it is based on real data, how are the propagation paths and directions determined?
6 comments
Q3: Quantitative Validation of Directed Dependencies
Directional validity requires evidence beyond learned asymmetry. Figures 9–11 visualize asymmetric relations, while Appendix J.2.2 and Figure 12 assess their correspondence with Granger-based predictive directions. To further strengthen directional validation, we introduce controlled synthetic systems with known dependencies and complementary real-world experiments with physically grounded reference directions.
Controlled synthetic systems enable quantitative evaluation of directional recovery. We construct 16-variable VAR(1) processes with randomly relabeled chain and branching-tree topologies:
\quad \mathbf{e}(t) \sim \mathcal{N}(0, 0.25\mathbf{I}).$$ Self-couplings and directed cross-variable couplings are set to 0.45 and 0.35, respectively, yielding a spectral radius of 0.45. Innovations are independent across variables and time, and the generating matrix $\mathbf{A}$ specifies the ground-truth directed edges. Table R2 evaluates constructed relation scores using direction agreement (DA), tie rate, AUROC, average precision (AP), and precision at 15 (P@15). AUROC and AP cover all 240 off-diagonal ordered pairs, including 15 true directed edges (6.25% prevalence). **Illustrative asymmetric scores exhibit strong directional correspondence across both structures.** On the chain, DGC-labeled scores achieve 1.00 DA, 0.89 AUROC, 0.53 AP, and 0.73 P@15, outperforming shuffled scores (0.53/0.51/0.07/0.00). On the branching structure, the corresponding results are 0.93/0.86/0.37/0.67 versus 0.60/0.56/0.13/0.13. Symmetric scores show weaker edge-ranking performance, with zero DA reflecting directional ties by construction. These comparisons illustrate how asymmetric representations can encode directional preferences and identify ground-truth edges under different dependency structures. **Synthetic analysis provides a controlled directional evaluation protocol.** The constructed scores demonstrate how directional agreement and edge recovery can be quantified, with P@15 reflecting partial recovery under both structures. Since these illustrative scores are constructed rather than extracted from forecasting-trained DGC, we further assess actual learned relations on real-world data with independently established physical directions. **Table R2.** Illustrative directional recovery on synthetic scores ($L=96$, $H=12$). |System|Method|DA|Ties|AUROC|AP|P@15| |:---|:---|---:|---:|---:|---:|---:| |Chain|DGC (weights)|1.00|0.00|0.89|0.53|0.73| ||DGC (affinity)|0.67|0.00|0.68|0.58|0.67| ||Shuffled weights|0.53|0.00|0.51|0.07|0.00| ||Symmetric (weights)|0.00|1.00|0.84|0.33|0.40| ||Symmetric (affinity)|0.00|1.00|0.79|0.29|0.40| ||OLS|1.00|0.00|1.00|1.00|1.00| |Branching|DGC (weights)|0.93|0.00|0.86|0.37|0.67| ||DGC (affinity)|0.67|0.00|0.60|0.27|0.60| ||Shuffled weights|0.60|0.00|0.56|0.13|0.13| ||Symmetric (weights)|0.00|1.00|0.52|0.06|0.00| ||Symmetric (affinity)|0.00|1.00|0.45|0.07|0.07| ||OLS|1.00|0.00|1.00|1.00|1.00| **Additional Real-World Validation of Directed Dependencies** **Forecasting-trained DGC captures partial alignment with physical directions in real-world river networks.** We further evaluate DGC on CausalRivers [G6], which provides measured river discharge and known upstream-to-downstream directions. Appendix J.4 and Figure 15 present two cases: the Oder watershed (22 gauges, 21 directed edges) and an Elbe flood event (42 gauges, 42 directed edges). TVTS is trained solely with forecasting supervision, using the physical topology only for evaluation. For each reference edge $u\rightarrow v$, its orientation is correctly identified when the learned weights satisfy $W_{vu}>W_{uv}$. **Real-world results provide complementary evidence of directional predictive relevance.** DGC correctly identifies 13/21 reference directions (61.9%) on Oder and 26/42 (61.9%) on Elbe. These findings directly evaluate forecasting-trained relational weights and demonstrate partial correspondence with externally grounded physical directions. Together with the Granger-based analysis, these results support DGC's ability to learn directionally informative predictive relations, while full causal topology recovery remains beyond the scope of this study.Q4: Position Dependence and Structured Basis Expansion
TVCF models position-dependent temporal dynamics through globally shared filters. In Eq. (5), shared coefficients and normalized spectral bases define position-specific filters:
Unlike shift-invariant convolution, TVCF assigns position-specific lag responses to capture recurring within-window dynamics. While is shared across samples, input-dependent normalization and content attention capture sample-specific variations. Together, these mechanisms enable position-dependent modeling and input-adaptive processing.
Random initialization provides a competitive default for shared filter coefficients. We compare context-aware and random initialization of under identical architecture and optimization. Table R3 averages for long-term datasets and for PEMS (). Following the relative ADF statistics in TimeBridge [G7], we highlight ETTh1, ETTh2, ETTm2, and ECL, whose less negative values suggest comparatively stronger non-stationary tendencies under this diagnostic.
Initialization strategies exhibit dataset-dependent effectiveness. Random initialization matches or slightly improves upon context-aware initialization on the highlighted datasets (ECL MSE: 0.157 vs. 0.158; ETTm2: 0.270 vs. 0.271; ETTh2: 0.363 vs. 0.365). A possible explanation is that input-derived initialization introduces transient fluctuations into shared coefficients. Conversely, context-aware initialization achieves modest MSE improvements on PEMS03 (0.119 vs. 0.120), PEMS07 (0.102 vs. 0.103), and PEMS08 (0.144 vs. 0.145), potentially benefiting from recurring temporal patterns. These findings suggest that contextual initialization can provide useful prior information under favorable conditions, while random initialization remains a robust default. The experiment evaluates initialization sensitivity, with small differences requiring further statistical validation.
Table R3. Context-aware versus random initialization of ().
| Dataset | Context-aware MSE | Context-aware MAE | Random (TVTS) MSE | Random (TVTS) MAE |
|---|---|---|---|---|
| ETTh1 | 0.428 | 0.427 | 0.428 | 0.426 |
| ETTh2 | 0.365 | 0.391 | 0.363 | 0.390 |
| ETTm1 | 0.374 | 0.385 | 0.375 | 0.386 |
| ETTm2 | 0.271 | 0.315 | 0.270 | 0.315 |
| Weather | 0.241 | 0.268 | 0.240 | 0.267 |
| Exchange | 0.333 | 0.389 | 0.334 | 0.390 |
| Traffic | 0.429 | 0.277 | 0.428 | 0.277 |
| ECL | 0.158 | 0.249 | 0.157 | 0.249 |
| PEMS03 | 0.119 | 0.226 | 0.120 | 0.226 |
| PEMS04 | 0.112 | 0.215 | 0.112 | 0.215 |
| PEMS07 | 0.102 | 0.204 | 0.103 | 0.203 |
| PEMS08 | 0.144 | 0.229 | 0.145 | 0.229 |
Structured TVCF offers advantages over conventional position-aware filtering. We compare TVCF with a position-shared nonlinear convolutional bank (Static Bank), its positional-gating extension (Gated Bank), and directly learned position-specific real-valued kernels (Direct Taps). All share the backbone, temporal support, normalization, and training budget. Bank widths target comparable filter-parameter budgets, while Direct Taps has fewer parameters. Basis orthogonality regularization applies only to TVCF.
Controlled comparisons demonstrate the benefits of structured TVCF. Table R4 shows that TVCF achieves the lowest averaged MSE and MAE across all 12 datasets. On Traffic, its MSE is 0.428 versus 0.441/0.445/0.443 for Static Bank/Gated Bank/Direct Taps; on ECL, the results are 0.157 versus 0.161/0.162/0.161. These improvements demonstrate the effectiveness of TVCF's structured position-dependent parameterization beyond positional gating or unconstrained kernels. Given differences in parameter capacity and regularization, these comparisons substantiate the overall TVCF design, encompassing spectral structure and regularization.
Table R4. Temporal filtering alternatives within TVTS ().
| Dataset | Static Bank MSE | Static Bank MAE | Gated Bank MSE | Gated Bank MAE | Direct Taps MSE | Direct Taps MAE | TVCF MSE | TVCF MAE |
|---|---|---|---|---|---|---|---|---|
| ETTh1 | 0.434 | 0.430 | 0.447 | 0.436 | 0.435 | 0.430 | 0.428 | 0.426 |
| ETTh2 | 0.366 | 0.394 | 0.368 | 0.395 | 0.367 | 0.393 | 0.363 | 0.390 |
| ETTm1 | 0.379 | 0.389 | 0.380 | 0.389 | 0.378 | 0.389 | 0.375 | 0.386 |
| ETTm2 | 0.274 | 0.319 | 0.275 | 0.318 | 0.274 | 0.318 | 0.270 | 0.315 |
| Weather | 0.245 | 0.268 | 0.247 | 0.270 | 0.246 | 0.269 | 0.240 | 0.267 |
| Exchange | 0.336 | 0.393 | 0.338 | 0.394 | 0.337 | 0.392 | 0.334 | 0.390 |
| Traffic | 0.441 | 0.281 | 0.445 | 0.283 | 0.443 | 0.283 | 0.428 | 0.277 |
| ECL | 0.161 | 0.254 | 0.162 | 0.254 | 0.161 | 0.253 | 0.157 | 0.249 |
| PEMS03 | 0.124 | 0.230 | 0.126 | 0.229 | 0.126 | 0.230 | 0.120 | 0.226 |
| PEMS04 | 0.118 | 0.218 | 0.120 | 0.220 | 0.116 | 0.219 | 0.112 | 0.215 |
| PEMS07 | 0.108 | 0.205 | 0.110 | 0.205 | 0.106 | 0.205 | 0.103 | 0.203 |
| PEMS08 | 0.147 | 0.232 | 0.148 | 0.233 | 0.147 | 0.233 | 0.145 | 0.229 |
We sincerely thank the reviewer for the thoughtful assessment and constructive feedback. We address each concern through methodological clarifications and additional controlled experiments supporting the proposed design.
Q1 / Weakness 1: Methodological Novelty and Component ContributionsThe methodological contribution centers on unified temporal-relational forecasting. TVCF builds upon node-variant graph filtering [G1,G2] and the normalized complex basis parameterization of TV-Rec [G3]. Similarly, source-target embeddings and graph selection have established foundations in Graph WaveNet [G4] and MTGNN [G5]. We acknowledge these connections and will further clarify the technical distinctions and attribution.
TVTS jointly models complementary temporal and relational dependencies for multivariate forecasting. TVCF captures position-dependent temporal dynamics, while DGC learns non-reciprocal predictive relationships across variables. These modules characterize distinct temporal and cross-variable dimensions. TGF incorporates DGC-guided interactions into TVCF-filtered representations, followed by FDRP for spectral residual refinement in multi-step forecasting. Their coordinated design enables the joint characterization of evolving temporal patterns and directional cross-variable interactions within a unified framework.
Controlled experiments substantiate the contributions of the proposed components. We additionally compare temporal-filter alternatives (static convolutional banks, positional gating, and direct position-specific kernels) and graph affinity learners (Graph WaveNet-style and MTGNN-style) under the same TVTS backbone. On ECL, TVCF achieves an MSE of 0.157 versus 0.161–0.162 for temporal alternatives, while DGC achieves 0.157 versus 0.164/0.168 for graph alternatives. Table 4 further shows that removing FDRP, TVCF, or DGC increases ETTm1 MSE from 0.375 to 0.378, 0.380, and 0.378, respectively. Table 20 also reports lower MSE for TVTS (0.375) than DUET (0.390) and BIM$^3$ (0.387). Collectively, these comparisons provide empirical support for the effectiveness of each component and their integration.
Q2 / Weakness 2: Dual-A Construction and Traffic AblationsDual-A adopts DUET-style metric-based relational modeling, distinct from explicit DGC symmetrization. Following DUET, Dual-A computes channel similarities from Fourier magnitudes using a learned Mahalanobis-type distance to construct cross-variable connectivity. (Implementation: https://github.com/decisionintelligence/DUET/blob/main/ts_benchmark/baselines/duet/utils/masked_attention.py.) While the underlying distance is symmetric, subsequent row normalization and mask sampling can produce asymmetric effective interactions. We will clarify this construction and its distinction from DGC. Additionally, a standard "full attention" mechanism is included as a baseline.
Additional traffic ablations demonstrate the predictive advantages of DGC. We extend the comparisons to Traffic and PEMS03/04/07/08 under the same TVTS backbone and training protocol. Table R1 presents single-seed results averaged over H=96,192,336,720 for Traffic and H=12,24,48,96 for PEMS (L=96). TVTS consistently achieves lower MSE and MAE than Dual-A and full attention across all five datasets. Compared with Dual-A, DGC reduces MSE by 11.8%, 14.5%, and 17.6% on PEMS03, PEMS04, and PEMS07, respectively. These improvements are more pronounced than those on several ETT datasets in Table 4, highlighting the value of structured relational modeling in traffic forecasting.
The comparisons highlight the benefits of learned relational modulation and structured affinity modeling. The performance gap relative to full attention demonstrates the predictive utility of incorporating relational information. Dual-A further provides a competitive metric-based relational baseline, differing from DGC in affinity construction and reciprocity assumptions. Accordingly, the observed improvements characterize the effectiveness of the overall relational design. We interpret these single-seed results as additional predictive evidence, while statistical significance and physical directional alignment require complementary validation.
Table R1. Forecasting performance under different relational mechanisms on traffic datasets (L=96).
Due to space constraints in individual response boxes, we will address the remaining questions separately in subsequent responses.