mlsanityData to 7 Oct 2026

Molecular Hypergraph Neural Networks

arXiv 2312.13136 ↗First posted 20 Dec 2023physics.chem-ph cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Graph neural networks (GNNs) have demonstrated promising performance across various chemistry-related tasks. However, conventional graphs only model the pairwise connectivity in molecules, failing to adequately represent higher-order connections like multi-center bonds and conjugated structures. To tackle this challenge, we introduce molecular hypergraphs and propose Molecular Hypergraph Neural Networks (MHNN) to predict the optoelectronic properties of organic semiconductors, where hyperedges represent conjugated structures. A general algorithm is designed for irregular high-order connections, which can efficiently operate on molecular hypergraphs with hyperedges of various orders. The results show that MHNN outperforms all baseline models on most tasks of OPV, OCELOTv1 and PCQM4Mv2 datasets. Notably, MHNN achieves this without any 3D geometric information, surpassing the baseline model that utilizes atom positions. Moreover, MHNN achieves better performance than pretrained GNNs under limited training data, underscoring its excellent data efficiency. This work provides a new strategy for more general molecular representations and property prediction tasks related to high-order connections.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 29 of its 59 references that are in the map. First posted on arXiv 20 Dec 2023.

Builds on

29 of 59 references.

References · 29

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2018How Powerful are Graph Neural Networks?cited by 4,355
  5. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  6. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  7. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  8. 2021How Attentive are Graph Attention Networks?cited by 818
  9. 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 751
  10. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
  11. 2021E(3)-Equivariant Graph Neural Networks for Data-Efficient and Accurate Interatomic Potentialscited by 701
  12. 2017SchNet: A continuous-filter convolutional neural network for modeling quantum interactionscited by 569
17 more
  1. 2020Directional Message Passing for Molecular Graphscited by 556
  2. 2022MACE: Higher Order Equivariant Message Passing Neural Networks for Fast and Accurate Force Fieldscited by 467
  3. 2019Analyzing Learned Molecular Representations for Property Predictioncited by 373
  4. 2021OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphscited by 328
  5. 2019Hypergraph Convolution and Hypergraph Attentioncited by 226
  6. 2021ChemRL-GEM: Geometry Enhanced Molecular Representation Learning for Property Predictioncited by 204
  7. 2022Pure Transformers are Powerful Graph Learnerscited by 188
  8. 2022Graph neural networks for materials science and chemistrycited by 181
  9. 2021Geometric Deep Learning on Molecular Representationscited by 113
  10. 2021Graph Representation Learning in Biomedicinecited by 79
  11. 2018Molecular Hypergraph Grammar with its Application to Molecular Optimizationcited by 56
  12. 2022Equivariant Hypergraph Diffusion Neural Operatorscited by 45
  13. 2021Edge Representation Learning with Hypergraphscited by 37
  14. 2018Message-passing neural networks for high-throughput polymer screeningcited by 30
  15. 2022Augmentations in Hypergraph Contrastive Learning: Fabricated and Generativecited by 28
  16. 2022HyGNN: Drug-Drug Interaction Prediction via Hypergraph Neural Networkcited by 16
  17. 2022A Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddingscited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 1; 2026: 2.

7 papers.