- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces Circular Topological Transforms, a way to build geometric representations that are invariant to translations and rotations while still distinguishing a shape from its mirror image. The key idea is to evaluate directional topological descriptors such as the persistent homology transform along ordered circular scans. Experiments on molecular datasets show that the method can distinguish handedness and capture long-range chirality better than several geometric neural-network baselines.
Critical strengths
-
Clear motivation: the paper explains why standard invariantisation methods can destroy chirality information and formalises this with propositions before introducing the proposed circular transform.
-
Simple, interpretable construction: the method has an intuitive geometric interpretation. Rotations preserve the ordered circular scan, while reflections reverse it, making the chirality sensitivity easy to understand.
Critical weaknesses
-
The method depends on the existence and stability of a well-defined equivariant frame. The theoretical guarantees assume an equivariant frame, while the practical construction is equivariant only when both frame-selection stages are defined and return unique directions. An analysis of the robustness of the frame construction to such degeneracies and to small perturbations would strengthen the paper.
-
Potential computational scalability issue. The construction requires many directional topological computations; for molecular graphs, the stated complexity is roughly O(N^2 log N + DN log N). There is limited empirical evaluation of runtime and scalability relative to modern geometric networks on genuinely large shapes or graphs.
-
The empirical scope is narrow relative to the general claims: although the method is formulated for general n-dimensional shapes, the experiments are restricted to 3D molecular graphs and are mostly focused on chirality-related tasks. The authors themselves acknowledge that the behaviour of the method on higher-dimensional geometric data remains unexplored.
Questions for authors
I note that the related work does not discuss spectral/topological representations based on the Hodge Laplacian. It would be interesting to compare the proposed method against such approaches [1,2,3], or, if such a comparison is not appropriate, to discuss why. My understanding is that purely combinatorial Hodge-Laplacian signatures would be complementary to the proposed method but would, naively, not distinguish different conformations sharing the same underlying combinatorial structure. If true, this could strengthen the paper’s usefulness.
[1] Graph Classification Gaussian Processes via Spectral Features
[2] Hodgelets: Localized Spectral Representations of Flows on Simplicial Complexes
[3] Graph and Simplicial Complex Prediction Gaussian Process via the Hodgelet Representations
I do not have more questions, except the ones that I raised in the "Critical Weaknesses" section. I am leaning towards rejection at the moment, but addressing the points above could make me raise my score.
5 comments
The method depends on the existence and stability of a well-defined equivariant frame. [...] An analysis of the robustness of the frame construction to such degeneracies and to small perturbations would strengthen the paper.
We have added theoretical and experimental analysis on this.
For Existence: The new Proposition 4.14 proves that an SO(n)-equivariant frame exists generically (proof in Appendix B). In the data, two of the 555 base molecules of the test sets have a proper rotational symmetry (Table 26).
For Stability: The new Theorem 4.15 proves that our transform-guided frame is locally stable: if it is uniquely defined on a geometric graph, it is uniquely defined and varies continuously on all close enough embeddings (Appendix B.5).
The inability to find an equivariant globally stable frame is a well-documented challenge in geometric and equivariant deep learning (see for example [A] & Proposition 3.2 of [B]). In remark B.17, we explain why no equivariant frame can be globally stable. Thus, local stability is the best any researcher could hope for.
We also measured it (Appendix G.1): we add Gaussian noise to the coordinates and compare the frame before and after, for our frame and for a right-handed PCA frame that we added as a second frame function (Appendix E.2.1). At 0.05 Å on BZR the transform-guided frame changes its selected vertices on 71% of the molecules, while 2.6% of the PCA frames rotate by more than 10° (Table 18). Retrieval with three directions at this noise:
| Dataset | Circ-PHT, transform-guided frame | Circ-PHT, PCA frame |
|---|---|---|
| BZR | 0.662 | 0.955 |
| COX2 | 0.644 | 0.983 |
| DHFR | 0.750 | 0.968 |
On real conformers (3DCS), Circ-PHT with the PCA frame reaches a zero-shot ES-AUC of 0.902 with four directions, against 0.707 in the submission and 0.782 for MolAE (Appendix G.4). The PCA frame has its own degeneracies (repeated eigenvalues, vanishing third moments), where the transform-guided frame is still defined. The circle method takes the frame as an input, so both are covered by the same theorems.
Potential computational scalability issue. [...] There is limited empirical evaluation of runtime and scalability relative to modern geometric networks on genuinely large shapes or graphs.
We measured every stage up to 10,240 vertices on one CPU core (Appendix G.7, Table 30). With the PCA frame the descriptor is linear in the number of vertices: 1.4 ms at 40 vertices, 29 ms at 2,560 and 128 ms with 133 MB of memory at 10,240, with no training and no GPU. The quadratic term belongs to the transform-guided frame (2N directional diagrams), which is why we use the PCA frame for large shapes. On the same graphs one forward pass of EquiformerV2 takes 733 ms and 9.9 GB on a GPU, and it needs training; the spherical model of Paik (2023) needs 492 directions and training and is still not exact (Appendix F.5).
[A] Dym et al. Equivariant frames and the impossibility of continuous canonicalization
[B] Baker et al. An explicit frame construction for normalizing 3D point clouds.
The empirical scope is narrow relative to the general claims: although the method is formulated for general n-dimensional shapes, the experiments are restricted to 3D molecular graphs and are mostly focused on chirality-related tasks.
We added an experiment in R^4 (Appendix G.8). We know of no chirality benchmark in higher dimension, so the data are synthetic, random point sets joined by a sparse graph as in the synthetic experiments of Ruhe et al. [5]. We considered 40 shapes, their mirror images, and 8 random rotations of SO(4) each (640 poses), with the retrieval protocol of Table 1. We use the PCA frame in R^4 and the transform-guided frame extended to R^4, and the scan uses great circles that the reflection reverses. The table is with the PCA frame; with the transform-guided frame Circ-PHT, Circ-ECT and Circ-BCT are also at 1.000 from three directions on.
| Directions | 1 | 2 | 3 | 4 | 8 | 16 |
|---|---|---|---|---|---|---|
| Circ-PHT | 0.555 | 0.555 | 1.000 | 1.000 | 1.000 | 1.000 |
| Circ-ECT | 0.555 | 0.555 | 1.000 | 1.000 | 1.000 | 1.000 |
| Circ-SpectRe | 0.555 | 0.555 | 1.000 | 1.000 | 1.000 | 1.000 |
| Circ-Hodgelet | 0.555 | 0.555 | 1.000 | 1.000 | 1.000 | 1.000 |
| order pooled (blind) | 0.555 | 0.555 | 0.555 | 0.555 | 0.555 | 0.555 |
| lab frame | 0.07 | 0.08 | 0.08 | 0.09 | 0.09 | 0.09 |
The behavior is the same as in R^3: rotations leave the descriptor unchanged, the mirror image gives the reversed scan, one or two directions are reflection-blind, and three directions separate the two hands (Table 31). The experiments are also broader within molecules now: coordinate noise, conformers, learned and training-free read-outs, spectral transforms, and cost up to 10,240 vertices (Appendix G).
Thank you again for the feedback. The Hodge-Laplacian suggestion in particular led to a new family of circular transforms, and we have cited the suggested works in the revised paper.
[5] Ruhe, Brandstetter, Forré, Clifford Group Equivariant Neural Networks, NeurIPS 2023.
Thank you for the constructive review and for the pointers to the Hodge-Laplacian literature. We have cited them to better position our work, and we address each point below.
Your understanding is right. The Hodge Laplacians of a bond graph depend only on its incidence matrices, so their spectra are the same for a molecule, its rotations, its mirror image and its conformers. We added the references [1, 2, 3] to the related work (Appendix A) and measured it (Appendix G.6, Table 27): the spectrum of the Hodge 1-Laplacian gives 0.555 / 0.483 / 0.463 / 0.511 mAP on QM9-OR / BZR / COX2 / DHFR, against 1.000 for Circ-PHT.
Your comment made us try something we find more interesting: using spectral features as the directional transform inside the circle method. Along a direction, the height filtration gives a nested family of subgraphs, and any spectral quantity of them is a directional transform. We tried three, with the PCA frame and three directions (Tables 28-29):
Circ-Hodge reads the spectra of L0 and L1 of the sublevel subgraphs. Circ-SpectRe follows SpectRe [4]: each persistence pair carries the Laplacian spectrum of its component. Circ-Hodgelet follows the Hodgelet construction [2, 3] on the sublevel subgraphs, with the vertex heights and edge lengths as signals; since we wanted a training-free descriptor we use fixed wavelet filters where [3] learns them with a Gaussian process. Appendix G.6 gives the exact definitions. So the same spectra that are blind on the whole graph detect chirality once they are organized by the circle method: the method is not tied to persistent homology. Invariance and the reflection law (Theorems 4.4, 4.6) hold for these transforms; completeness needs an injective transform, which spectra are not in general.
[1] Opolka et al., Graph Classification Gaussian Processes via Spectral Features, UAI 2023. [2] Roddenberry et al., Hodgelets: Localized Spectral Representations of Flows on Simplicial Complexes, ICASSP 2022. [3] Alain et al., Graph and Simplicial Complex Prediction Gaussian Process via Hodgelet Representations, NeurIPS 2026. [4] Ji, Souza, Garg, Graph Persistence goes Spectral, NeurIPS 2025.