arXiv:2610.24806v1 Announce Type: cross
Abstract: Despite breakthroughs in AI-driven molecular generation, existing discovery pipelines operate largely in silico, with wet-lab feedback reserved for v...
By Zachary Cutts, John Coller, Rachel Chen, Hua Tang, Mathias Bellaiche, Ryder Easterlin, Dina Zverinski, Petar Sirkovic, Avinatan Hassidim, Yossi Matias, Pooja Rao, Annalisa Pawlosky
PMO-Dock introduces a standardized benchmark for docking‑based molecular optimization, comprising 25 tasks that span hit generation, lead optimization, and a specificity task that rewards strong on‑target binding while penalizing off‑target interactions. The protocol separates model development from final evaluation, using validation tasks for hyperparameter tuning and held‑out test tasks evaluated under a strict oracle budget to mimic realistic drug‑discovery constraints. Four diverse methods—Saturn, GenMol, Genetic‑guided GFlowNet, and ChemLlama—were benchmarked, revealing no single method dominates across all tasks and highlighting limited hyperparameter transferability, which underscores the need for method‑dependent selection strategies.
By Gor Simonyan, Tatevik Abrahamyan, Narek Abelyan, Tigran Fahradyan, Hrant Khachatrian
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:2607. 07663v1 Announce Type: new Abstract: AI systems increasingly participate in their own improvement: revising their outputs, adapting their own harnesses during deployment, training on data they generate, and, increasingly, conducting AI research itself.
By Mingguang Chen, Licheng Wang, Bo Qu
AI systems increasingly participate in their own improvement: revising their outputs, adapting their own harnesses during deployment, training on data they generate, and, increasingly, conducting AI research itself. This literature is described under a vocabulary ("self-refine," "self-reward," "self-play," "self-evolve") that conflates fundamentally different ambitions.
arXiv:2610.23791v1 Announce Type: new
Abstract: Computational drug discovery requires agents to compose scientific operations and adapt to changing evidence and constraints. Here we introduce DrugHar...
By Yuxing Chen, Zhisheng Zhang, Cheng Tang, Wei Li, Minghui Zhang, Ziyan Huang, Shaocong Wei, Jiawei Chen, Junru Hu, Hongze Zhu, Jianghan Shen, Min Cen, Xinyuan Zhu, Yaxue Zhao, Jubo Wang, Yuqiang Li, Chun-Mei Feng, Zongyuan Ge, Rui Su, Jie Xu, Yirong Chen, Xi Xu, Ming Hu
The paper introduces AIDE^2, an AI research agent that recursively improves its own code by proposing, benchmarking, and selecting modifications. Over an eight‑day autonomous run, it achieved seven successive improvements—including new search policies and memory mechanisms—that transferred to four held‑out benchmarks in machine learning, algorithm engineering, and weather forecasting. The agent’s best version matched or outperformed a top human‑engineered production research agent and also reduced reward‑hacking rates, despite never optimizing for that metric.
By Dhruv Srikanth, Bingchen Zhao, Dixing Xu, Yuxiang Wu, Zhengyao Jiang
arXiv:2610.17740v1 Announce Type: new
Abstract: Large language models (LLMs) are increasingly used to discover scientific equations from experimental data. Such a discovery system has two parts that...
By Pengze Li, Jiaquan Zhang, Encheng Su, Yunbo Long, Zihang Zeng, Xinping Liu, Han Zhang, Junchi Yu, Shixiang Tang, Aoran Wang, Xi Chen
The paper introduces a coding agent that selects and expands code edits before evaluation by scoring proposed changes using a linear readout of the parent’s performance and the edit’s features. It compares several selection strategies—including Huxley‑Gödel Machine selection, parent‑rate ablation, and calibration‑best edits—across HumanEval+ and Polyglot benchmarks, reporting held‑out performance for each. Experiments with GPT‑4o and Claude Sonnet 4.5 show that the proposed methods achieve high accuracy, with the best nodes reaching 87.0% on HumanEval+.
By Erfan Darzi, Sree Bhargavi Balija, Sheng He
arXiv:2512. 02328v2 Announce Type: replace-cross Abstract: Selecting an effective docking algorithm is highly context-dependent, and no single method performs reliably across structural, chemical, and protocol regimes.
By Jiabao Brad Wang, Siyuan Cao, Hongxuan Wu, Yiliang Yuan, Mustafa Misir
arXiv:2608. 13951v1 Announce Type: new Abstract: Scaling agent capability has largely focused on improving the model, yet an interactive agent acts through a runtime harness that mediates context, tools, control flow, and stopping.
By Tianyu Fan, Chao Huang
arXiv:2606. 28471v1 Announce Type: new Abstract: Model capability is the central variable in LLM pre-training, yet is never observed directly: data shapes it prospectively, while evaluation reveals it only retrospectively, compressing samples, prompts, decoding, and scoring rules into one noisy score.
By Zhixuan Li, Jiangan Yuan, Han Xu