

















Abstract:Current computer-aided synthesis planning (CASP) methods often treat retrosynthesis as solved once a single feasible route is identified, focusing primarily on convergence or shortest-path metrics. This view is misaligned with real-world practice, where chemists must balance competing objectives such as cost, sustainability, toxicity, and overall yield. To address this, we formulate synthesis planning as a multi-objective search problem and introduce MORetro*, an algorithm that generates a Pareto front of synthesis routes to explicitly capture trade-offs among user-defined criteria. MORetro* uses weighted scalarization and BO-informed sampling to efficiently navigate the combinatorial search space and prioritize promising trade-offs. Building on multi-objective A*-search, we provide optimality guarantees showing that, for a fixed single-step model, MORetro* recovers the true Pareto front under admissibility. Across multiple retrosynthesis benchmarks, MORetro* produces diverse, high-quality Pareto fronts, uncovering solutions overlooked by single-objective approaches and better aligning CASP outputs with industrial decision-making.
| Comments: | Published in Proceedings of the 43rd International Conference on Machine Learning (ICML 2026) |
| Subjects: | Artificial Intelligence (cs.AI) |
| ACM classes: | I.2.1 |
| Cite as: | arXiv:2605.07521 [cs.AI] |
| (or arXiv:2605.07521v2 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2605.07521 arXiv-issued DOI via DataCite |
From: Friedrich Hastedt [view email]
[v1]
Fri, 8 May 2026 09:53:30 UTC (1,460 KB)
[v2]
Tue, 26 May 2026 13:27:28 UTC (2,689 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。