Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Wang, Runzhong, Wang, Rui-Xi, Manjrekar, Mrunali, Coley, Connor W.
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913923338338304
author Wang, Runzhong
Wang, Rui-Xi
Manjrekar, Mrunali
Coley, Connor W.
author_facet Wang, Runzhong
Wang, Rui-Xi
Manjrekar, Mrunali
Coley, Connor W.
contents Molecular machine learning has gained popularity with the advancements of geometric deep learning. In parallel, retrieval-augmented generation has become a principled approach commonly used with language models. However, the optimal integration of retrieval augmentation into molecular machine learning remains unclear. Graph neural networks stand to benefit from clever matching to understand the structural alignment of retrieved molecules to a query molecule. Neural graph matching offers a compelling solution by explicitly modeling node and edge affinities between two structural graphs while employing a noise-robust, end-to-end neural network to learn affinity metrics. We apply this approach to mass spectrum simulation and introduce MARASON, a novel model that incorporates neural graph matching to enhance a fragmentation-based neural network. Experimental results highlight the effectiveness of our design, with MARASON achieving 28% top-1 accuracy, a substantial improvement over the non-retrieval state-of-the-art accuracy of 19%. Moreover, MARASON outperforms both naive retrieval-augmented generation methods and traditional graph matching approaches. Code is publicly available at https://github.com/coleygroup/ms-pred
format Preprint
id arxiv_https___arxiv_org_abs_2502_17874
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning
Wang, Runzhong
Wang, Rui-Xi
Manjrekar, Mrunali
Coley, Connor W.
Machine Learning
Quantitative Methods
Molecular machine learning has gained popularity with the advancements of geometric deep learning. In parallel, retrieval-augmented generation has become a principled approach commonly used with language models. However, the optimal integration of retrieval augmentation into molecular machine learning remains unclear. Graph neural networks stand to benefit from clever matching to understand the structural alignment of retrieved molecules to a query molecule. Neural graph matching offers a compelling solution by explicitly modeling node and edge affinities between two structural graphs while employing a noise-robust, end-to-end neural network to learn affinity metrics. We apply this approach to mass spectrum simulation and introduce MARASON, a novel model that incorporates neural graph matching to enhance a fragmentation-based neural network. Experimental results highlight the effectiveness of our design, with MARASON achieving 28% top-1 accuracy, a substantial improvement over the non-retrieval state-of-the-art accuracy of 19%. Moreover, MARASON outperforms both naive retrieval-augmented generation methods and traditional graph matching approaches. Code is publicly available at https://github.com/coleygroup/ms-pred
title Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning
topic Machine Learning
Quantitative Methods
url https://arxiv.org/abs/2502.17874