arXiv AI

AutoNovo: Agentic Program Search Discovers Transferable Nucleic Acid Design Algorithms

arXiv AI
Oct 31

MoLRSI: A Recursive Self-Improving AI agent for Molecular Discovery

MoLRSI is a recursive self‑improving AI agent designed for molecular discovery that optimizes both workflow and model architecture using persistent cross‑task memory. It refines its search policy based on workflow performance, refinement outcomes, and execution feedback, enabling continuous improvement. In antibiotic discovery, MoLRSI achieved a 15.9% experimental hit rate versus 8.7% for an expert‑led workflow, and in de novo peptide‑MHC binder design it produced eight validated hits with preferential binding, outperforming a baseline approach.

By Yikun Zhang, Xiwei Cheng, Mingze Yuan, Yu Zhang, Brian Shim, Aarti Krishnan, Daniel Rosen, Kunyang Sun, Yingze Wang, Zhenfeng Deng, Botao Yu, Bingxu Liu, David Liu, Tianyu Liu, Yuanqi Du, Nir Hacohen, James J. Collins, Wengong Jin
arXiv AI
Aug 10

Strategy-first synthesis planning for complex natural products

arXiv:2608. 07454v1 Announce Type: cross Abstract: The total synthesis of a complex molecule is among the most demanding intellectual and experimental feats in chemistry: a chemist must plan many steps ahead for how to assemble simple building blocks into an intricate target, devise backup strategies, and anticipate procedural challenges.

By Daniel Armstrong, Xuan-Vu Nguyen, Octavian Susanu, Gabriel Gibberd, Th\'eo A. Neukomm, Tadd\"aus Strunden, Dan Forster, Morgane Delattre, Shawn Teh, Cl\'ement Rols, John Federice, Hayden Leatherwood, M. Lavelle Barnes, Maarten R. Dobbelaere, Peter Wipf, Jon T. Njardarson, Jieping Zhu, Philippe Schwaller
arXiv AI
Aug 28

AgentFold: Closed-Loop Agentic Search for Protein Folding Model Design

AgentFold is a multi‑agent framework that treats protein‑folding model design as a closed‑loop search over executable code variants. Starting from the ESMFold codebase, the agents generate hypotheses, modify and debug code, evaluate model variants, and store both successes and failures in structured memory, guided by an MCTS‑style policy that allocates GPU resources. In an engineering‑scale experiment, AgentFold explored about 80 variants using 5,000 GPU‑hours and 170 million LLM tokens, improving the best lDDT score by 7.5% over independent Codex proposals and outperforming a random‑search baseline, while also uncovering empirical design patterns such as the benefits of early, soft, learnable priors.

By Mingquan Liu, Jiangyu Chen, Hanqun Cao, Xujun Zhang, Pengsen Ma, Xiangru Tang, Shuting Jin, Zhuo Yang, Tianfan Fu, Fang Wu, Xiangxiang Zeng
arXiv Machine Learning
Sep 25

EvoTreeNAD: Genealogy-Guided Evolution for LLM-Driven Neural Architecture Discovery

EvoTreeNAD is a genealogy‑guided evolutionary algorithm that autonomously discovers neural architectures without a predefined seed or search space. Starting from an empty root, it builds a persistent genealogy where each node represents a complete architecture; top‑percentile values from nodes and descendants steer lineage selection. The method combines an Idea Agent that proposes variants and a Code Agent that implements them, with theoretical analysis showing stationary variation regimes and empirical results demonstrating superior performance on CIFAR‑10/100 and MedMNIST‑v2 tasks.

By Lishan Yu, Derek Jiu, Qizhen Lan, Xiaoqian Jiang
arXiv Machine Learning
Oct 28

Organon : From Evolutionary Search to Recursive Self-Improving Agents for Scientific Discovery

Organon is a recursively self‑improving agent designed for scientific discovery that autonomously revises its search strategies, population management, diagnostics, memory, and worker coordination during execution. By diagnosing and correcting its own adaptation procedures, the agent continuously refines the mechanisms guiding its future self‑improvement. Across 21 computational discovery tasks—including algorithm design, GPU kernel optimization, and systems optimization—Organon outperforms competing frameworks, achieving a 20.5% mean performance gain on ALE‑Bench Lite and up to 1.67× speedups on KernelBench.

By Cheikh Ahmed, Zhiyu Zhang, Kun Mao, Yong Zhang, Zirui Zhou