Sample Efficient Generative Optimization for Molecular Design

• URL: http://arxiv.org/abs/2607.12488v1
• Date: Tue, 14 Jul 2026 08:22:13 GMT
• Title: Sample Efficient Generative Optimization for Molecular Design
• Abstract summary: We introduce Sample Efficient Generative Optimization (SEGO), a framework for Bayesian optimization on adaptively generated molecules.<n>SEGO attains state-of-the-art performance on the practical molecular optimization benchmark using only one tenth of the oracle calls consumed by other methods.
• Score: 3.488381738536745
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Molecular optimization in drug discovery, materials design, and catalysis requires searching vast chemical spaces under tight evaluation budgets, since high-fidelity oracles and experimental measurements are costly. The practical impact of an optimization method therefore hinges on its sample efficiency: how few evaluations it needs to find strong candidates. We introduce Sample Efficient Generative Optimization (SEGO), a framework for Bayesian optimization on adaptively generated molecules. In SEGO, a probabilistic surrogate model forms a hypothesis about where hits lie in chemical space, a generative model is steered to propose candidates in that region, the most promising candidate is selected via an acquisition function, and the resulting oracle call is used both to sharpen the surrogate and to anchor the generator in real reward. SEGO attains state-of-the-art performance on the practical molecular optimization (PMO) benchmark using only one tenth of the oracle calls consumed by other methods, and on a multiparameter docking task it reaches ten hits in roughly half the oracle calls of existing approaches. These gains move molecular optimization closer to campaigns driven by direct experimental feedback.

Related papers

• Be Your Own Teacher: Steering Protein Language Models via Unsupervised Reward Optimization [85.4863852505905]
  We introduce unsupervised reward optimization of protein language models (PLMs)<n>Our key insight is that task-agnostic rewards, which combine intrinsic model uncertainty with semantic consistency informed by protein representation models, exhibit strong correlation with controllability measures across base models and temperature regimes.<n>Our framework provides a scalable pathway toward controllable biomolecular design in settings where labeled preferences or experimental feedback are scarce or unavailable.
  arXiv  Detail & Related papers  (2026-06-17T11:42:01Z)
• P^2O: Joint Policy and Prompt Optimization [74.45293488495592]
  Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a powerful paradigm for enhancing the reasoning capabilities of Large Language Models (LLMs)<n>We propose P2O, a novel framework that synergizes Prompt Optimization with Policy Optimization.
  arXiv  Detail & Related papers  (2026-03-23T12:08:47Z)
• Sample Efficient Generative Molecular Optimization with Joint Self-Improvement [0.878320610914317]
  Generative molecular optimization aims to design molecules with properties surpassing those of existing compounds.<n>We introduce Joint Self-Improvement, which benefits from a joint generative-predictive model and a self-improving sampling scheme.<n>Joint Self-Improvement outperforms state-of-the-art methods under limited evaluation budgets.
  arXiv  Detail & Related papers  (2026-02-11T16:13:07Z)
• SEISMO: Increasing Sample Efficiency in Molecular Optimization with a Trajectory-Aware LLM Agent [0.7377073690542307]
  We introduce SEISMO, an online, inference-time molecular optimization agent.<n>It updates after every oracle call without the need for population-based or batched learning.<n>It achieves a 2-3 times higher area under the curve than prior methods, often reaching near-maximal task scores within 50 oracle calls.
  arXiv  Detail & Related papers  (2026-01-31T11:23:48Z)
• Generative Multi-Objective Bayesian Optimization with Scalable Batch Evaluations for Sample-Efficient De Novo Molecular Design [1.8517039579627974]
  This work introduces an alternative, modular "generate-then-optimize" framework for de novo molecular design/discovery.<n>We benchmark the framework against state-of-the-art latent-space and discrete molecular optimization methods.<n>Specifically, in a case study related to sustainable energy storage, we show that our approach quickly uncovers novel, diverse, and high-performing organic (quinone-based) cathode materials.
  arXiv  Detail & Related papers  (2025-12-19T14:59:27Z)
• Divergence Minimization Preference Optimization for Diffusion Model Alignment [66.31417479052774]
  Divergence Minimization Preference Optimization (DMPO) is a principled method for aligning diffusion models by minimizing reverse KL divergence.<n>DMPO can consistently outperform or match existing techniques across different base models and test sets.
  arXiv  Detail & Related papers  (2025-07-10T07:57:30Z)
• Iterative Distillation for Reward-Guided Fine-Tuning of Diffusion Models in Biomolecular Design [58.8094854658848]
  We address the problem of fine-tuning diffusion models for reward-guided generation in biomolecular design.<n>We propose an iterative distillation-based fine-tuning framework that enables diffusion models to optimize for arbitrary reward functions.<n>Our off-policy formulation, combined with KL divergence minimization, enhances training stability and sample efficiency compared to existing RL-based methods.
  arXiv  Detail & Related papers  (2025-07-01T05:55:28Z)
• Conditional Latent Space Molecular Scaffold Optimization for Accelerated Molecular Design [14.63544637436396]
  We introduce Conditional Latent Space Molecular Scaffold Optimization (CLaSMO)<n>CLaSMO integrates a Conditional Variational Autoencoder (CVAE) with Latent Space Bayesian Optimization (LSBO) to strategically modify molecules.<n>Our LSBO setting improves the sample-efficiency of the molecular optimization, and our modification approach helps us to obtain molecules with higher chances of real-world applicability.
  arXiv  Detail & Related papers  (2024-11-03T03:17:38Z)
• Enhanced Bayesian Optimization via Preferential Modeling of Abstract Properties [49.351577714596544]
  We propose a human-AI collaborative Bayesian framework to incorporate expert preferences about unmeasured abstract properties into surrogate modeling. We provide an efficient strategy that can also handle any incorrect/misleading expert bias in preferential judgments.
  arXiv  Detail & Related papers  (2024-02-27T09:23:13Z)
• An Empirical Evaluation of Zeroth-Order Optimization Methods on AI-driven Molecule Optimization [78.36413169647408]
  We study the effectiveness of various ZO optimization methods for optimizing molecular objectives. We show the advantages of ZO sign-based gradient descent (ZO-signGD) We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
  arXiv  Detail & Related papers  (2022-10-27T01:58:10Z)
• CELLS: Cost-Effective Evolution in Latent Space for Goal-Directed Molecular Generation [23.618366377098614]
  We propose a cost-effective evolution strategy in latent space, which optimize the molecular latent representation vectors. We adopt a pre-trained molecular generative model to map the latent and observation spaces. We conduct extensive experiments on multiple optimization tasks comparing the proposed framework to several advanced techniques.
  arXiv  Detail & Related papers  (2021-11-30T11:02:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.