- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes MSRG-CM, a framework for automatic sleep staging from multichannel physiological signals that combines inter-channel relationship modeling, local cross-attention between two feature levels, and multidirectional temporal context aggregation. First, ResMS-GIN constructs graphs with varying degrees of sparsity to extract multiscale features. Then SCFA enables bidirectional interactions between shallow and deep features within local temporal neighborhoods. Finally, MDSTAM employs four GRU branches to process differently ordered feature sequences and two-stage fusion to produce a representation for classification. Overall, the paper's originality is average, and there may be some issues with the experimental results.
Critical strengths
- The framework targets relevant modeling challenges. The paper designs three modules to address spatial relationships, complementary multilevel features, and temporal dependencies in multichannel sleep signals. The overall design aligns with the identified challenges.
- Clear separation between local feature fusion and long-range context modeling. The framework first uses local cross-attention to exchange information between shallow and deep features, then employs multidirectional GRUs to aggregate broader temporal context. This design addresses local details and overall temporal relationships separately.
Critical weaknesses
- The residual connections in SCFA are unclear. The main text does not specify which features are connected through the residual paths. Moreover, the Add & Norm and concatenation-based fusion shown for SCFA in Figure 1 seem to be inconsistent with the submitted code. The actual implementation needs clarification.
- The motivation for varying graph sparsity across network depth is insufficient. The paper does not adequately explain why shallow features use a dense graph, whereas deep features are obtained by summing features from graphs at different levels.
- The description of "four-directional scanning" is imprecise. In my understanding, the "vertical scanning" in the code performs temporal subsampling and reverse traversal, rather than scanning along the channel or feature dimension. The terminology and illustration may therefore be misleading.
- Comparisons for multidirectional temporal modeling are insufficient. Fair comparisons with other bidirectional models, such as BiLSTM, under the same sequence organization and fusion scheme would help distinguish the contribution of the sequence organization strategy from that of the GRU architecture itself.
- The result comparison in Table 2 seems to be unfair. For the evaluation metric F1, the proposed model appears to use Weighted F1, while for some other papers, the paper directly use their macro F1 (for example, LGBM, Shao et al., 2024), which makes the comparison unfair. Please carefully check your experimental results.
Questions for authors
Please respond to the above weaknesses in your rebuttal.
4 comments
Thanks to the reviewer for the time and effort in reviewing. We are sorry for the delay in updating the PDF. Further to our previous/first "Official Comment by Authors", we have just prepared and uploaded the revised PDF and replaced the originally submitted version. This current PDF is the one that corresponds to our previous/first reply and revision. Specifically, the changes and their corresponding locations are as follows.
W1: SCFA residuals and fusion
A: Each attention output is added to its query-stream input, followed by LayerNorm. The two streams are then concatenated, projected and passed through dropout. Shared projections exchange query and key/value roles. These operations clarify the residual paths and fusion shown in Figure 1. Locations: Section 3.2; Figure 1; Appendix E.1.
W2: Depth-dependent graph scales
A: Nested graphs use progressively higher affinity quantiles. Early layers support broad channel interaction; deeper layers add more selective paths while retaining earlier scales and residual features. This provides complementary propagation histories for shallow-deep fusion. Algorithm 1 specifies the active-scale aggregation. Locations: Section 3.1, Eqs. (1)-(2); Algorithm 1; E.1; Table 14.
W3: Four temporal traversals
A: All paths operate on time: the original sequence, its reverse, the stride-two subsequence and its reverse. The figure's vertical labels refer to temporal subsampling. With L=1, contextual memory consists of within-input GRU hidden states, reset between inputs; attention pooling and learned branch weights combine the readouts. Locations: Section 3, input definition; Section 3.3; Figure 3; E.1.
W4: Matched recurrent comparisons
A: The GRU/LSTM comparison fixes temporal resolutions, attention pooling and fusion. Table 14 also includes a single bidirectional GRU and removal of stride-two or reverse branches. Seeds are averaged within subject before paired macro-F1 differences and subject-bootstrap intervals are calculated. Locations: Section 3.3; E.4; Table 14.
W5: F1 definitions and fair comparison
A: We distinguish macro-F1 from support-weighted F1 and pooled class metrics from fold summaries. Literature results retain their source definitions, without ranking marks across differing overall-F1 definitions. Table 13 separately reports both F1 metrics under the aligned protocol; Tables 11 and 15 identify pooled and repeated-seed summaries. Locations: Section 4.3; Tables 2 and 6 captions; E.2 and E.4; Tables 11, 13 and 15.
Thanks a lot again for your time and effort. We appreciate it.
Thanks for your reply! The author's responses to W1, W2, W4, and W5 are quite thorough, and they also added relevant experiments, basically addressing my related questions. But for W3, the author confirmed that the vertical scan' in the paper is actually stepwise sampling in the time dimension and reverse traversal, which matches my previous understanding. This clarification makes the specific operations clear, but it hasn't fully eased my doubts about the method's contribution and novelty: The current design still has relatively limited substantial innovation compared to existing temporal modeling methods.
Thanks to the reviewer for the follow-up comments and for recognizing our previous response.
The central contribution of MSRG-CM is a coordinated representation-learning framework that connects channel relationships, feature depth and temporal evidence within each sleep-scoring window.
Specifically, ResMS-GIN couples graph-scale aggregation to network depth, retaining broad channel interactions while progressively adding stronger-edge paths. SCFA establishes bidirectional local correspondence between shallow morphology and deeper graph representations, preserving both feature sources before temporal aggregation. MDSTAM then reads the fused sequence at consecutive and stride-two resolutions, using bidirectional recurrent states, attention pooling and learned branch weights. Together, these operations make the temporal readout depend on an explicitly constructed hierarchy of channel and cross-level information.
The architectural design novelty is the coupling of topology selection, cross-level correspondence and temporal aggregation for multichannel sleep staging. The matched ablations examine the roles of these configurations within the complete framework.
The above contribution is explained in the Introduction (p. 2), Sections 3.1-3.3 (pp. 4-7) and Appendix E.1 (pp. 23-24), with matched controls in Table 14 (pp. 26).
Specifically for the W3 Temporal traversals:
Section 3.3 (pp. 6-7) defines the consecutive and stride-two forward/reverse temporal paths. Figure 3 and its caption (p. 5) identify the vertical labels as stride-two temporal traversals. E.1 (pp. 23-24) describes the within-window memory and readout.
We thank the reviewer for the time and careful review. We expanded Secs. 3.1-3.3 and E.1 to explain the graph hierarchy, SCFA residuals and contextual memory, and included the matched controls and consistently defined F1 results in Tables 13-15. We have conducted the complementary experiments in response to the comments. The revised PDF will be uploaded soon.
W1: SCFA residual paths and fusion
A: Sec. 3.2 and E.1 specify the query-stream residuals:
Zs=LN(Xs+Attn(Xs,Xd,Xd)), Zd=LN(Xd+Attn(Xd,Xs,Xs)), X′=Dropout(Wf[Zs∥Zd]+bf).
The first residual adds the original shallow input to its deep-conditioned attention output; the second adds the original deep input to its shallow-conditioned output. Each stream applies LayerNorm before concatenation, projection and dropout. The shared attention core exchanges query and key/value roles.
The expanded explanation states why both directions are retained: a shallow query retrieves graph-informed context for a local pattern, while a deep query retrieves finer morphological evidence. Local attention learns their correspondence, and each residual retains its own source representation. MDSTAM then aggregates the fused sequence, following Fig. 1. We have checked the code and ensured consistency.
W2: Motivation, why graph scales depend on depth
A: Sec. 3.1 derives nested graphs from one example-specific affinity matrix. Thresholds are quantiles at 0.3/0.6/0.9, defining progressively stronger retained connections. At layer ℓ, the scale set is {1,…,min(ℓ,S)}. The first layer uses broad channel interaction; deeper layers add more selective paths while retaining the earlier scales. Residual updates keep preceding representations accessible.
Thus, depth controls the combination of propagation paths. Layer-wise channel pooling exposes different propagation histories, supplying shallow morphology and deeper channel-interaction features to SCFA. Table 14 reports graph controls as macro-F1 differences from the full model (pp):
W3: Temporal traversals and contextual memory
A: Sec. 3.3 defines all 4 paths on time: Xp, Flip(Xp), Xv=(Xp,0,Xp,2,…) and Flip(Xv). The legacy vertical labels correspond to stride-two temporal sampling. Consecutive and stride-two paths provide two temporal resolutions, each traversed in both orders.
E.1 identifies MDSTAM as contextual memory: ht(d)=GRUCell(d)(zt(d),ht−1(d)). Hidden states accumulate preceding tokens in each traversal; attention pooling reads the hidden-state sequence. Token attention selects positions within a branch, while learned softmax branch logits weight the directional representations before concatenation and projection. The mean-feature residual preserves an aggregate input description alongside the ordered readouts.
The scoring context is L=1, with hidden states reset between inputs; T indexes tokens within that input. The expanded method explains how channel structure and shallow/deep correspondence are formed before recurrent memory reads the fused tokens.
W4: Matched bidirectional and traversal controls, fair comparisons
A: Newly added Appendix E.4 fixes the two bidirectional resolutions, attention pooling and fusion for the GRU/LSTM comparison. Table 14 provides paired macro-F1 differences (pp), with seeds averaged within subject before the reported bootstrap intervals:
These controls separate cell choice from temporal organization. Matched LSTM differences are small and positive; branch-removal controls test the information paths. Sec. 3.3 explains these choices.
W5: Consistent F1 definitions
A: We define F1,macro=51∑kF1,k and F1,weighted=∑k(nk/N)F1,k. Table 11 reports the earlier pooled-matrix values separately from Table 13's aligned comparison. The overall F1 column in the literature comparison has no ranking marks across differing source definitions.
For the aligned evaluation, Table 13 (detailed in the revised PDF) reports both metrics for every method. Among these, MSRG-CM macro/weighted-F1 (%) is:
The same weighted means appear in Table 15's three-seed summary, enabling metric-wise comparison with L-SeqSleepNet, LaBraM, CBraMod and the Mamba encoder.