arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.03493cs.CLcs.AI
收藏

自动提示优化中的子模评价子集选择

Submodular Evaluation Subset Selection in Automatic Prompt Optimization

Santa Clara University(圣克拉拉大学);Walmart Global Tech(沃尔玛全球技术)

Jinming Nian, Zhiyuan Peng, Hongwei Shang, Dae Hoon Park, Yi Fang

AI总结:

本文提出SESS方法,通过子模优化选择评估子集,提升自动提示优化效果。

摘要:

自动提示优化减少了手动提示工程,但依赖于在小规模、通常随机采样的评估子集上测量的任务性能作为主要反馈信号。尽管如此,如何选择该评估子集通常被视为实现细节。我们从原理上研究提示优化的评估子集选择,并提出SESS,一种子模评价子集选择方法。我们将选择过程框架为最大化一个目标集函数,并证明在温和条件下,它单调且子模,使贪心选择具有理论保证。在GSM8K、MATH和GPQA-Diamond上,通过子模选择的评估子集可以产生比随机或启发式基线更好的优化提示。

英文摘要:

Automatic prompt optimization reduces manual prompt engineering, but relies on task performance measured on a small, often randomly sampled evaluation subset as its main source of feedback signal. Despite this, how to select that evaluation subset is usually treated as an implementation detail. We study evaluation subset selection for prompt optimization from a principled perspective and propose SESS, a submodular evaluation subset selection method. We frame selection as maximizing an objective set function and show that, under mild conditions, it is monotone and submodular, enabling greedy selection with theoretical guarantees. Across GSM8K, MATH, and GPQA-Diamond, submodularly selected evaluation subsets can yield better optimized prompts than random or heuristic baselines.

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

↑