A Novel Long Prompt Optimization Approach to Improve Reasoning Capacity of LLMs
Large Language Models (LLMs) have demonstrated significant capabilities in solving complex open-domain tasks, often guided by comprehensive prompts. However, these prompts are typically lengthy and require substantial human effort to design. We explore the application of beam search algorithms combined with the selection and mutation operators of genetic algorithms for the automatic engineering of long prompts, aiming to enhance LLM performance in complex open-domain tasks. Our study shows that a simple beam search method, coupled with selection and mutation operations performed by large models, outperforms other methods in search efficiency. Experimental results indicate that the proposed technique achieved an average accuracy gain of 7.2% across six tasks in Big-Bench Hard, highlighting the importance of automated prompt design in fully leveraging the potential of LLMs.
Authors
- Jianlin Zhong (ORCID: https://orcid.org/0000-0002-6055-6647)
- Manchang Gu
- Zhengbo Tao (ORCID: https://orcid.org/0000-0002-8133-1156)
- Zhenyu Zhang (ORCID: https://orcid.org/0000-0002-2393-520X)
- Mingjiang Xie (ORCID: https://orcid.org/0000-0002-7927-0876)
- D. Tang (ORCID: https://orcid.org/0000-0003-4259-812X)
Institutions
- Yiwu Science and Technology Research Institute (CN)
Publication Details
- Published
- 2025-02-28
- DOI
- https://doi.org/10.1109/isbdas64762.2025.11117080
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00