arXiv AI

MCCE: A Framework for Multi-LLM Collaborative Search in Discrete Spaces with Similarity-Filtered Preference Learning

The paper introduces MCCE, a hybrid framework that combines a frozen closed‑source large language model (LLM) with a lightweight, trainable model for multi‑objective discrete optimization. By maintaining a trajectory memory and refining the small model through reinforcement learning, the two models jointly enhance global exploration and learning. Experiments on drug‑design benchmarks demonstrate that MCCE achieves state‑of‑the‑art Pareto front quality, outperforming existing baselines.

arXiv Machine Learning
Jul 7

On the Design Space of Discrete Diffusion Online Adaptation for Molecular Optimization

arXiv:2607. 02834v1 Announce Type: new Abstract: Molecular optimization often starts from a pretrained generative model that captures a broad prior over valid molecular structures.

By Trevor Chen, Ariel Dai, Jason Yang, Riccardo De Santi, Daniel Khalil, Wenda Chu, Nate Gruver, Pranav Murugan, Alexander F. G. Goldberg, Maruan Al-Shedivat, Yisong Yue
arXiv Machine Learning
Sep 7

Small Molecule Optimization with Large Language Models

The paper introduces Mol-E, an evolutionary algorithm that leverages large language models trained on molecular data to generate candidate molecules. Mol-E achieves state‑of‑the‑art performance on the Practical Molecular Optimization benchmark, scoring 17.500 in the task‑agnostic regime and 20.551 in the task‑informed regime. It also outperforms baseline methods in multi‑property optimization tasks involving docking against DRD2, MK2, and AChE.

By Philipp Guevorguian, Menua Bedrosian, Tigran Fahradyan, Gayane Chilingaryan, Armen Aghajanyan, Hrant Khachatrian
arXiv Machine Learning
Sep 7

Training Large Language Models for Small-Molecule Design with Synthetic Task Scaling

The paper explores how large language models (LLMs) can be trained for small-molecule drug design by using synthetic tasks that are cheaper to evaluate. By employing a curriculum that gradually increases task difficulty, the authors demonstrate that LLMs can learn design strategies that outperform larger models on structure-based lead optimization. This approach shows that scaling post‑training with synthetic tasks can effectively adapt LLMs to high‑cost experimental scenarios that are otherwise infeasible to train on directly.

By Frank Hu, Shriram Chennakesavalu, Zichen Wang, Patricia Suriana, Bodhi Vani, Kirill Shmilovich, Kangway Chuang, Colin Grambow
Hugging Face Trending Papers
5d ago

M3OS: A Monte Carlo Graph Search-Orchestrated Multi-Agent LLM System for Evidence-Traced Molecular Optimization

M3OS is a multi‑agent large‑language‑model system that separates molecular‑design reasoning from optimization‑state management using a Monte Carlo graph search. The system maintains a persistent graph of evaluated candidates, transformations, and evidence, while LLM agents use role‑specific contexts to generate and edit molecules with tool‑driven and knowledge‑guided approaches. Across three benchmarks, M3OS outperforms baselines, demonstrating the benefit of persistent search state, specialized agents, and controlled execution for multi‑constraint molecular optimization.

arXiv AI
Sep 3

WMLLM: Self-Evolving Optimization Agents via Predict-Then-Act World Modeling

WMLLM is a self‑evolving optimization‑agent framework that uses a predict‑then‑act world modeling approach. The agent first predicts promising optimization directions and then generates candidates, refining both its world model and strategy through multi‑turn refinement, population‑based search, and reinforcement learning. Experiments on black‑box tasks, particularly multi‑objective molecular optimization, demonstrate that WMLLM improves sample efficiency and achieves state‑of‑the‑art results within a limited evaluation budget.

By Zhongzheng Li, Qingsong Ran, Shikun Feng, Nian Ran, Wenhao Li, Xiaoyuan Zhang, Yue Wang, Xiaoguang Zhao