Pith. sign in

REVIEW 1 cited by

SE(3) Equivariant Graph Neural Networks with Complete Local Frames

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

arxiv 2110.14811 v2 pith:KTUTNFJF submitted 2021-10-26 cs.CE cs.AIcs.LGmath.DGphysics.app-ph

classification cs.CEcs.AIcs.LGmath.DGphysics.app-ph
keywords equivariantneuralframesnetworkscomputationalgraphlocalbeen
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Group equivariance (e.g. SE(3) equivariance) is a critical physical symmetry in science, from classical and quantum physics to computational biology. It enables robust and accurate prediction under arbitrary reference transformations. In light of this, great efforts have been put on encoding this symmetry into deep neural networks, which has been shown to improve the generalization performance and data efficiency for downstream tasks. Constructing an equivariant neural network generally brings high computational costs to ensure expressiveness. Therefore, how to better trade-off the expressiveness and computational efficiency plays a core role in the design of the equivariant deep learning models. In this paper, we propose a framework to construct SE(3) equivariant graph neural networks that can approximate the geometric quantities efficiently. Inspired by differential geometry and physics, we introduce equivariant local complete frames to graph neural networks, such that tensor information at given orders can be projected onto the frames. The local frame is constructed to form an orthonormal basis that avoids direction degeneration and ensure completeness. Since the frames are built only by cross product operations, our method is computationally efficient. We evaluate our method on two tasks: Newton mechanics modeling and equilibrium molecule conformation generation. Extensive experimental results demonstrate that our model achieves the best or competitive performance in two types of datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification with Equivariant Neural Networks

    cs.LG 2025-01 conditional novelty 6.0 of 10

    SIDDA dynamically tunes Sinkhorn divergence regularization and loss weights during training, improving target-domain accuracy and calibration in image classification across simulated, galaxy, and remote-sensing datasets.

Pith tools