Simplicial Message Passing for Chemical Property Prediction
Hai Lan, Xian Wei

TL;DR
This paper introduces a Simplicial Message Passing framework that enhances molecular graph neural networks by capturing complex topological information, leading to improved quantum-chemical property predictions.
Contribution
It proposes a novel SMP framework that incorporates higher-order simplices to better represent molecular structures, surpassing traditional MPNNs.
Findings
Achieved state-of-the-art results in quantum-chemical property prediction.
Higher-order simplices improve the capture of molecular topology.
Enhanced performance over traditional message-passing neural networks.
Abstract
Recently, message-passing Neural networks (MPNN) provide a promising tool for dealing with molecular graphs and have achieved remarkable success in facilitating the discovery and materials design with desired properties. However, the classical MPNN methods also suffer from a limitation in capturing the strong topological information hidden in molecular structures, such as nonisomorphic graphs. To address this problem, this work proposes a Simplicial Message Passing (SMP) framework to better capture the topological information from molecules, which can break through the limitation within the vanilla message-passing paradigm. In SMP, a generalized message-passing framework is established for aggregating the information from arbitrary-order simplicial complex, and a hierarchical structure is elaborated to allow information exchange between different order simplices. We apply the SMP…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Drug Discovery Methods · History and advancements in chemistry · Machine Learning in Materials Science
MethodsMessage Passing Neural Network
