REVIEW 3 cited by
Equivariant Frames and the Impossibility of Continuous Canonicalization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Canonicalization provides an architecture-agnostic method for enforcing equivariance, with generalizations such as frame-averaging recently gaining prominence as a lightweight and flexible alternative to equivariant architectures. Recent works have found an empirical benefit to using probabilistic frames instead, which learn weighted distributions over group elements. In this work, we provide strong theoretical justification for this phenomenon: for commonly-used groups, there is no efficiently computable choice of frame that preserves continuity of the function being averaged. In other words, unweighted frame-averaging can turn a smooth, non-symmetric function into a discontinuous, symmetric function. To address this fundamental robustness problem, we formally define and construct \emph{weighted} frames, which provably preserve continuity, and demonstrate their utility by constructing efficient and continuous weighted frames for the actions of $SO(2)$, $SO(3)$, and $S_n$ on point clouds.
Forward citations
Cited by 3 Pith papers
-
Efficient Prediction of SO(3)-Equivariant Hamiltonian Matrices via SO(2) Local Frames
By performing all feature updates in SO(2) local frames, QHNetV2 achieves SO(3)-equivariant Hamiltonian prediction without Clebsch-Gordan tensor products, with a 4.34x speedup and improved accuracy on QH9 and most MD17 tasks.
-
Equivariant Eikonal Neural Networks: Grid-Free, Scalable Travel-Time Prediction on Homogeneous Spaces
E-NES uses Lie-group point-cloud conditioning and equivariant neural fields to make grid-free eikonal travel-time prediction steerable under rotations and translations, with complete invariant features and competitive...
-
Diagonal Symmetrization of Neural Network Solvers for the Many-Electron Schr\"odinger Equation
Post hoc averaging a trained neural wavefunction over diagonal crystal symmetries improves VMC energies and symmetry, while in-training symmetrization at fixed compute can inflate gradient variance.
Discussion (0). Continue with ORCID to comment.