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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel Long Prompt Optimization Approach to Improve Reasoning Capacity of LLMs

Jianlin Zhong, Manchang Gu, Zhengbo Tao, Zhenyu Zhang et al.
Scheduling and Optimization Algorithms
article

A Novel Long Prompt Optimization Approach to Improve Reasoning Capacity of LLMs

Jianlin Zhong, Manchang Gu, Zhengbo Tao, Zhenyu Zhang, Mingjiang Xie, D. Tang
article en

Abstract

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.

Yiwu Science and Technology Research Institute (CN)
Affordable and clean energy
Openalex Percentile: Top 70%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.