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

迈向自适应鲁棒大语言模型:通过CoIPO实现内在提示噪声抵抗力

Towards Self-Robust LLMs: Intrinsic Prompt Noise Resistance via CoIPO

Zhejiang University(浙江大学);Tsinghua University(清华大学);Meituan LongCat Interaction Team(美团LongCat交互团队);ETH Zürich(苏黎世联邦理工学院)

Xin Yang, Letian Li, Abudukelimu Wuerkaixi, Xuxin Cheng, Cao Liu, Ke Zeng, Xunliang Cai, Wenyuan Jiang

AI总结:

本文提出CoIPO方法,通过对比学习提升大语言模型对提示噪声的内在鲁棒性,实验表明其在NoisyPromptBench上表现优于现有方法。

摘要:

大型语言模型(LLMs)在广泛的任务上展示了显著且持续改进的性能。然而,LLMs的性能可能对提示变化非常敏感,尤其是在开放性有限或输出格式要求严格的情况下,这表明鲁棒性不足。在现实应用中,提供给LLMs的用户提示往往包含不完美之处,这可能会损害模型响应的质量。为了解决这个问题,先前的工作主要集中在预处理提示上,使用外部工具甚至LLMs来提前优化提示格式。然而,这些方法忽略了LLMs的内在鲁棒性,其对外部组件的依赖引入了额外的计算开销和不确定性。在本工作中,我们提出了一种基于对比学习的逆直接偏好优化(CoIPO)方法,该方法最小化了在干净提示下由模型生成的标签对齐logits与其噪声版本之间的差异,并通过互信息理论进行了详细分析。我们通过构建成对的提示来增强FLAN数据集,每个提示由一个干净的提示和其对应的噪声版本组成以进行训练。此外,为了评估有效性,我们开发了NoisyPromptBench,这是一个增强并基于现有PromptBench衍生的基准。在NoisyPromptBench上的实验结果表明,我们提出的方法在平均准确性上显著优于当前最先进的方法。CoIPO的源代码、成对FLAN数据集和NoisyPromptBench已经发布在https://github.com/vegetable-yx/CoIPO。

英文摘要:

Large language models (LLMs) have demonstrated remarkable and steadily improving performance across a wide range of tasks. However, LLM performance may be highly sensitive to prompt variations especially in scenarios with limited openness or strict output formatting requirements, indicating insufficient robustness. In real-world applications, user prompts provided to LLMs often contain imperfections, which may undermine the quality of the model's responses. To address this issue, previous work has primarily focused on preprocessing prompts, employing external tools or even LLMs to refine prompt formulations in advance. However, these approaches overlook the intrinsic robustness of LLMs, and their reliance on external components introduces additional computational overhead and uncertainty. In this work, we propose a Contrastive Learning-based Inverse Direct Preference Optimization (CoIPO) method that minimizes the discrepancy between the label-aligned logits produced by the model under a clean prompt and its noisy counterpart, and conduct a detailed analysis using mutual information theory. We augment the FLAN dataset by constructing paired prompts, each consisting of a clean prompt and its corresponding noisy version for training. Additionally, to evaluate the effectiveness, we develop NoisyPromptBench, a benchmark enhanced and derived from the existing PromptBench. Experimental results conducted on NoisyPromptBench demonstrate that our proposed method achieves a significant improvement in average accuracy over the current state-of-the-art approaches. The source code of CoIPO, pair-wise FLAN datasets, and NoisyPromptBench have already been released on https://github.com/vegetable-yx/CoIPO.

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

↑