- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper investigates how to use EEG graph structures, then construct effective representation learning tasks for predicting future node features and functional connectivity. GRFBrain uses the historical node mean and output of frozen graph predictor as reference states. Constructs a Gaussian source using the historical graph Laplacian. And then employs coupled conditional flow matching and joint node–edge transport. The method is evaluated on abnormal EEG classification, using the TUSZ and TUAB datasets and compared with conventional EEG models, discrete graph dynamics methods, continuous-time models, and general-purpose flow-based predictors. The main findings are based on a joint node–edge velocity network, joint supervision of nodes and edges, and a short-term prediction objective with a 1-second prediction horizon.
Critical strengths
S1. The paper designs the prediction task using historical inter-channel relationships. It constructs a sample-dependent noise correlation structure from the historical EEG graph and controls the total noise energy. The conditional graph source achieves an F1 score of 0.523, higher than the IID source and the global graph source. This design addresses the inter-channel dependencies ignored by generic Gaussian sources. S2. Node–edge interaction updates channel activity and functional connectivity through bidirectional interactions within a single network. The full model achieves F1 scores of 0.523 and 0.488 with 12 s and 60 s inputs, respectively. Both exceed the corresponding scores of the strongest unidirectional variant. The consistent gains across both input lengths support the role of bidirectional interaction in learning representations for classification.
Critical weaknesses
W1. Key evaluation procedures are not adequately described, making the main results difficult to verify. Page 6 does not specify which dataset was used to select the threshold that maximizes F1. These omissions make the performance comparisons in Table 3 difficult to assess. The paper should report the numbers of subjects, and recordings in each split, and specify the data used for pretraining.
Questions for authors
Were TUSZ and TUAB first divided into subject-disjoint training, validation, and test sets? Were any validation or test recordings used during pretraining or training with the predictor frozen? Which dataset was used to determine the optimal threshold mentioned on page 6? Was this threshold then fixed for testing? Did all methods follow the same rule?
We appreciate your time and the recognition of the strength of our work. Below we address each weakness and question with additional appendix that we will incorporate into the revised version.
Sorry for confusing with insufficient description of the data partitioning and evaluation protocol,now we have added more details in appendix.
Specifically, TUSZ uses subject-disjoint train/dev/test sets with 527/61/45 subjects. EEG is aligned to a fixed 19-channel order, resampled to 200 Hz, and segmented into non-overlapping 12s and 60s clips. Each one-second window is represented by 100-dimensional log-amplitude FFT features, normalized using fixed training-set statistics. Thresholds are selected on the dev dataset and fixed for testing, without re-optimization. For TUAB, we follow the official data splitting. The EEG data preprocessing refers to existing works of BIOT (NeurIPS 23), EvoBrain (NeurIPS 25), and ODEBrain (ICLR26) for fair comparisons.
For TUSZ and TUAB, the downstream threshold was selected on the development split, separately for each model and random seed. For each development-selected checkpoint, we collected the predicted probabilities and ground-truth labels for all development clips, constructed the precision–recall curve, and selected the candidate threshold with the highest F1 score. All methods evaluated through our unified TUSZ pipeline followed this same selection rule.