arXiv AI

Agents on a Tree: Pathwise Coordination for Multi-Objective Molecular Optimization

arXiv:2606. 00008v1 Announce Type: new Abstract: Multi-objective molecular optimization requires searching vast chemical spaces under conflicting objectives, where early design decisions strongly constrain downstream outcomes.

arXiv AI
Aug 13

A Modular Agentic Framework for Synthetically Constrained Multi-Objective Hit-to-Lead Optimization

arXiv:2608. 11483v1 Announce Type: new Abstract: Hit-to-lead optimization requires iterative design of hit analogs across competing potency, selectivity, physicochemical, pharmacokinetic, safety, and synthetic constraints.

By Kelvin P. Idanwekhai, Enes Kelestemur, Benjamin Strickland, Matthew Hart, Steini Davidsson, Angelos Angelopoulos, Ron Alterovitz, Marcello DeLuca, Alexander Tropsha
arXiv AI
Sep 24

MolDesignBench: Evaluating LLM-based Agent for Scenario-grounded Molecular Design

MolDesignBench is a new benchmark for evaluating large language model (LLM)-based agents in scenario‑grounded molecular design. It contains 2,000 generation and optimization tasks that blend implicit narrative requirements with explicit property and functional‑group constraints, including infeasible cases, and require the use of 17 specialized chemistry tools. Experiments with leading LLMs show low success rates (best ~43%) and highlight failures in implicit‑constraint reasoning, infeasibility detection, and tool usage, underscoring the benchmark’s role in identifying key bottlenecks for future research.

By Yongjun Jeong, Hanbum Ko, Ye Rin Kim, Chanhui Lee, Rodrigo Hormazabal, Jaewan Lee, Sehui Han, Sungbin Lim, Sungwoong Kim
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 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
Jun 16

Generative Molecular Design with Steerable and Granular Synthesizability Control

arXiv:2505. 08774v2 Announce Type: replace-cross Abstract: Designing molecules that are both property-optimal and readily synthesizable is a central challenge in drug discovery.

By Jeff Guo, V\'ictor Sabanza-Gil, Olha Semenenko, Oleksii Hrabovskyi, Mykola Protopopov, Anna Kapeliukha, Oleksandr Mosia, Sofiia Hatych, Diana Alieksieieva, Tom Nelis, Patrick Molliet, Helena Sol\'e-\`Avila, Valentas Olikauskas, Nina Aregger, Irina Morozova, Joseph Schmidt, Zlatko Jon\v{c}ev, Olga Tarkhanova, Petro Borysko, Jerome Waser, Bruno Correia, Jeremy Luterbacher, Philippe Schwaller
arXiv AI
Aug 19

Leveraging generative hallucination and biophysics-informed modeling for unified biomolecular sequence-structure co-design

The paper introduces MCTH (Monte Carlo Tree Hallucination), an inference-only framework that performs all‑atom biomolecular sequence‑structure co‑design by treating pretrained folding and inverse‑folding models as black‑box operators. MCTH uses Monte Carlo Tree Search to allocate a fixed inference budget across competing design trajectories, incorporating model confidence, uncertainty, and cross‑expert consensus. Experiments across protein‑RNA, protein‑DNA, protein‑protein, and protein‑ligand design show that adaptive search outperforms simpler sampling strategies, and evaluations with AlphaFold3 and Chai‑1 demonstrate transferability beyond the search‑time oracle.

By Xuefeng Liu, Mingxuan Cao, Xiao Luo, Songhao Jiang, Tobin Sosnick, Jinbo Xu, Louis Maher, Rick Stevens
arXiv AI
Jun 2

Probe Before You Edit: Probing-Guided Molecular Optimization for LLM Agents in Structure-Based Drug Design

arXiv:2606. 00555v1 Announce Type: new Abstract: Structure-based drug design increasingly employs LLM agents to iteratively refine ligands against a target pocket, yet a viable ligand must satisfy two often-conflicting objectives -- binding affinity and druggability -- which single optimization steps rarely improve together.

By Zaifei Yang, Weiyu Chen, Yaqing Wang, James Kwok
arXiv AI
Sep 15

El Agente Potente: High-Throughput Agentic Atomistic Simulations

El Agente Potente is an agentic system that integrates typed execution graphs and a coding mode to facilitate machine‑learning interatomic potential (MLIP) driven atomistic simulations. Typed execution graphs offer structured, provenance‑aware workflows where large language models handle planning and routing while deterministic Python code performs scientific computation and validation. The coding agent builds customized workflows for tasks needing procedural flexibility, invoking existing Potente functions for supported calculations. The system is demonstrated across materials discovery, energy‑landscape exploration, adsorption, and catalytic reaction workflows, with benchmarks on reproducibility and LLM token cost.

By Tsz Wai Ko, Jiaru Bai, Thomas Swanick, Yeonghun Kang, Changhyeok Choi, Angelina Qihong Jiang, Aiwei Yin, Varinia Bernales, Al\'an Aspuru-Guzik