arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.01423cs.CLcs.AI
收藏

提示递归搜索:LLM 自动提示中具有自适应增长的活框架

Prompt Recursive Search: A Living Framework with Adaptive Growth in LLM Auto-Prompting

Xiamen University(厦门大学)

Xiangyu Zhao, Chengqian Ma

AI总结:

本文提出提示递归搜索(PRS)框架,通过LLM针对具体问题生成解决方案并结合复杂度评估与可调结构,在节省token的同时减少错误,实验显示其在BBH数据集上比CoT准确率提升8%。

摘要:

大型语言模型(LLMs)在处理自然语言处理(NLP)领域的多种任务时表现出卓越的能力,各种提示设计策略显著增强了它们的能力。然而,这些提示虽然有益,但各自都有固有的局限性。主要的提示设计方法有两种:第一种以思维链(CoT)为例,涉及针对特定数据集手工制作提示,因此被称为专家设计提示(EDPs)。一旦这些提示被建立,它们就不可更改,其有效性受限于人类设计者的专业知识。当应用于LLMs时,EDPs的静态特性导致对同一数据集中的简单问题和复杂问题采用统一的方法,从而在简单问题上造成token的低效使用。第二种方法涉及由LLM自主生成的提示,称为LLM衍生提示(LDPs),它们为特定问题提供定制化解决方案,缓解了EDPs的局限性。然而,LDPs在解决复杂问题时可能会遇到性能下降,因为在解决方案规划过程中存在错误累积的可能性。为了应对这些挑战,我们构思了一种新颖的提示递归搜索(PRS)框架,该框架利用LLM生成针对特定问题的解决方案,从而节省token。该框架结合了问题复杂性评估和可调整结构,确保降低错误的可能性。我们通过在不同领域的多个数据集上使用具有不同参数数量的LLMs进行广泛实验,证实了PRS框架的有效性。与CoT方法相比,PRS方法使用Llama3-7B模型在BBH数据集上的准确率提高了8%,实现了22%的提升。

英文摘要:

Large Language Models (LLMs) exhibit remarkable proficiency in addressing a diverse array of tasks within the Natural Language Processing (NLP) domain, with various prompt design strategies significantly augmenting their capabilities. However, these prompts, while beneficial, each possess inherent limitations. The primary prompt design methodologies are twofold: The first, exemplified by the Chain of Thought (CoT), involves manually crafting prompts specific to individual datasets, hence termed Expert-Designed Prompts (EDPs). Once these prompts are established, they are unalterable, and their effectiveness is capped by the expertise of the human designers. When applied to LLMs, the static nature of EDPs results in a uniform approach to both simple and complex problems within the same dataset, leading to the inefficient use of tokens for straightforward issues. The second method involves prompts autonomously generated by the LLM, known as LLM-Derived Prompts (LDPs), which provide tailored solutions to specific problems, mitigating the limitations of EDPs. However, LDPs may encounter a decline in performance when tackling complex problems due to the potential for error accumulation during the solution planning process. To address these challenges, we have conceived a novel Prompt Recursive Search (PRS) framework that leverages the LLM to generate solutions specific to the problem, thereby conserving tokens. The framework incorporates an assessment of problem complexity and an adjustable structure, ensuring a reduction in the likelihood of errors. We have substantiated the efficacy of PRS framework through extensive experiments using LLMs with different numbers of parameters across a spectrum of datasets in various domains. Compared to the CoT method, the PRS method has increased the accuracy on the BBH dataset by 8% using Llama3-7B model, achieving a 22% improvement.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑