Sample Efficient Generative Molecular Optimization with Joint Self-Improvement
Not on the map. Why?
Abstract (arXiv)
Generative molecular optimization aims to design molecules with properties surpassing those of existing compounds. However, such candidates are rare and expensive to evaluate, yielding sample efficiency essential. Additionally, surrogate models introduced to predict molecule evaluations, suffer from distribution shift as optimization drives candidates increasingly out-of-distribution. To address these challenges, we introduce Joint Self-Improvement, which benefits from (i) a joint generative-predictive model and (ii) a self-improving sampling scheme. The former aligns the generator with the surrogate, alleviating distribution shift, while the latter biases the generative part of the joint model using the predictive one to efficiently generate optimized molecules at inference-time. Experiments across offline and online molecular optimization benchmarks demonstrate that Joint Self-Improvement outperforms state-of-the-art methods under limited evaluation budgets.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 35 of its 51 references that are in the map. First posted on arXiv 11 Feb 2026.
Builds on
35 of 51 references.
References · 35
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 762
- 2018Junction Tree Variational Autoencoder for Molecular Graph Generationcited by 647
- 2019Your Classifier is Secretly an Energy Based Model and You Should Treat it Like Onecited by 402
- 2020GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generationcited by 301
- 2021GFlowNet Foundationscited by 286
- 2022Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equationscited by 273
- 2019Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacementcited by 205
- 2021GraphDF: A Discrete Flow Model for Molecular Graph Generationcited by 177
- 2019On the Theory of Policy Gradient Methods: Optimality, Approximation, and Distribution Shiftcited by 174
- 2022Hybrid RL: Using Both Offline and Online Data Can Make RL Efficientcited by 158
23 more
- 2022Sample Efficiency Matters: A Benchmark for Practical Molecular Optimizationcited by 151
- 2020Sample-Efficient Optimization in the Latent Space of Deep Generative Models via Weighted Retrainingcited by 121
- 2024A Review of Large Language Models and Autonomous Agents in Chemistrycited by 96
- 2022Exploring Chemical Space with Score-based Out-of-distribution Generationcited by 95
- 2021Conservative Objective Models for Effective Offline Model-Based Optimizationcited by 87
- 2022On Reinforcement Learning and Distribution Matching for Fine-Tuning Language Models with no Catastrophic Forgettingcited by 80
- 2022Local Latent Space Bayesian Optimization over Structured Inputscited by 78
- 2021Hit and Lead Discovery with Explorative RL and Fragment-based Molecule Generationcited by 68
- 2019Generalized Variational Inference: Three arguments for deriving new Posteriorscited by 57
- 2022Reinforcement Learning with Sparse Rewards using Guidance from Offline Demonstrationcited by 54
- 2019Hybrid Models with Deep and Invertible Featurescited by 41
- 2022LIMO: Latent Inceptionism for Targeted Molecule Generationcited by 40
- 2024Genetic-guided GFlowNets for Sample Efficient Molecular Optimizationcited by 36
- 2024Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvementcited by 32
- 2022Data-Driven Offline Decision-Making via Invariant Representation Learningcited by 31
- 2025On a few pitfalls in KL divergence gradient estimation for RLcited by 27
- 2020Incremental Sampling Without Replacement for Sequence Modelscited by 23
- 2023Bootstrapped Training of Score-Conditioned Generator for Offline Design of Biological Sequencescited by 23
- 2023Drug Discovery with Dynamic Goal-aware Fragmentscited by 19
- 2024Offline Model-Based Optimization by Learning to Rankcited by 13
- 2024Revisiting Sparse Rewards for Goal-Reaching Reinforcement Learningcited by 12
- 2024GraphXForm: Graph transformer for computer-aided molecular designcited by 6
- 2025Synergistic Benefits of Joint Molecule Generation and Property Predictioncited by 5
Built on by
Not cited yet.