Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Rui-Xi Wang

dblp:400/6164 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 87% Language models and text generation · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph matching
deep graph matching
0.912025
Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning · ICML 2025
Machine learning › Graph learning
graph matching
0.912025
Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning · ICML 2025
Bioinformatics and computational biology › molecular informatics › cheminformatics
molecular machine learning
0.912025
Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning · ICML 2025
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.312025
Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning · ICML 2025

Methods — techniques the papers use, named apart from their topics

retrieval-augmented generation · 1.7neural graph matching · 1.7graph neural network · 1.7
YearPublicationVenuePosition
2025 Neural Graph Matching Improves Retrieval Augmented Generation in Molecular Machine Learning
abstract
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 27% 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.
Runzhong Wang, Rui-Xi Wang, Mrunali Manjrekar, Connor W. Coley
ICML2