Equivariant GNN
An equivariant graph neural network preserves known geometric transformations in its outputs. For molecular modeling, this usually means rotations and translations of coordinates should transform predictions consistently.
For coordinate outputs, SE(3) equivariance requires:
where is a set of coordinates, is a rotation, and is a translation.
For node coordinates , write the transform as:
An equivariant GNN layer can combine invariant scalar messages with equivariant vector updates:
The scalar message stays invariant while the coordinate delta rotates with the input.
Layer Contract
An equivariant GNN layer should state:
| Component | Expected Behavior |
|---|---|
| scalar node features | invariant to global rigid motion |
| coordinates | transform by rotation and translation |
| relative vector | rotates, does not translate |
| distance | invariant |
| vector output | equivariant |
| scalar readout | invariant |
The architecture is only as equivariant as the features and preprocessing supplied to it.
Common Variants
| Variant | Main Idea | Caveat |
|---|---|---|
| scalar-distance message passing | use invariant distances and scalar messages | may lose orientation or chirality |
| coordinate-update networks | move points using relative vectors | stability and unit scale matter |
| tensor/irreducible representation models | carry higher-order geometric features | more complex and expensive |
| equivariant attention | attention over scalar and geometric features | masking, frames, and pair features define symmetry |
| local-frame models | represent geometry in residue or pocket frames | frame construction can leak or break equivariance |
Representative Paper Notes
| Note | Why it matters |
|---|---|
| [[papers/architectures/tensor-field-networks | Tensor Field Networks]] |
| [[papers/architectures/se3-transformer | SE(3)-Transformer]] |
| [[papers/architectures/egnn | EGNN]] |
| [[papers/architectures/painn | PaiNN]] |
| [[papers/architectures/nequip | NequIP]] |
Role in Molecular Modeling
- Encode atoms, residues, and interactions as graphs.
- Respect 3D geometry in protein and ligand structures.
- Support coordinate prediction, pose refinement, and structure-aware ranking.
Invariant vs Equivariant Readouts
- Scalar readout: pool invariant node features for affinity, energy, class, or ranking.
- Vector readout: predict forces, score fields, or velocity fields.
- Coordinate readout: refine poses, conformers, backbone coordinates, or generated structures.
- Pair readout: predict distances, contacts, interactions, or edge labels.
Failure Modes
- Graph edges are built from future or label-dependent geometry.
- Protein and ligand graphs leak the known bound pose into a screening setting.
- Atom or residue order changes without permutation-safe aggregation.
- Chirality or stereochemistry is lost in graph features while the task depends on it.
- Reported performance comes from random splits rather than scaffold, protein-family, or complex-level splits.
- The model is called equivariant but only the coordinate update, not the full pipeline, is equivariant.
- Reflection behavior is mismatched with chirality-sensitive molecular tasks.
- Evaluation aligns outputs in a way that hides frame or permutation errors.
Design Checks
- Which quantities are invariant and which are equivariant?
- Are edge features local, global, or both?
- Does the model preserve the symmetries needed by flow matching or docking?
- Are node and edge updates using relative geometry rather than absolute coordinates?
- Does the readout match the target: scalar score, vector field, coordinates, or pose?
- Is graph construction fit only from inputs available at inference time?
- Are stereochemistry, protonation, conformer source, and coordinate units specified?
- Is equivariance tested by applying random rigid transforms to the same input?
- Are atom/residue mappings and symmetry corrections fixed before evaluation?