AOT*: Efficient Synthesis Planning via LLM-Empowered AND-OR Tree Search (2026.findings-acl)
Copied to clipboard
| Challenge: | Experimental evaluation shows that AOT* achieves competitive solve rates using 3-5 fewer iterations than existing LLM-based approaches. |
| Approach: | They propose a framework that integrates LLM-generated chemical synthesis pathways with systematic AND-OR tree search. |
| Outcome: | Experimental results show that AOT* improves search efficiency and solves faster than existing approaches. |
Similar Papers
R3: End-to-End Reasoning-based Planning for Multi-step Retrosynthesis via Reinforcement Learning (2026.acl-long)
Copied to clipboard
YiFei Wang, Qizhi Pei, Jiangtao Feng, Yuntian Shi, Yi Duan, Lihao Wang, Lei Bai, Lijun Wu, Wei-Ying Ma, Hao Zhou
| Challenge: | Experimental results show that R3 is a superior alternative to traditional search algorithms for multistep retrosynthesis planning. |
| Approach: | They propose a framework that reformulates multistep retrosynthetic planning as a generative reasoning task. |
| Outcome: | The proposed framework achieves state-of-the-art Top-1 accuracy of 43.7% on retrobench . it leverages Large Language Models to reformulate multistep retrosynthesis as a generative reasoning task. |
Optimizing Instruction Synthesis: Effective Exploration of Evolutionary Space with Tree Search (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Extensive research has highlighted the quality of instruction data is essential for the success of this alignment. |
| Approach: | They propose a framework for iteratively improving existing instruction data by using Monte Carlo tree search to find suitable prompts that align the language model to effectively learn multiple skills. |
| Outcome: | The proposed framework improves the evaluation scores of seed instruction data, raising the average evaluation scores from 2.19 to 3.81. |
LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing path planning algorithms suffer from significant computational and memory inefficiencies as the state space grows . large language models excel in environmental analysis but fall short in detailed spatial and temporal reasoning . |
| Approach: | They propose a new path planning method that synergistically combines A* and LLMs to improve pathfinding efficiency. |
| Outcome: | The proposed method improves pathfinding efficiency while maintaining integrity of path validity in large-scale scenarios. |
SGA-MCTS: Decoupling Planning from Execution via Training-Free Atomic Experience Retrieval (2026.findings-acl)
Copied to clipboard
| Challenge: | a new framework casts LLM planning as non-parametric retrieval, but high latency of inference-time search and supervised fine-tuning are limitations. |
| Approach: | They propose a framework that casts LLM planning as non-parametric retrieval . they leverage Monte Carlo Tree Search to explore the solution space . |
| Outcome: | Empirical results show that SGA-MCTS can match the performance of SOTA systems without task-specific fine-tuning. |
A Survey of Large Language Models for Text-Guided Molecular Discovery: From Molecule Generation to Optimization (2026.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) are introducing a paradigm shift in molecular discovery by enabling text-guided interaction with chemical spaces through natural language and symbolic notations. |
| Approach: | They analyze the current LLM learning paradigms to tackle four critical evaluation dimensions that have emerged as critical dimensions in recent studies. |
| Outcome: | The proposed models are able to interact with chemical spaces through natural language and symbolic notations, and have emerging extensions to incorporate multi-modal inputs. |
WebSynthesis: World Model-Guided Monte Carlo Tree Search for Efficient WebAgent Trajectory Synthesis (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models have enabled increasingly capable web agents . however, training such agents at scale still relies on high-quality interaction trajectories that are difficult to obtain at scale. |
| Approach: | They propose a framework for scalable trajectory synthesis that simulates state transitions without network dependencies and integrates Monte Carlo Tree Search to enable reversible exploration over the simulated state space. |
| Outcome: | Experiments on WebArena, WebVoyager, and Mind2Web-Online show that agents trained exclusively on synthesized trajectories outperform those trained on real-world data. |
RaDA: Retrieval-augmented Web Agent Planning with LLMs (2024.findings-acl)
Copied to clipboard
| Challenge: | Agents powered by large language models inherit important limitations such as the restricted context length, dependency on human-engineered exemplars, and insufficient generalization. |
| Approach: | They propose a novel planning method for Web agents that disentangles planning into two stages: for a new given task, it decomposes tasks into high-level subtasks; and then iteratively synthesizes actions based on dynamically retrieved exemplars. |
| Outcome: | The proposed method decomposes tasks into high-level subtasks and iteratively synthesizes actions based on dynamically retrieved exemplars. |
Programming over Thinking: Efficient and Robust Multi-Constraint Planning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing large language model approaches lack flexibility in multi-constraint planning . SCOPE achieves state-of-the-art performance while lowering cost and latency . |
| Approach: | They propose a framework that disentangles query-specific problem reasoning from generic code execution. |
| Outcome: | The Scalable Code Planning Engine achieves state-of-the-art performance while lowering cost and latency. |
PlanE: Meta Planning of Data, Tuning, and Inference for Extractive-based LLMs (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for optimizing LLMs for task-specific tasks are limited due to the sheer volume of data. |
| Approach: | They propose a Planning framework for constructing Extractive-based LLMs called PlanE . they propose 'data decomposition', instruction tuning, prompt inference and a 'Data-Tuning-Inference' planner . |
| Outcome: | The proposed framework improves performance across different datasets and on different dataset. |
ChemActor: Enhancing Automated Extraction of Chemical Synthesis Actions with LLM-Generated Data (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for extracting chemical procedures from literature are insufficient and low-quality due to the inherent ambiguity of chemical language and the high cost of human annotation. |
| Approach: | They propose a fully fine-tuned large language model (LLM) as a chemical executor to convert between unstructured experimental procedures and structured action sequences. |
| Outcome: | The proposed model outperforms the baseline model on R2D and D2A tasks by 10%. |