- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper introduces GSF-χ, a graph transformer that explicitly models chirality by making pairwise interactions sensitive to molecular handedness. Its Chiral-RoPE mechanism reverses under reflection, while a symmetry-based readout separates mirror-even spectral features from mirror-dependent ECD peak signs. The authors validate these properties through mathematical identities, 85 property tests, and coordinate-reflection audits, then evaluate performance on ChIRo R/S and Ranking, CMCDS ECD, and ACMP axial chirality benchmarks, including comparisons with equal-budget controls and label-efficiency studies.
Critical strengths
- The symmetry analysis is careful and well-scoped
- Parity is treated as an output-dependent requirement, not a single property of the model.
Critical weaknesses
- The paper is a little hard to read and understand; many things are not explained properly in the main text. More background on RoPE would be helpful.
- The mechanism does nothing for the even targets it also claims to serve. The reflection-even control matches or beats the full model on Position and Number, so the contribution is confined to sign prediction
- The paper solves a representation problem with a labeling solution. Chirality never arises from geometry inside the model. It is extracted upstream by a cheminformatics pipeline, reduced to a per-unit sign, and injected.
- Scope is claimed much more broadly than the construction supports. The method covers central and axial units because both can be reduced to anchor sets with a sign. Planar and helical chirality, conformational chirality, and chirality that emerges from assembly rather than from a localized unit have no obvious encoding in this framework, yet the conclusion offers “a general representation that integrates chirality into graph transformers.”
- Several design choices are justified by ablation rather than by the stated principle.
Questions for authors
- If the same C₂ projection is wrapped around ChiDeK’s and ECDFormer’s Symbol heads, do they also achieve exact pair complement?
- What is the computational complexity of the method compared to the baselines?
2 comments
Response to Reviewer UiYz (2/2)
5. Complexity and measured cost. With layers, atoms, units and hidden width , the unit-wise rotary attention correction costs , in addition to the usual attention/projection terms and the atom–unit field networks. The direct implementation materializes per-unit pair tensors, so memory grows with . ChiDeK's anchor queries attend to atoms with an attention term; ECDFormer combines bond/angle message passing with ordinary dense transformer attention over padded atoms and peak queries. Thus neither baseline has the extra unit-wise interaction term. Their widths, query counts and head designs also differ. Parameter count alone does not establish lower computational cost.
The parity readout evaluates both handedness signs, adding approximately twice the encoder arithmetic; batching affects the observed latency. We measured inference on the same first 32 ACMP test molecules with preloaded inputs, FP32, four CPU threads, and an Intel Xeon Gold 6530. The values below are median forward times over three repetitions of five iterations after warm-up, using each model's native architecture and peak-slot count. They exclude preprocessing, transfer and metric computation.
| ECD model | Parameters | CPU forward, batch 32 |
|---|---|---|
| GSF-χ, three-channel rotation | 154,440 | 413.46 ms |
| GSF-χ, two-channel rotation | 154,498 | 453.69 ms |
| GSF-χ, signed attention bias | 154,348 | 360.47 ms |
| ChiDeK | 8,028,283 | 215.95 ms |
| ChiDeK + C2 projection | 8,028,283 | 429.72 ms |
| ECDFormer | 795,433 | 50.25 ms |
| ECDFormer + C2 projection | 795,433 | 100.85 ms |
GSF's smaller parameter count therefore does not translate into lower CPU latency in this batch setting. We repeated the measurement on one NVIDIA H100 80GB GPU (FP32, eval mode, inputs already on the device; median of five repetitions of 50 iterations after 10 warm-up iterations):
| ECD model | GPU forward, batch 1 | GPU forward, batch 32 | Peak allocated memory, batch 32 |
|---|---|---|---|
| GSF-χ, three-channel rotation | 4.82 ms | 5.59 ms | 763 MiB |
| GSF-χ, two-channel rotation | 4.42 ms | 5.20 ms | 763 MiB |
| GSF-χ, signed attention bias | 3.91 ms | 4.57 ms | 689 MiB |
| ChiDeK | 39.52 ms | 665.54 ms | 240 MiB |
| ChiDeK + C2 projection | 78.39 ms | 1306.79 ms | 241 MiB |
| ECDFormer | 5.95 ms | 9.20 ms | 98 MiB |
| ECDFormer + C2 projection | 11.67 ms | 17.95 ms | 99 MiB |
On GPU, GSF-χ is the fastest of the three models at both batch sizes, but its per-unit pair tensors give the highest peak memory at batch 32 (about 3× ChiDeK and 8× ECDFormer), consistent with the term above. The output projection roughly doubles baseline latency because it requires a second, mirrored forward pass. These are inference measurements, not training times.
6. Design choices versus principle. The symmetry principle fixes what the construction must satisfy: reflection-even context, a single reflection-odd sign per unit, order-free aggregation over units, and a parity-split ECD readout. It does not determine sizes such as the rotary block dimension or the gate form, which we choose empirically and now test directly: Section 6.3 shows that the signed rotary form, rather than its block size, carries the Rotation gain.
Where to find the changes in the revised PDF (blue). Two-channel RoPE control: Section 6.3, Table 2; Appendix F.3. Projection around baselines: Appendix F.4, Table 29. Measured cost: Section 4.5; Appendix F.5, Table 30. Clearer method presentation: Section 4 now opens with a plain-language description of the model inputs and outputs (including what ECD measures), Figure 1 is redrawn from input to output, and every symbol is defined at first use. Scope: Conclusion.
Response to Reviewer UiYz (1/2)
1. Explanation and relation to RoPE. Ordinary RoPE rotates query and key channel pairs so that their dot product depends on a relative angle. Here, an atom–unit field supplies that relative angle, and the unit's handedness changes its direction. Reversing handedness therefore reverses the rotation rather than leaving the interaction unchanged. The revision defines every input and output at first use (Section 4), and shows the encoder and the output projection as separate stages in the redrawn Figure 1. We ran the standard two-channel construction (RoFormer) as a direct control with matched parameters, seeds and budgets: both rotary forms outperform a parameter-matched scalar handedness bias on Rotation (77.67% and 77.50% vs 73.17%; the three-channel block wins in all five seeds), while they perform on par with each other. The benefit therefore comes from handedness-signed relative rotation, which is the defining idea of Chiral-RoPE, rather than from the block dimension (details in our response to Reviewer ozQ3).
2. Even targets and the role of preprocessing. We agree that the ablations do not establish a universal improvement in Number or Position. An odd-sensitive encoder can yield an even output after projection, but this is a compatibility property, not a guarantee of better accuracy on even targets. The revision narrows the empirical claim accordingly. We also agree that chirality is extracted upstream. The intended question is how a supplied stereogenic signal should affect molecular interactions, not whether the network can discover that signal from reflection-invariant inputs. R/S accuracy alone does not establish the need for the full architecture.
3. Scope. The implementation and audits cover the stated central and axial units under explicit role/frame assumptions. They do not establish an encoding for planar, helical, conformational or assembly-level chirality. The revised conclusion is scoped to central and axial stereogenic units and describes broader chirality as future work.
4. Projection around existing baselines. Yes, at the output-function level the construction is model independent. For a baseline binary Symbol logit vector f(x) and a physical mirror operation M, define Pf(x)=21[f(x)+Jf(Mx)], where J swaps the two classes. Since M2=I, Pf(Mx)=JPf(x). The even heads can analogously average their original and mirrored logits. This enforces probability/logit consistency for any encoder when every mirror-sensitive input is transformed correctly. It is therefore not evidence that the GSF encoder is uniquely necessary. A zero score is an important exception for hard labels: both probabilities are 1/2 and a fixed argmax tie rule does not produce complementary labels. An encoder that is itself mirror blind can collapse to exactly this case.
We evaluated this wrapper on all five frozen matched checkpoints of each baseline, transforming coordinates, chiral frames and local tags as applicable. On the 120 held-out ACMP molecules, the mean valid-peak Symbol accuracies are:
These are CPU frozen-checkpoint evaluations, with the same evaluator before and after projection. We report valid-peak accuracy here to avoid the historical evaluators' different zero-peak slot bonuses; under a common seven-slot convention ChiDeK is 66.62%/65.29% and ECDFormer is 52.23%/52.23%. The physical-mirror hard-label flip rates after projection are 99.93% and 24.67%, respectively, with the remaining cases being exact ties. This demonstrates the algebraic guarantee while showing that it does not ensure predictive improvement or non-tied class decisions. The physical-mirror audit is distinct from comparing the independently supplied benchmark partners. Because a post-hoc wrapper does not measure adaptation during training, we also retrained each baseline with the projection inside its objective (original architecture, five matched seeds, 25 epochs, validation selection). Under the seven-slot convention, projected ChiDeK reaches 66.69% ± 2.30%, essentially unchanged from 66.62% without projection. Projected ECDFormer outputs tied Symbol decisions on every seed (50.00% true-slot accuracy; 52.83% seven-slot), so its mirror partners receive identical rather than complementary signs. Exact consistency is obtained in both cases; better prediction is not.