- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces GVD CFM for generating high resolution EEG dynamic connectivity trajectories. Key experiments are that it shows that graph variate matrices remain PSD when local covariances are rank deficient; transformer based flow model enabled generating complete connectivity trajectories; and the approach is evaluated with five motor imagery EEG datasets compared to several generative baselines.
Critical strengths
The paper’s aim of modelling complete trajectories in spectral log Euclidean coordinates and to produce more realistic DFC has good motivation. The empirical evidence for spectral representation is sound and the evaluation across datasets and baselines are broad. The GVD baselines share the representation and decoding framework which isolates the effect of the generative model.
Critical weaknesses
-
It appears strong classification can be achieved with static support (W) alone (Appendix F2; AUC .822). This may suggest that discriminative information is largely in the static connectivity, with modest additional power from the dynamics. More importantly, this contribution is not isolated in the generated data. Could authors quantify or discuss the additional value of temporal dynamics, e.g., through comparing W only and full trajectory representations in the same synthetic and real classification?
-
Some baselines (e.g., JET and EEGGAN) perform at chance level in the classification and show poor Eva F1. The configurations are described in the Appendix A8, but the hyperparameter tuning and model selection are unmentioned. Could the authors clarify how baselines were tuned and if the configurations were adapted to the evaluated datasets?
-
Writing: Some acronyms (e.g., CFM, DCT) were not properly defined at the first mention. The differences between resolution flexible decoding and the recovery of higher frequency dynamics could be clearer when the approach is first introduced; generally the introduction and motivation would benefit from a clearer explanation of practical significance; likewise, methods section would benefit from improved clarity.
Questions for authors
How is B=100 and B=25 chosen for the main experiments and for flexible decoding, respectively? How sensitive is the approach to these choices in generative quality?
3 comments
Response to Reviewer
We thank the reviewer again for their review. Since we are approaching the end of the discussion period, we ask if there is any feedback for us or any updates to the score you would like to make based on our rebuttal. Thank you.
Thank you very much for your responses. I appreciate the additions of baseline comparisons and sensitivity analysis. Additional discriminative value of temporal dynamics is still uncertain. All things considered (including concerns on clarity), I would like to maintain my original ratings. Many thanks to authors' for their efforts and time.
Rebuttal to reviewer
We thank the reviewer for their constructive comments which lead to changes in the manuscript. All new changes are in blue in the revised paper.
W1 (Static support versus dynamics). We agree with the reviewer that the static support carries a large part of the class information. The submission already separates the two on real data in the appendix (App. F.3, Table 11; CAS AUC, dataset-balanced over five datasets):
We can see that neither part is completely sufficient on its own. The static support alone reaches 0.822, the dynamics without the support degrade as the windows shorten, and a support modulated by Gaussian dynamics falls to chance. It is the synergy of the stable support with the real dynamics that gives the best performance at every resolution. Following the review we repeated the static-versus-full comparison on generated data (App. F.4, Table 11). Static structure alone gives 0.802 AUC on real data and 0.765 when the classifier is trained on generated data, against 0.856 and 0.795 for the full trajectory, so the generated data preserve this ordering. The generated dynamics are also validated by the temporal metrics of Table 2, which remove each trial's temporal mean (temporal agreement 0.910, dynamic-energy ratio 0.953).
W2. (Baseline tuning and selection). We thank the reviewer for raising this; the settings are now given in full in App A.9, and no test data were used for any selection. JET and EEGGAN use the author implementations with their release settings, adapted only to the channel count and trial length of each dataset. To test whether tuning changes their results, we also tuned both again where two learning rates per model were trained for 100 pilot epochs on 85% of the training trials, the configuration was selected on the remaining 15% by a discrepancy over band powers, channel scale and correlations, and the selected model was retrained for 1,000 epochs. The tuned CAS AUC is 0.526 for EEGGAN and 0.496 for JET, against 0.524 and 0.495 in Table 1, so tuning does not change the result.
The submission already included GVD-cVAE and GVD-DDPM trained on the GVD targets. We have now added three further time-series generators trained on the same targets with fixed settings on every dataset (Tables 1 and 2), so the comparison no longer rests on the raw-EEG baselines:
GVD-CFM has the best overall performance, with the highest EvaGeM F1 on all five datasets and the highest CAS AUC on four. Diffusion-TS obtains a lower FID, but generates about half of the real dynamic energy.
W3. (Writing). We have addressed the terminology and wording issues raised by the reviewer in the paper. CFM and DCT are now defined at first use. The introduction states that "high resolution" refers to temporal resolution, and that decoding on a finer grid interpolates the learned finite-bandwidth trajectory and does not recover faster dynamics. It also names the practical use case, training data for connectivity-based decoders.
Q. (Choice of B) B=100 is the training resolution. B=25 is used only in the decoding experiment, where a coarse grid allows upsampling by up to 16 times to be tested. To answer the question on sensitivity we ran an additional sweep, training the full model at four values of B on all five datasets (App. D.6, Table 8):
We can see that the method is not sensitive between B=50 and B=100; thus B=100 is a good compromise point and not necessarily a uniquely optimal one.
We hope this addresses the reviewer's concerns, we are happy to discuss further and that they will consider updating their score.