RoT: Enhancing Large Language Models with Reflection on Search Trees

Wenyang Hui, Kewei Tu
4/8/2024
cs.CL

No official code found. Best implementation: huiwy/reflection-on-trees (14 stars, Apache-2.0, last commit 2024-05-09).

Abstract

Large language models (LLMs) have demonstrated impressive capability in reasoning and planning when integrated with tree-search-based prompting methods. However, since these methods ignore the previous search experiences, they often make the same mistakes in the search process. To address this issue, we introduce Reflection on search Trees (RoT), an LLM reflection framework designed to improve the performance of tree-search-based prompting methods. It uses a strong LLM to summarize guidelines from previous tree search experiences to enhance the ability of a weak LLM. The guidelines are instructions about solving this task through tree search which can prevent the weak LLMs from making similar mistakes in the past search process. In addition, we proposed a novel state selection method, which identifies the critical information from historical search processes to help RoT generate more specific and meaningful guidelines. In our extensive experiments, we find that RoT significantly improves the performance of LLMs in reasoning or planning tasks with various tree-search-based prompting methods (e.g., BFS and MCTS). Non-tree-search-based prompting methods such as Chain-of-Thought (CoT) can also benefit from RoT guidelines since RoT can provide task-specific knowledge collected from the search experience.

View on arXivView PDF

Code Implementations(1)

Apache-2.0
142Shell, PythonMar 7, 20242 years agoApache-2.0

Similar Papers

Cite this paper

@article{hui2024rot,
  title  = {RoT: Enhancing Large Language Models with Reflection on Search Trees},
  author = {Wenyang Hui and Kewei Tu},
  year   = {2024},
  eprint = {2404.05449},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.05449v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.05449.svg)](https://codeofpaper.com/paper/2404.05449)

Discussion