- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
GINO constructs canonical graph-edge coordinates using spectral ordering and structural refinement, then applies 2D RoPE and DINO/iBOT-style pretraining with independently recanonicalized crops. GINO provides invariance and ordering-energy analyses, canonicalization audits, and molecular downstream evaluations.
Critical strengths
- The paper proposes an interesting idea: the coherent integration of canonical graph coordinates with standard Transformer self-supervision.
- The authors derive a useful energy bound and informative supplementary controls, with explicit reporting of limitations.
Critical weaknesses
- Novelty and theoretical relevance need sharper justification. Most components build on established methods, making the specific integration the principal contribution. The energy analysis appears sound, but near-optimal ordering energy does not establish better positional representations or downstream learning. The main text should incorporate the appendix’s limitations and correct the attribution of production-order statistics to direct spectral ordering in Section 4.2.
- I think some of the important ablations of the method are in the appendix, and they should be in the main text. So, based on ablations in the appendix, the benefit of the proposed components remains unresolved. Appendix H does not establish an advantage of canonicalization over per-epoch relabeling or of canonical RoPE over no RoPE. The distinctive anti-diagonal crop also lacks a matched random-edge-removal baseline.
- I think the writing and placement of materials in the paper are not correct; the method section starts with an algorithm, two figures contain no useful information for the method section, and the benchmarking details are missing, since, based on the information in the benchmark section, GINO reports validation aggregates, including best-validation scores used for checkpoint selection, while external methods use different evaluation protocols and populations. Deduplication and graph exclusions further alter the benchmarks. Appendix G.4 acknowledges that these comparisons are contextual, contradicting the stronger ranking claims in Table 2 and Section 4.3.
- This is not clear in the text, but it seems the attributed-invariance claim contradicts the evaluated implementation. Sections 2.2, 3.1, and 4.1 claim attribute-based tie-breaking and invariant attributed representations. However, Appendix A.2 states that all experiments use topology_only=True, and Appendix C.1 reports changed canonical-order node features under relabeling for 48/400 BBBP molecules. Structural canonicality does not guarantee invariant feature–coordinate inputs or predictions.
- I think the main claim of the paper is for general graph representation learning, but the main evaluation covers eight molecular datasets, providing breadth across prediction tasks but limited diversity in graph structure and domain. Appendix K includes smaller non-molecular experiments, but their mixed results do not establish broadly beneficial transfer. The authors should either narrow the claims to molecular representation learning or provide stronger evidence across diverse graph domains and sizes.
Questions for authors
-
Which attribute-handling configuration produced the headline results, and how invariant are the resulting predictions under relabeling?
-
Can you provide test comparisons using matched preprocessing and splits?
-
Can you provide more diverse benchmarks?