arXiv Machine Learning By James C. Bowden, Sergey Levine, Jennifer Listgarten

Leveraging Discrete Function Decomposability for Scientific Design

Read the original on arXiv Machine Learning →

The paper introduces Decomposition-Aware Distributional Optimization (DADO), a new algorithm that exploits decomposability in property predictors to improve in‑silico design of discrete objects such as proteins, circuits, and materials. DADO uses a soft‑factorized search distribution and graph message‑passing to coordinate optimization across linked factors defined by a junction tree over design variables. The method aims to make distributional optimization over combinatorial design spaces more efficient by leveraging the structure of the predictive model.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 23

Boltzmann-Expected Molecular Design with Decoupled Annealing Flows

arXiv:2607. 19519v1 Announce Type: cross Abstract: Most 3D properties relevant to molecular design, including free energies and shape descriptors, are $\textit{expectations}$ over the Boltzmann distribution over 3D configurations of a molecular graph.

By Selma Moqvist, Richard Beckmann, Ross Irwin, Roc\'io Mercado, Simon Olsson
arXiv Machine Learning
Aug 18

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

arXiv:2608. 15669v1 Announce Type: new Abstract: 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.

By Zhongwei Yu, Yan Song, Xue Yan, Anjie Liu, Xingyu Lu, Yihang Chen, Huichi Zhou, Siyuan Guo, Luoyang Sun, Sihan Chen, Xiangning Yu, Jun Wang