GP-MoLFormer-Sim: Test Time Molecular Optimization through Contextual Similarity Guidance
Not on the map. Why?
Abstract (arXiv)
The ability to design molecules while preserving similarity to a target molecule and/or property is crucial for various applications in drug discovery, chemical design, and biology. We introduce in this paper an efficient training-free method for navigating and sampling from the molecular space with a generative Chemical Language Model (CLM), while using the molecular similarity to the target as a guide. Our method leverages the contextual representations learned from the CLM itself to estimate the molecular similarity, which is then used to adjust the autoregressive sampling strategy of the CLM. At each step of the decoding process, the method tracks the distance of the current generations from the target and updates the logits to encourage the preservation of similarity in generations. We implement the method using a recently proposed ~47M parameter SMILES-based CLM, GP-MoLFormer, and therefore refer to the method as GP-MoLFormer-Sim, which enables a test-time update of the deep generative policy to reflect the contextual similarity to a set of guide molecules. The method is further integrated into a genetic algorithm (GA) and tested on a set of standard molecular optimization benchmarks involving property optimization, molecular rediscovery, and structure-based drug design. Results show that, GP-MoLFormer-Sim, combined with GA (GP-MoLFormer-Sim+GA) outperforms existing training-free baseline methods, when the oracle remains black-box. The findings in this work are a step forward in understanding and guiding the generative mechanisms of CLMs.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 34 references that are in the map. First posted on arXiv 5 Jun 2025.
Builds on
22 of 34 references.
References · 22
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 765
- 2018Junction Tree Variational Autoencoder for Molecular Graph Generationcited by 652
- 2021Flow Network based Generative Models for Non-Iterative Diverse Candidate Generationcited by 392
- 2021GFlowNet Foundationscited by 290
- 2017Molecular De Novo Design through Deep Reinforcement Learningcited by 267
- 2021Therapeutics Data Commons: Machine Learning Datasets and Tasks for Drug Discovery and Developmentcited by 264
- 2024Programming Refusal with Conditional Activation Steeringcited by 206
- 2018Optimization of Molecules via Deep Reinforcement Learningcited by 200
- 2022Sample Efficiency Matters: A Benchmark for Practical Molecular Optimizationcited by 155
- 2022Exploring Chemical Space with Score-based Out-of-distribution Generationcited by 95
- 2023Reward-Augmented Decoding: Efficient Controlled Text Generation With a Unidirectional Reward Modelcited by 79
- 2024Efficient Evolutionary Search Over Chemical Space with Large Language Modelscited by 61
10 more
- 2023DrugAssist: A Large Language Model for Molecule Optimizationcited by 59
- 2020Learning To Navigate The Synthetically Accessible Chemical Space Using Reinforcement Learningcited by 57
- 2020BOSS: Bayesian Optimization over String Spacescited by 54
- 2020Guiding Deep Molecular Optimization with Genetic Explorationcited by 51
- 2020Optimizing Molecules using Efficient Queries from Property Evaluationscited by 50
- 2021Amortized Tree Generation for Bottom-up Synthesis Planning and Synthesizable Molecular Designcited by 44
- 2024Genetic-guided GFlowNets for Sample Efficient Molecular Optimizationcited by 39
- 2017Application of generative autoencoder in de novo molecular designcited by 32
- 2023Drug Discovery with Dynamic Goal-aware Fragmentscited by 19
- 2024Large Language Models can be Strong Self-Detoxifierscited by 7
Built on by
Citing papers per year: 2026: 2.
2 papers.