- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work discusses symmetry slippage and the ways to identify and correct it. Symmetry slippage occurs when a model has more symmetry constraints than exist in the data. This can worsen performance as the model isn't able to express exactly what needs to occur. They present grippage encodings, a way to fix this over equivariance by restoring the lost expressivity. The test across 9 test cases and find that it improves performance across all of them.
Critical strengths
Not only does this work properly identify a key area in equivariant machine learning, but it applies an effective resolve across a large variety of test cases. They show that their method not only thoroughly improves performance, but also works across a variety of the failure cases. I believe this is a very strong way to show that their method works and should be applied in scenarios of unknown symmetry.
Critical weaknesses
The biggest weakness of this work is that they don't compare their method against a non-equivariant model that has learned through data augmentation as has been shown to outperform equivariant networks that are not properly structured to match the real symmetry of the data. Showing that they outperform these data augmentation models (like AlphaFold3 for example) would further show the benefit of their method.
Questions for authors
- How does your method compare to a method that combines equivariant and non-equivariant functions to produce symmetry breaking? What advantages does your method have over symmetry breaking methods, does it ensure retained equivariance?
- How minimal is the retraining needed for grippage encodings?
3 comments
2 - Response to Reviewer qMrH
Q1.1 How does your method compare to a method that combines equivariant and non-equivariant functions to produce symmetry breaking?
We thank the reviewer for their question. It is worth mentioning that grippage encodings are a method that combines equivariant and non-equivariant functions to correct symmetry slippage; in the special case that symmetry slippage is over-equivariance, this correction is via symmetry-breaking. Specifically, GEs append features that respect the prescribed transformation law but need not respect the additional, unintended symmetries of the original architecture. The distinction from simply combining an equivariant architecture with an unrestricted non-equivariant component is that GEs are designed to break unprescribed symmetries without sacrificing prescribed equivariance. To empirically demonstrate the distinction, we have included this comparison in the latter table above (Table 2 in Appendix B.4 of the revised PDF).
Q1.2 What advantages does your method have over symmetry breaking methods?
In the special case where symmetry slippage is over-equivariance, grippage encodings may be viewed as a symmetry-breaking method, rather than an alternative. Notably, this is a somewhat different sense of “symmetry breaking” from that often studied in the literature. In this setting of over-equivariance, GEs concern symmetry breaking at the level of an architecture's hypothesis class, in the sense that an unintended symmetry is considered broken once the architecture can realize some function violating it. In contrast, much of the symmetry-breaking literature studies individual functions and, more specifically, the possibility of producing outputs with smaller stabilizers than their inputs. One recent paper which utilizes symmetry-breaking in a similar “architecture-level” sense as us is [1].
However, symmetry slippage is more general than over-equivariance; indeed, the manuscript describes instances of over-quotienting that is not over-equivariance (e.g. WL test for GNNs, Case Study 4), and extension-mistyping (Case Studies 7-9) is never over-equivariance except in trivial cases. It is for this reason that we tend to refer to GEs as ‘symmetry-correcting features’ throughout the paper rather than ‘symmetry-breaking’ features: the notion is more general than symmetry-breaking for us.
Q1.3 Does it ensure retained equivariance?
Yes: the grippage encodings used in all of our experiments retain the prescribed equivariance. In principle, they do not ensure by construction that the new architecture’s transformation law is exactly the prescribed law, however; that is more subtle, and is where our theoretical results in Section 4 come into play.
Q2 How minimal is the retraining needed for grippage encodings?
We thank the reviewer for the question. The retraining required to exploit a GE depends on where it is inserted and the architecture's downstream components. Theoretically, our GE results concern the expressivity of the augmented architecture and do not require retraining the original parameters; however, optimizing the newly available expressivity generally requires training downstream components. We demonstrate in Case Study 5, where we retrain only the affine readout of an ECG foundation model while keeping the backbone frozen. A systematic investigation of the minimum retraining required across architectures remains an interesting direction for future work.
[1] Abhinav Goel, Derek Lim, Hannah Lawrence, Stefanie Jegelka, and Ningyuan Huang. Any-Subgroup Equivariant Networks via Symmetry Breaking. arXiv:2603.19486, 2026.
Thank you for your thorough response and answers. I greatly appreciate you taking the time to answer my questions so thoroughly.
1 - Response to Reviewer qMrH
We thank the reviewer for their thoughtful review and positive assessment of the manuscript. We appreciate their recognition of the importance of symmetry slippage and the effectiveness and broad applicability of our framework for identifying and correcting it. Below, we address the reviewer’s concerns.
We thank the reviewer for their insight. We have conducted two additional experiments. The first compares a symmetry-slipped MLP, its GE-corrected counterpart, and a non-equivariant version trained with data augmentation on the Lorentz-invariant learning task of Case Study 1. As the reviewer foresaw, the augmented architecture decisively outperformed the symmetry-slipped architecture. After considerably more optimization, it still underperformed the symmetry-corrected architecture (i.e., +GE) in-distribution, and substantially underperformed out-of-distribution. This illustrates that data augmentation can provide an effective alternative to architectures exhibiting symmetry slippage, but that explicitly correcting the unintended symmetry can offer significant advantages in both training efficiency and generalization under the prescribed transformations.
We also conducted an experiment comparing GEs against three commensurably simple alternatives: canonicalization, data augmentation, and a hybrid approach described in Q1.1 below. Specifically, we considered an SO(2)-invariant learning task with a parameter λ controlling its sensitivity to reflections R∈O(2)−SO(2). As noted in our Discussion, GEs guarantee that the hypothesis class contains functions that correct the unintended symmetry, but do not guarantee that training will find such functions. To investigate whether transformation behavior in practice exploits this restored expressivity, we varied λ from 0.1 (little reflection sensitivity) to 0.9 (strong reflection sensitivity), measuring predictive performance, learned transformation behavior, and training efficiency. The details are in Appendix B.4, page 28 of the revised manuscript.
We found that the GE-corrected architecture learned approximately reflection-invariant functions when λ=0.1, but increasingly reflection-sensitive functions as λ increased, closely matching the target's transformation behavior throughout. Direct canonicalization achieved only slightly worse predictive performance, but required greater training effort; these were exacerbated for the augmentation model. These results suggest that GEs can yield transformation behavior making restored expressivity accessible to optimization in practice with lower adaptation cost.