Pith. sign in

REVIEW 1 cited by

Molecule Graph Networks with Many-body Equivariant Interactions

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 2406.13265 v3 pith:CO33XZOF submitted 2024-06-19 cs.LG cond-mat.mtrl-sci

Molecule Graph Networks with Many-body Equivariant Interactions

classification cs.LG cond-mat.mtrl-sci
keywords equivariantinteractionsmany-bodymessagenetworkspassingaccuracydirectional
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

Message passing neural networks have demonstrated significant efficacy in predicting molecular interactions. Introducing equivariant vectorial representations augments expressivity by capturing geometric data symmetries, thereby improving model accuracy. However, two-body bond vectors in opposition may cancel each other out during message passing, leading to the loss of directional information on their shared node. In this study, we develop Equivariant N-body Interaction Networks (ENINet) that explicitly integrates l = 1 equivariant many-body interactions to enhance directional symmetric information in the message passing scheme. We provided a mathematical analysis demonstrating the necessity of incorporating many-body equivariant interactions and generalized the formulation to $N$-body interactions. Experiments indicate that integrating many-body equivariant representations enhances prediction accuracy across diverse scalar and tensorial quantum chemical properties.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Computationally-efficient Graph Modeling with Refined Graph Random Features

    cs.LG 2025-10 conditional novelty 6.0

    Stitching several short random walks into a product of unbiased feature matrices approximates graph node kernels with less variance and better long-range coverage than single long walks.