In this paper, we define the quantity of prompting complexity: for a fixed instruction-tuned language model, what is the shortest plausible prompt that makes deterministic decoding produce a target text? It is an LM-relative analogue of resource-bounded Kolmogorov complexity: the prompt is a program, the model interface is the interpreter, and information omitted from the prompt is supplied by the model's weights, training distribution, tokenizer, template, and decoding rule. Unlike classical Kolmogorov complexity, this measure is intentionally non-universal. In the finite-context setting it is computable by enumeration, but there is no model-independent invariance theorem; the same text may be cheap for one model and inaccessible or expensive for another. To keep the search space aligned with prompt engineering, we restrict programs to plausible human-readable texts rather than arbitrary token strings. We extend the exact definition to soft prompting complexity for approximate outputs, yielding a lossy notion of model-relative text compression and a formal target for prompt optimization. We also define prompting distance by comparing shortest generating prompts, and behavioral prompting complexity for reaching any output satisfying a specification. Based on these formulations, we define a research agenda for empirically studying which texts and behaviors are accessible from short plausible prompts under a fixed LM interface.
Decomposed Prompting: Probing Multilingual Linguistic Structure Knowledge in Large Language Models
Center for Information and Language Processing (CIS)(信息与语言处理中心);Munich Center for Machine Learning (MCML)(慕尼黑机器学习中心);ScaDS.AI and TU Dresden(ScaDS.AI 和 梅克伦堡-前波美拉尼亚技术大学);Department of Statistics, LMU Munich(统计学系,慕尼黑大学);University of Maryland, College Park(马里兰大学 College Park 分校)
Contextual Dynamic Prompting for Response Generation in Task-oriented Dialog Systems
AWS AI Labs(AWS人工智能实验室);University of Chicago(芝加哥大学)
响应生成是面向任务的对话系统的关键组成部分之一。现有的研究表明,大型预训练的语言模型可以适应这项任务。适应这种极其大的大语言模型的典型范例是通过对下游任务进行微调,这不仅耗时,而且涉及大量资源和对微调数据的访问。修正(Schick and Schütze,2020)已经成为许多NLP任务中微调的替代方案。在我们的工作中,我们探索的想法,使用提示响应生成面向任务的对话系统。具体来说,我们提出了一种方法,执行上下文动态提示的提示是从对话上下文学习。我们的目标是从对话上下文中提取有用的提示信号。在使用MultiWOZ 2.2数据集的实验中(Zang等人,2020),我们表明,上下文动态提示改善反应生成的综合得分(Mehri等人,2019年)由3个绝对点,和一个巨大的20点时,对话状态的合并。此外,这些对话的人类注释发现,结合上下文的代理人比香草前缀调整的代理人更受欢迎。
Plan-and-Solve Prompting: Improving Zero-Shot Chain-of-Thought Reasoning by Large Language Models
Singapore Management University(新加坡管理大学);Southwest Jiaotong University(西南交通大学);Singapore University of Technology and Design(新加坡科技设计大学);East China Normal University(华东师范大学)
No One Fits All: From Fixed Prompting to Learned Routing in Multilingual LLMs
Department of Computer Science and Information Engineering, National Taiwan University, Taiwan(国立台湾大学计算机科学与资讯工程学系);Institute of Information Science, Academia Sinica, Taiwan(台湾“中央研究院”信息科学研究所);AI Research Center (AINTU), National Taiwan University, Taiwan(国立台湾大学人工智能研究中心)
HPSS: Heuristic Prompting Strategy Search for LLM Evaluators
The Conversational Artificial Intelligence (CoAI) Group, Tsinghua University(清华大学对话人工智能(CoAI)小组);University of Electronic Science and Technology of China(电子科技大学);Zhipu AI(智谱AI);The Knowledge Engineering Group (KEG), Tsinghua University(清华大学知识工程小组(KEG))
Transfer-Prompting: Enhancing Cross-Task Adaptation in Large Language Models via Dual-Stage Prompts Optimization
School of Artificial intelligence, Jilin University(吉林大学人工智能学院);Engineering Research Center of Knowledge-Driven Human-Machine Intelligence, Jilin University(吉林大学知识驱动人机智能工程研究中心);International Center of Future Science, Jilin University(吉林大学未来科学国际中心)
Enhancing Granular Sentiment Classification with Chain-of-Thought Prompting in Large Language Models
John F Kennedy High school Fremont, USA(约翰·F·肯尼迪高中弗里蒙特分校);Queensland Academy for Science Mathematics and Technology(昆士兰科学数学与技术学院);Research Spark Hub Inc(Research Spark Hub公司)
Enhance Multi-domain Sentiment Analysis of Review Texts through Prompting Strategies
Hong Kong Baptist University(香港浸会大学);BNU-UIC Institute of AI and Future Networks(北师大-联合国际学院人工智能与未来网络研究院);BNU-HKBU United International College(北师大-港浸大联合国际学院);Beijing Normal University(北京师范大学)
Hypothesis Testing Prompting Improves Deductive Reasoning in Large Language Models
Shanghai Jiao Tong University(上海交通大学);MoE Key Lab of Artificial Intelligence(教育部人工智能重点实验室);AI Institute(人工智能研究院);State Key Lab of Advanced Optical Communication System and Network(先进光通信系统与网络国家重点实验室)