- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces Graph Token Structural Attention (GraphTSA), a token-mixing module for multivariate medical time series. It retains CoTAR-style token-message construction but replaces shared-core broadcast with an input-dependent, directed affinity matrix generated by low-dimensional query and key projections. The method is inserted into TeCh’s temporal and channel branches and evaluated on five EEG/ECG and two HAR classification datasets.
Critical strengths
- The paper is motivated by a meaningful and practically relevant observation. The dual structure of local heterogeneity and global synchronization reflects a genuine characteristic of multivariate medical time series, providing a reasonable and well-motivated foundation for the proposed method.
- The method demonstrates a thoughtful balance between relational expressiveness and model complexity. Constructing input-dependent relational structures through low-dimensional query and key projections is a reasonable design choice, while the analyses of matrix rank, topology.
- The experimental results demonstrate competitive performance against existing methods. The reported results suggest that the proposed approach is a promising alternative to several established baselines, supporting the potential value of modeling input-dependent relationships in multivariate time series.
Critical weaknesses
Weakness 1: The structural motivation relies on established characteristics of medical time series rather than a clearly differentiated methodological contribution.
- Local temporal heterogeneity and cross-channel dependencies are well-recognized characteristics of multivariate medical time series and have motivated a substantial body of research on medical time-series modeling. For example, Medformer (NeurIPS 2024)[1] explicitly models cross-channel correlations and temporal patterns at multiple granularities, while MedMamba (ICML 2026)[2] explores local temporal morphology, multi-view representations, and adaptive graph learning for medical time-series classification. These studies suggest that leveraging local temporal patterns and cross-channel relationships is an established research direction rather than a novel observation introduced by GraphTSA. Therefore, the paper should more clearly distinguish the established structural properties of medical time series from its actual methodological contributions. In particular, the authors should explain what limitations remain in existing approaches that already exploit local temporal patterns and cross-channel dependencies, and demonstrate through controlled comparisons that GraphTSA's adaptive communication mechanism addresses these limitations in a distinct and effective manner. Otherwise, the claimed structural motivation risks overstating the novelty of the work, while the specific advantages of the proposed mechanism over existing alternatives remain insufficiently established.
Weakness 2: The contribution of the proposed communication mechanism is not sufficiently isolated.
- Although GraphTSA outperforms the original TeCh with CoTAR in several settings, the experiments do not adequately establish that the gains specifically result from the proposed adaptive communication mechanism. GraphTSA is structurally close to a single-head scaled dot-product attention layer, yet the paper lacks a parameter-matched attention baseline within the same TeCh architecture and a controlled comparison using conventional value projections. Moreover, GraphTSA introduces an additional internal residual path, whose effect is not adequately controlled in the comparison with CoTAR. More targeted ablations with matched residual strengths and alternative token-mixing mechanisms are needed to isolate the contribution of the proposed design.
Weakness 3: The evidence for the proposed structural motivation and the interpretability of learned communication patterns is insufficiently representative.
- The paper uses selected examples from a few datasets to visualize learned communication topologies and motivate the claim that GraphTSA captures local heterogeneity and global synchronization. However, such qualitative examples are vulnerable to sample-selection effects and do not establish that the observed patterns are representative or consistent across the data distribution. A systematic evaluation across all seven datasets and a substantially larger number of samples is needed to determine whether these communication patterns persist beyond a few illustrative cases. Furthermore, the analysis should include misclassified samples to examine whether the learned affinities remain meaningful when the model fails. Without such evidence, the visualizations provide limited support for the claimed structural motivation and do not establish that the learned communication patterns reflect generalizable properties of multivariate medical time series.
Weakness 4: The interpretation of affinity rank as dataset-dependent communication capacity is insufficiently supported.
- The rank constraint (k) limits the bilinear affinity logits, but it does not directly determine the rank or effective complexity of the post-softmax communication matrix. The claimed relationship between rank sensitivity and data compressibility is based primarily on the contrast between PTB and FLAAP, while PCA compressibility does not directly establish the appropriate rank of learned affinity logits. In addition, the analysis does not disentangle the temporal and channel branches, despite their different token counts and semantics. A more rigorous analysis should clarify the validation-based selection of (k), examine the two branches separately, and evaluate the claimed association across all seven datasets.
Weakness 5: The practical advantage of GraphTSA over competitive CNN/TCN baselines is insufficiently established.
- The paper primarily compares GraphTSA with existing Transformer-based methods, leaving its advantage over competitive convolutional architectures unclear. Notably, the simple HM-BiTCN+CIF combination has already demonstrated strong performance before the ICLR 2027 submission deadline, suggesting that effective medical time-series classification may not necessarily require the more elaborate token-communication mechanism proposed by GraphTSA. Without comparisons against strong CNN/TCN baselines under comparable experimental settings, it remains unclear whether GraphTSA provides meaningful improvements in predictive performance or offers a favorable trade-off between accuracy and computational cost. The authors should include competitive convolutional baselines, particularly HM-BiTCN+CIF [3], and provide a comprehensive comparison of predictive performance and computational efficiency to substantiate the practical necessity and advantages of the proposed architecture.
Reference [1] Medformer: A Multi-Granularity Patching Transformer for Medical Time-Series Classification [2] MedMamba: Multi-View State Space Models with Adaptive Graph Learning for Medical Time Series Classification [3] Channel-Imposed Fusion: A Simple yet Effective Method for Medical Time Series Classification
Questions for authors
Question 1: What is the methodological novelty of GraphTSA beyond established structural properties of medical time series?
Local temporal heterogeneity and cross-channel dependencies have already been extensively studied in medical time-series modeling, including Medformer (NeurIPS 2024) and MedMamba (ICML 2026). What specific limitations of these existing approaches does GraphTSA address? How does the proposed adaptive communication mechanism differ fundamentally from existing methods that already model local temporal patterns and inter-channel relationships? Can the authors provide controlled experiments demonstrating that the proposed mechanism offers a distinct advantage beyond these established design principles?
Question 2: Can the performance gains be specifically attributed to the proposed adaptive communication mechanism?
Given the structural similarity between GraphTSA and single-head scaled dot-product attention, can the authors provide parameter-matched attention baselines within the same TeCh architecture, including comparisons with conventional value projections? Furthermore, how much of the observed improvement comes from the additional internal residual path rather than the proposed communication mechanism itself? Can controlled ablations with matched residual strengths and alternative token-mixing mechanisms isolate the contribution of each design choice?
Question 3: Are the learned communication patterns representative and consistent across the data distribution?
The paper visualizes selected examples from a few datasets to support its claim that GraphTSA captures local heterogeneity and global synchronization. How do the authors establish that these patterns are representative rather than artifacts of sample selection? Can they systematically evaluate communication topologies across all seven datasets and a substantially larger number of samples? In addition, do the learned affinities remain meaningful for misclassified samples, and how do their patterns differ between correctly and incorrectly classified cases?
Question 4: Does the affinity rank reflect dataset-dependent communication capacity, and is this interpretation empirically justified?
The rank constraint limits the bilinear affinity logits but does not directly determine the rank or effective complexity of the post-softmax communication matrix. How do the authors justify the claimed relationship between affinity-rank sensitivity and data compressibility, given that PCA compressibility does not directly determine the appropriate rank of learned affinity logits? Can the authors clarify how is selected using the validation set, analyze the temporal and channel branches separately, and verify this relationship across all seven datasets?
Question 5: Does GraphTSA offer a meaningful practical advantage over competitive CNN/TCN baselines?
The evaluation primarily compares GraphTSA with Transformer-based methods, while the HM-BiTCN+CIF combination has already demonstrated strong performance on medical time-series classification benchmarks. Can the authors include HM-BiTCN+CIF and other competitive CNN/TCN baselines under comparable data splits and evaluation protocols? Does GraphTSA consistently improve predictive performance over these simpler architectures, and do any gains justify its additional architectural complexity and computational cost? Without such comparisons, how can the practical necessity and advantages of the proposed communication mechanism be established?
10 comments
Response to Reviewer FDRQ (Part 2)
Weakness 2 and Question 2: Isolating Adaptive Communication, Attention, and Residual Effects
We thank the reviewer for recognizing GraphTSA's balance between relational expressiveness and model complexity. We agree that the strongest test of this design is not simply outperforming TeCh, but determining whether its gains persist against parameter-matched attention, fixed/shared aggregation, and residual controls. We therefore conducted seven controlled ablations on PTB, directly targeting the proposed alternatives.
-
Controlled protocol. All seven configurations use the same TeCh backbone, fixed subject-independent PTB partition, three channel-token layers, validation-F1 checkpoint selection, and five seeds. GraphTSA uses and logit scaling. Results below are mean ± SD; all six metrics and operator definitions appear in Appendix K.1–K.3, Table 12.
Table 1. Controlled PTB operator and residual ablations.
Configuration Accuracy (%) F1 (%) GraphTSA (full) 89.11 ± 1.16 86.53 ± 1.64 Parameter-matched attention 84.50 ± 2.06 79.79 ± 3.14 Conventional attention 85.88 ± 4.37 81.62 ± 6.55 Fixed learned adjacency 85.11 ± 2.45 80.52 ± 3.96 Normalized uniform aggregation 87.23 ± 2.37 83.79 ± 3.50 GraphTSA without internal residual 85.54 ± 2.97 81.33 ± 4.66 CoTAR-style residual control 84.54 ± 2.13 79.87 ± 3.41 -
Beyond conventional attention and parameter count. With the TeCh backbone held constant, GraphTSA exceeds parameter-matched QKV attention by +4.61 Accuracy and +6.74 F1 points. It also exceeds the conventional-attention replacement by +3.23 and +4.91 points. Both attention alternatives use learned value projections; GraphTSA instead routes CoTAR-derived transformed and reweighted messages through input-dependent affinities. This is direct evidence that the proposed message-construction-plus-routing formulation is useful beyond substituting a generic attention layer. Parameter matching concerns registered model parameters.
-
Why adaptive source selection matters. Holding CoTAR-derived messages in the comparison, replacing sample-dependent affinities with a fixed learned adjacency reduces Accuracy by 4.0 points and F1 by 6.01 points. Replacing them with normalized uniform aggregation reduces Accuracy by 1.88 and F1 by 2.74 points. The latter remains competitive and achieves the highest AUROC (95.27%) and AUPRC (95.08%) in this controlled study. This is an important result: shared communication is valuable, but adaptive, receiver-specific source selection yields the best mean Accuracy and F1 among all seven variants. The uniform control is a normalized mixing alternative, not a full CoTAR reproduction.
-
Quantifying the internal residual's contribution. Removing only GraphTSA's internal residual, while retaining its adaptive operator and the outer TeCh residual, decreases Accuracy by 3.57 points and F1 by 5.20 points. The CoTAR-style residual control reaches 84.54% Accuracy / 79.87% F1, further demonstrating that adding residual communication to shared aggregation does not reproduce the full GraphTSA result. The residual helps; it does not, by itself, explain the advantage over the tested attention and aggregation alternatives.
-
Conclusion and manuscript revisions. These targeted controls answer the reviewer's central concern: GraphTSA ranks first in mean Accuracy and F1 across all seven tested configurations, including parameter-matched attention and residual alternatives. The comparisons identify meaningful contributions from both adaptive communication design and residual placement; they do not require attributing every point of improvement to a single component. Appendix K.1–K.4, Table 12 provides the mathematical equivalence to attention (Equation (14)), full protocol, six-metric results, and interpretation.
Response to Reviewer FDRQ (Part 3)
Weakness 3 and Question 3: Representativeness of Learned Communication Patterns
We thank the reviewer for recognizing the relevance of our structural motivation and the value of the rank/topology analyses. We agree that selected affinity heatmaps alone are insufficient. To directly address this concern, we extended the analysis from illustrative examples to every test sample, every enabled temporal/channel branch, and every graph layer across all seven datasets, using five seeds.
-
Full-distribution evaluation. The analysis covers 10 dataset–branch combinations and 71,529 held-out test samples per seed, totaling 357,645 sample evaluations across five seeds. The same held-out partitions are evaluated across seeds. For each affinity matrix, we quantify the proportions of squared Frobenius energy assigned to three orthogonal components:
The components represent uniform aggregation, shared nonuniform source preferences, and receiver-specific deviations. We first aggregate across test samples and layers within each branch, then report mean ± SD across five seeds.
-
Evidence across datasets and branches. The results show that GraphTSA learns distinct communication regimes depending on the signal and tokenization, rather than producing a fixed pattern across datasets.
Table 1. Selected full-test-set communication-energy fractions (%; mean ± SD across seeds).
Dataset / Branch Uniform Shared nonuniform Receiver-specific ADFTD / Channel 99.78 ± 0.13 0.20 ± 0.13 0.02 ± 0.00 ADFTD / Temporal 58.46 ± 7.98 20.58 ± 3.60 20.96 ± 5.03 APAVA / Channel 97.76 ± 0.74 1.95 ± 0.70 0.29 ± 0.05 PTB / Channel 72.44 ± 2.22 17.28 ± 1.50 10.27 ± 2.29 PTB-XL / Temporal 23.02 ± 2.89 55.25 ± 3.93 21.73 ± 1.93 TDBrain / Temporal 67.63 ± 2.52 15.39 ± 1.96 16.98 ± 0.86 ADFTD provides a particularly informative within-dataset contrast: its channel branch is almost entirely uniform (99.78%), while its temporal branch retains 20.96% receiver-specific energy. On PTB-XL, shared nonuniform source preferences dominate the temporal branch (55.25%), alongside 21.73% receiver-specific energy. Thus, the learned operator adapts its balance of shared and heterogeneous communication to the dataset and branch. Appendix H, Table 10 provides all 10 combinations.
-
Layer-level evidence, not cherry-picked samples. We also analyze all layers and identify the layer with the highest five-seed mean receiver-specific energy in each branch. TDBrain's temporal branch reaches 38.48 ± 3.02% at layer 1/9, compared with 16.98 ± 0.86% averaged across its layers; PTB-XL reaches 33.22 ± 13.07% at layer 1/7. These values reveal substantial depth-dependent specialization. We explicitly distinguish the maximum-selected layers from branch-wide averages; Figure 9(a–b) presents both views.
-
Correct versus incorrect predictions. We include misclassified test samples rather than restricting analysis to successful predictions. The receiver-specific energy difference (correct minus incorrect, percentage points) is +1.46 ± 0.91 for PTB channel, +1.10 ± 0.65 for UCI-HAR channel, and +0.57 ± 0.46 for FLAAP temporal, but −0.36 ± 0.21 for ADFTD temporal and −0.90 ± 0.29 for TDBrain temporal. Therefore, heterogeneous communication remains measurable in the full test distribution, but greater receiver-specific energy is not a universal indicator of correct classification.
-
Conclusion and manuscript revisions. This full-distribution analysis directly addresses the reviewer's sample-selection concern: the shared/heterogeneous communication patterns are quantified across all seven datasets, all active branches and layers, and both correct and incorrect predictions. Their variability is itself informative: GraphTSA can favor nearly uniform aggregation where appropriate and differentiated communication elsewhere. Section 4.4.3, Equation (12) defines the decomposition; Appendix H, Figure 9 and Table 10 report the complete five-seed analysis. The affinities represent learned computational dependencies.
Response to Reviewer FDRQ (Part 1)
Weakness 1 and Question 1: Methodological Novelty Beyond Established MedTS Properties
We thank the reviewer for recognizing the practical relevance of our structural motivation, the thoughtful balance between relational expressiveness and complexity, and the competitive empirical results. We agree that temporal heterogeneity, inter-channel dependencies, and adaptive graph learning are established research directions, including in Medformer and MedMamba. We do not claim novelty in these physiological properties or in query–key attention itself. Our contribution is a specific communication design: combining CoTAR-derived token messages with input-adaptive, receiver-specific aggregation within TeCh.
Distinction from prior methods. Medformer models multi-granularity temporal patterns and cross-channel correlations; MedMamba uses multi-view state-space representations and adaptive graph learning. GraphTSA instead examines a particular limitation of CoTAR's aggregation stage. CoTAR forms an input-dependent shared core and subsequently fuses it nonlinearly with each token; thus, it can produce heterogeneous final representations. However, the shared aggregate itself does not assign different source-token mixtures to different receivers. GraphTSA explicitly permits this:
A(X)=\operatorname{softmax}_{\mathrm{row}}\!\left(\frac{Q(X)K(X)^\top}{\sqrt D}\right),$$ where $O_j(X)$ is a CoTAR-derived transformed and reweighted source message. The low-dimensional query–key projections produce directional, sample-conditioned source weights, while retaining CoTAR-style message construction rather than a separate conventional value projection. **This is a targeted architectural inductive bias, not a fundamentally new attention primitive.**Controlled evidence for the design. We evaluated seven communication and residual configurations with the same TeCh backbone, fixed subject-independent PTB partition, and five seeds.
Table 1. Selected PTB operator comparisons (mean ± SD, five seeds).
GraphTSA exceeds parameter-matched attention by 4.61 Accuracy and 6.74 F1 percentage points, and fixed adjacency by 4.0 and 6.01 points, respectively. Uniform aggregation is competitive (differences of 1.88 and 2.74 points), confirming the value of shared communication. These comparisons use a separate controlled PTB setting from the main benchmark and support the complete communication formulation rather than isolating every design factor. The full seven-configuration study includes conventional attention and internal-residual controls (Appendix K, Table 12).
Structural evidence beyond selected examples. The three-way decomposition in Section 4.4.3 and Figure 6(b) quantifies uniform, shared nonuniform, and receiver-specific affinity components. Appendix H, Figure 9 and Table 10 extend this analysis to all seven datasets, every enabled temporal/channel branch, and all test samples and graph layers. The observed mixtures vary by dataset, branch, and depth, showing that GraphTSA does not impose one universal communication pattern.
Contribution and manuscript clarification. Section 3.1 and Appendix K.1, Equation (14) clarify the relationship to CoTAR and conventional attention. Taken together, the controlled comparisons and broad structural analyses support GraphTSA as an empirically useful architectural extension of CoTAR. We interpret the structural analysis as descriptive and the ablations as evidence for the combined design, rather than proof of a uniquely causal mechanism.