- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The paper proposes Symmetry Descent Neural Operators (SDNO), which address the following important gap of common equivariant neural networks: ordinary models assume that one single symmetry rule (group) and one single coordinate frame work everywhere in the domain. The proposed SDNO aim to achieve global consistency for local equivariance, which is not enough. The main idea behind SDNO consists of three steps: learn the hidden local symmetries from the observed operator; estimate the transport between neighboring patches and measure curvature and holonomy; constrain the weights so that they respect the obtained symmetries and transport rules. SDNO remains accurate under unseen changes in holonomy, curvature, topology, and local frames.
Critical strengths
The identified problem of local and global consistency of equivariance seems to be significant and new. The paper develops the framework (and the corresponding theory) on how to address it, and the ideas seem to be interesting for the community.
Critical weaknesses
I believe the main weakness is that the approach relies on lots of required assumptions (in particular, multiple observations per operator, Jacobians, spectral gap, etc.), which is mentioned in the Limitations section.
Comment on the content presentation: I would like to share with the authors my opinion that the abstract and introduction is quite dense and introduces many terms quickly (I was a bit shocked when reading it, so you can easily lose the broad audience).
I also would like to comment why I put “1: Difficult to follow despite careful reading.” on “Is the paper clearly presented?”. I believe the problem might be in dense terminology for the broad ICLR community (and for me as well). So, I have not noticed any inconsistency in notation or definitions, or smth like this, but it took me a lot of effort to understand (at least partially) the underlying terminology.
Questions for authors
I have some questions regarding the novelty of the approach, because the description of main contributions in the introduction seem to me vague.
Has anyone previously enforced loop holonomy constraints on network layers? If not, is that because it is genuinely new, or because practitioners found it unnecessary for some reason? Is the soft null-space projection itself new, or is the novelty in applying it to symmetry constraints? Does Theorem 5.1 require anything beyond standard covering-space / local-system / sheaf-cohomology theory (I mean, is this fact smth standard, restated for the neural-network domain)?
Another question is about the significance of the work: Could the authors please provide one real application or dataset (not a synthetic one) where ignoring loop holonomy causes a measurable failure that SDNO fixes?
4 comments
Q2. Is the soft null-space projection new, or is the novelty in applying it to symmetry constraints?
The soft projection itself is the ridge form of the hard null-space projection in EMLP [3]. The distinction in SDNO is that the constraint matrix combines local equivariance with edge compatibility determined by an estimated connection, and therefore changes between episodes. Its rank may change with holonomy, making a hard null-space projection discontinuous. The soft projection provides a differentiable relaxation. Revised Theorem 5.3 bounds the error by and the residual by .
Q3. Does Theorem 5.1 of the original submission need anything beyond standard covering-space, local-system, or sheaf theory?
We agree that the result follows from established local-system theory. Following your comment, we have restated it as Proposition 5.1 (Holonomy criterion) and explicitly identified its connection to the classical holonomy principle. Building on the original setting and method, we bring out three further results. These are the containment relation with its equality conditions (revised Corollary 5.2), a stability bound under approximate edge compatibility (revised Theorem 5.4), and bounds for the soft projection (revised Theorem 5.3).
Q4. Is there a real application or dataset where ignoring loop holonomy causes a measurable failure that SDNO fixes?
Yes, on measured data from a superconducting qubit array [4], ignoring the loop phase raises the error by 53% to 85% relative to SDNO, and the loop phase estimated by SDNO agrees with the magnitude of the applied flux, which is never provided to the model. Following your request and Reviewer 6rrr's call for more realistic validation, we add this dataset (revised Table 3 and Section 6.4). Trivial connection in the table below is the same model with the loop phase fixed to zero, ignoring loop holonomy.
| Ring | Trivial connection | SDNO | Best unstructured |
|---|---|---|---|
| 4 sites | 0.580 | 0.313 | 0.769 |
| 8 sites | 0.743 | 0.485 | 0.759 |
| 12 sites | 0.704 | 0.437 | 0.679 |
The correlation is at least 0.989 on all three rings, and the median error is 1% to 3% of the phase range . On real power-grid cases [5, 6] (revised Table 4(b) and Appendix I.7), removing the loop component of the phase-shifter angles changes active power by up to 74% (about 1.7 GW). In probing simulated on these cases, estimating the connection lowers the estimation error by more than a factor of 10 relative to a reciprocal model without the phase.
References
[3] Finzi et al. A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups. ICML 2021.
[4] Rosen et al. A Synthetic Magnetic Vector Potential in a 2D Superconducting Qubit Array. Nature Physics 20, 1881–1887, 2024.
[5] Josz et al. AC Power Flow Data in MATPOWER and QCQP Format: iTesla, RTE Snapshots, and PEGASE. arXiv:1603.01533, 2016.
[6] Zimmerman et al. MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education. IEEE Transactions on Power Systems 26(1), 12–19, 2011.
Please take a moment to respond to the rebuttal. Thank you!
I thank the authors for their detailed response. I apologize for the delayed reply, as I was ill over the past few days; however, I kept in mind that I needed to respond. I thank the authors for the corrections made and would like to raise my score to 3.
W1. The approach relies on many assumptions: multiple observations per operator, Jacobians, and a spectral gap.
Thank you for raising this concern. The Jacobian and sufficient-excitation assumptions apply specifically to local symmetry discovery, an optional step needed only when the structure group is unknown. The Aharonov-Bohm ring, qubit-array, polycrystalline, power-grid, and rotation-averaging experiments take the group from the physics (U(1) phases, planar grain rotations, or SO(3)) and skip this step, so none uses a surrogate, Jacobian, or spectral gap. The step is described in revised Appendix C.
Multiple observations are required because the connection is hidden and must be inferred from operator responses. Following your comment, we vary the number of context pairs per episode and compare errors (revised Appendix Table 8). The AB ring reaches an error of 0.036 with 10 context pairs, an order of magnitude below the best neural baseline. The controlled U(1) task needs 2 pairs, and the qubit data use one trace per episode. A wrong symmetry assumption can be detected from the fitting residual, which rises from 0.04 to 0.29 as the symmetry is broken (revised Appendix Figure 9).
W2. The abstract and introduction are dense and introduce many terms quickly, and the stated contributions are vague.
We agree that the original presentation introduced too many concepts before establishing the problem. We have rewritten the abstract and introduction, added a conceptual illustration of transport and holonomy (revised Figure 1), and introduced the necessary background and compatibility conditions in revised Section 3. Revised Appendix A also provides a terminology guide.
Following your comment, the revised contribution list states three items. (a) Method: estimate a hidden gauge connection from input-output pairs of one operator and enforce the resulting constraints through a differentiable projection and a per-episode corrector. (b) Theory: the holonomy criterion for weight sharing, the containment between holonomy and full-group constraints, and stability under estimation error. (c) Experiments: controlled connection recovery, Aharonov-Bohm ring, measured qubit-array interference, polycrystalline local frames, and public SO(3) rotation averaging.
We have also moved the specialized sheaf-theoretic and categorical formulations to revised Appendix D. The main text now develops the compatibility problem directly, using elementary examples before introducing its mathematical interpretation.
Q1. Has anyone enforced loop-holonomy constraints on network layers before? If not, is this new, or was it found unnecessary?
Thank you for this question. The mathematical role of holonomy in global compatibility is classical, as we now acknowledge explicitly in revised Proposition 5.1. Conventional gauge-equivariant architectures generally impose equivariance under the full structure group G. Since the holonomy group H is a subgroup of G, full-group equivariance can ensure the required loop compatibility without separately imposing holonomy constraints. However, it can also be more restrictive than necessary.
When a connection has holonomy group H⊆G, the corresponding holonomy-intertwiner space can be larger than the space of fully G-equivariant maps. Revised Corollary 5.2 illustrates this with an SU(2) representation: considering the holonomy constraints alone, the allowable dimensions are 9 under the full group, 18 under a diagonal torus, and 36 under trivial holonomy. Additional local-admissibility constraints must also be respected when constructing globally compatible layers.
SDNO uses this distinction when the connection is unknown and varies between episodes. It estimates the connection from operator observations and determines the resulting compatibility constraints. To our knowledge, previous operator-learning methods have not used holonomy estimated from episode-specific context pairs to determine the shareable layer space.
The revised experiments also demonstrate the value of recovering the connection. On the Aharonov–Bohm ring, a gauge-equivariant network constructed following [1, 2] has new-holonomy error 0.703 with identity links. Supplying SDNO's estimated connection reduces the error to 0.449, close to the true-connection reference of 0.433 (revised Table 4(a) and Appendix Table 10). Under a random gauge applied to the in-distribution episodes, the errors are 0.929, 0.414, and 0.402. These comparisons show that estimating the connection is beneficial even for an independently constructed gauge-equivariant architecture. Further comparisons appear in our response to Reviewer 6rrr (W1/Q1).
References
[1] Cohen et al. Gauge Equivariant Convolutional Networks and the Icosahedral CNN. ICML 2019.
[2] Favoni et al. Lattice Gauge Equivariant Convolutional Neural Networks. Physical Review Letters 128, 032003, 2022.