测试大模型评估生成回复是否满足约束条件的能力,发现其仍有很大提升空间。
The Ability of Large Language Models to Evaluate Constraint-satisfaction in Agent Responses to Open-ended Requests
- 构建新数据集,需整体分析回复来验证多个约束
- 多数模型在推理上表现不足,错误率高
- 适合研究模型评估能力或开发更可靠智能体的开发者
生成式AI智能体常需应对无唯一正确答案(NORA)的复杂请求,如“设计一个低于1800卡路里的素食餐单”。这类请求包含多项约束,准确评估智能体回复是否满足这些约束至关重要。为此,本文构建并发布首个算术约束满足(ACS)基准数据集,包含复杂用户请求、对应约束、智能体回复及人工标注的每项约束满足程度。该数据集要求对回复进行整体分析,且需模型具备推理、上下文数据提取、算术计算与计数能力。我们在开放与专有大模型上进行了评测,结果显示多数模型仍有显著提升空间,主要错误源于推理缺陷;同时模型存在预测偏倚,对“满足”标签的准确率更高。此外,少样本提示反而导致多数模型性能下降。
原文摘要 · Abstract (English)
Generative AI agents are often expected to respond to complex user requests that have No One Right Answer (NORA), e.g., "design a vegetarian meal plan below 1800 calories". Such requests may entail a set of constraints that the agent should adhere to. To successfully develop agents for NORA scenarios, an accurate automatic evaluation framework is essential, and specifically - one capable of validating the satisfaction of constraints in the agent's response. Recently, large language models (LLMs) have been adopted as versatile evaluators for many NORA tasks, but their ability to evaluate constraint-satisfaction in generated text remains unclear. To study this, we develop and release a novel Arithmetic Constraint-Satisfaction (ACS) benchmarking dataset. The dataset consists of complex user requests with corresponding constraints, agent responses and human labels indicating each constraint's satisfaction level in the response. A unique property of this dataset is that validating many of its constraints requires reviewing the response as a whole (in contrast to many other benchmarks that require the validation of a single independent item). Moreover, it assesses LLMs in performing reasoning, in-context data extraction, arithmetic calculations, and counting. We then benchmark both open and proprietary LLMs on evaluating constraint-satisfaction, and show that most models still have a significant headroom for improvement, and that errors primarily stem from reasoning issues. In addition, most models exhibit a skewed constraint-satisfaction prediction pattern, with higher accuracy where the ground-truth label is "satisfied". Lastly, few-shot prompting for our task proved to be rather challenging, since many of the studied models showed a degradation in performance when it was introduced.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。