cs.LGDec 15, 2025

Informing Acquisition Functions via Foundation Models for Molecular Discovery

Authors: Qi Chen, Fabio Ramos, Alán Aspuru-Guzik, Florian Shkurti

Organizations: Department of Computer Science, University of Toronto · Data Science Institute · Vector Institute · NVIDIA Research Seattle Robotics Lab (SRL) · 

Abstract

Bayesian Optimization (BO) is a key methodology for accelerating molecular discovery by estimating the mapping from molecules to their properties while seeking the optimal candidate. Typically, BO iteratively updates a probabilistic surrogate model of this mapping and optimizes acquisition functions derived from the model to guide molecule selection. However, its performance is limited in low-data regimes with insufficient prior knowledge and vast candidate spaces. Large language models (LLMs) and chemistry foundation models offer rich priors to enhance BO, but high-dimensional features, costly in-context learning, and the computational burden of deep Bayesian surrogates hinder their full utilization. To address these challenges, we propose a likelihood-free BO method that bypasses explicit surrogate modeling and directly leverages priors from general LLMs and chemistry-specific foundation models to inform acquisition functions. Our method also learns a tree-structured partition of the molecular search space with local acquisition functions, enabling efficient candidate selection via Monte Carlo Tree Search. By further incorporating coarse-grained LLM-based clustering, it substantially improves scalability to large candidate sets by restricting acquisition function evaluations to clusters with statistically higher property values. We show through extensive experiments and ablations that the proposed method substantially improves scalability, robustness, and sample efficiency in LLM-guided BO for molecular discovery.

Figures & tables

Appendix figures & tables47 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Aug 16, 2026

Large Discovery Models: Empirically-grounded Model-Based Open-Ended Search

Scientific discovery often involves optimising expensive-to-evaluate objectives over vast, structured, and open-ended hypothesis spaces, such as molecules, protein sequences, and computer programs. Generative models such as large language models (LLMs) provide expressive priors over such spaces, but their likelihoods and self-assessments are unreliable proxies for the objectives and calibrated epistemic uncertainty, especially for novel candidates outside the observed data distribution. We introduce the Large Discovery Model (LDM), an empirically grounded recurrent architecture that couples a generative model with a Bayesian non-parametric reward surrogate model. The generative model proposes and refines candidate designs, while the surrogate predicts their performance and quantifies uncertainty, yielding an uncertainty-aware value that guides candidate generation, refinement, and selection. The discovery memory and the surrogate model are continually updated as each new experimental observation arrives. We evaluate LDM on three scenarios spanning different design modalities and objectives, including neural-network training, antibody design, and molecular optimisation. Compared to LLM-only reflection or traditional statistical search across these domains, LDM achieves a 2.4×2.4\times greater reduction in validation BPB, an 18.2%18.2\% relative decrease in binding energy, and more than 60%60\% relative gains in molecular multi-objective performance. These results suggests that LDM could serve as a general-purpose discovery engine for effective search over open-ended hypothesis spaces.
Jul 26, 2024

Small Molecule Optimization with Large Language Models

Molecular optimization, the process of designing molecules with desirable properties, represents a critical challenge in drug discovery. The recent advancements in large language models (LLMs) have opened new opportunities for their integration with traditional molecular optimization algorithms to improve performance. In this work, we propose Molecular Language Model powered Evolutionary Algorithm (Mol-E), an evolutionary algorithm that relies on the generative capabilities of LLMs trained on molecules and molecular properties. Scientific Contribution. Mol-E obtains the highest aggregate Top-10 AUC among the comparable full-23-task results considered here, scoring 17.500 in the task-agnostic regime, in which the oracle is treated strictly as a black box, and 20.551 in the task-informed regime, in which the optimizer receives a fixed semantic description of the objective. Mol-E also improves over the evaluated baselines on multi-property optimization with docking against DRD2, MK2, and AChE.
Aug 24, 2026

Closed-Loop Molecular Inverse Design with Semantic LLM Surrogates

Practical molecular inverse design is rarely a one-shot generation problem; it often involves enriching a pool of molecules that match a desired property profile under a limited oracle budget. Bayesian optimization (BO) offers a natural framework for this setting, with standard Gaussian-process (GP) surrogates operating in continuous embedding spaces. We propose LoopMol, a closed-loop framework whose large language model (LLM) surrogate reasons directly over task instructions, SMILES-level optimization histories, and oracle feedback. At each iteration, the surrogate selects informative reference molecules under an exploration--exploitation principle, optionally with a concise guidance sentence. These outputs condition the next generation round and yield an inspectable optimization trace. Experiments on six drug and material tasks across three Llamole backbones show that the LLM-based variant improves over one-shot generation and is competitive with or stronger than GP-based BO. They also reveal a domain-dependent interface: reference-only conditioning performs better on binary drug tasks, while adding a concise guidance sentence generally benefits continuous material tasks.