atlas

Research map / Reinforcement learning / MDPs and planning

Retrosynthesis Planning via Worst-path Policy Optimisation in Tree-structured MDPs

NeurIPS 2025 · Reinforcement learning › MDPs and planning · approach: Robust MDP policy gradient · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Reframes multi-step retrosynthesis as worst-path optimisation in tree-structured MDPs and trains a Graph2Edits single-step policy via advantage-weighted self-imitation, achieving search-free route generation.

Problem

Multi-step retrosynthesis planning is invalid if any leaf of the synthetic tree is not a purchasable building block, yet existing methods optimise average or cumulative returns and rely on costly search at inference time.

Approach

Model retrosynthesis as a tree-structured MDP with a worst-path (min over root-to-leaf paths) objective, derive Bellman optimality results, and fine-tune a pre-trained single-step policy by advantage-weighted self-imitation of successful subtrees so it can generate routes without search.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use InterRetro with Retro* search instead of PDVN with Retro*Multi-step retrosynthesis planning · Retro*-190, 500 callssuccess rate: 98.95 -> 100.00Helped
Use InterRetro with Retro* search instead of PDVN with Retro*Multi-step retrosynthesis planning · ChEMBL-1000, 500 callssuccess rate: 83.50 -> 98.20Helped
Use InterRetro with MCTS instead of RetroCaptioner with Retro*Multi-step retrosynthesis planning · GDB17-1000, 500 callssuccess rate: 75.20 -> 99.50Helped
Use InterRetro for direct generation rather than search-based planningInterRetro · Retro*-190, ChEMBL-1000, and GDB17-1000success rate: 95.78%, 93.10%, and 89.00%Helped
Use InterRetro instead of PDVNRoute generation on the shared Retro*-190 targets · Retro*-190 test set (138 shared targets)average route length: 4.83 -> 3.92Helped
Train with 10% of the training set instead of the full set (ablation)InterRetro · Retro*-190direct-generation success rate: 92%Mixed
Add advantage weighting to imitation of successful past decisions (ablation)InterRetro · Retro*-190direct-generation success rate: 16% to more than 90%; more than 95% with β ≥ 10Helped

Surprising findings

Limitations

Experimental setup

Datasets: USPTO-50k eMolecules

Benchmarks: Retro*-190 ChEMBL-1000 GDB17-1000

Metrics: success rate average route length sample efficiency

Baselines: MCTS Retro* Self-improve PDVN GraphRetro MEGAN Graph2Edits DreamRetroer RetroCaptioner LocalRetro

Builds on: Graph2Edits Retro* Monte Carlo Tree Search advantage-weighted imitation

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy