-
[12/2024] 🔥 Our paper has been accepted by COLING 2025.
-
[12/2024] 🔥 We release the code for inference HotpotQA task. You can inference PreAct+TOT here.
-
[12/2024] 🔥 We introduced PreAct. Check out the paper.
Addressing the disparity between forecasts and actual results can enable individuals to expand their thought processes and stimulate self-reflection, thus promoting accurate planning. In this research, we present PreAct, an agent framework that integrates prediction, reasoning, and action. By utilizing the information derived from predictions, the large language model (LLM) agent can provide a wider range and more strategically focused reasoning. This leads to more efficient actions that aid the agent in accomplishing intricate tasks. Our experimental results show that PreAct surpasses the ReAct method in completing complex tasks and that PreAct's performance can be further improved when paired with other memory or selection strategy techniques. We presented the model with varying quantities of historical predictions and discovered that these predictions consistently enhance LLM planning. The variances in single-step reasoning between PreAct and ReAct indicate that PreAct indeed has benefits in terms of diversity and strategic orientation over ReAct.
We use LanguageAgentTreeSearch to run the HotpotQA task. We release the code for inference. You can inference PreAct+TOT with the following commands:
cd LanguageAgentTreeSearch/hotpot
bash tot.sh
⭐ We will also provide the AgentBench experiment code soon! Thanks for waiting!
Please kindly cite our paper if it helps your research:
@article{fu2024preact,
author = {Dayuan Fu and
Jianzhao Huang and
Siyuan Lu and
Guanting Dong and
Yejie Wang and
Keqing He and
Weiran Xu},
title = {PreAct: Predicting Future in ReAct Enhances Agent's Planning Ability},
journal = {CoRR},
volume = {abs/2402.11534},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.11534},
doi = {10.48550/ARXIV.2402.11534},
eprinttype = {arXiv},
eprint = {2402.11534},
timestamp = {Wed, 19 Jun 2024 17:14:13 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-11534.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}