arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.03325cs.CL
收藏

CoverBench:复杂主张验证的挑战性基准

CoverBench: A Challenging Benchmark for Complex Claim Verification

Tel Aviv University(特拉维夫大学);Google Research(谷歌研究院)

Alon Jacovi, Moran Ambar, Eyal Ben-David, Uri Shaham, Amir Feder, Mor Geva, Dror Marcus, Avi Caciularu

AI总结:

针对语言模型复杂推理输出的验证需求,本文引入CoverBench基准,该基准通过多样化领域、推理类型及标准化设计,经人工质量审核,提供竞争性基线结果,可用于评估复杂主张验证能力。

摘要:

目前,验证语言模型(LMs)输出正确性的研究日益增多。同时,语言模型正被用于处理需要推理的复杂查询。我们引入CoverBench,这是一个专注于在复杂推理场景中验证语言模型输出的挑战性基准。可用于此目的的数据集通常是为其他复杂推理任务(如问答(QA))设计的,针对特定用例(如财务表格),需要通过转换、负采样和选择困难示例来收集此类基准。CoverBench为多种领域、推理类型、相对较长的输入以及各种标准化(例如,在可用时为表格提供多种表示形式,以及一致的模式)中的复杂主张验证提供了多样化的评估。我们手动检查数据质量,以确保低水平的标签噪声。最后,我们报告了各种竞争性基线结果,以表明CoverBench具有挑战性且有很大的提升空间。数据可在https://huggingface.co/datasets/google/coverbench获取。

英文摘要:

There is a growing line of research on verifying the correctness of language models' outputs. At the same time, LMs are being used to tackle complex queries that require reasoning. We introduce CoverBench, a challenging benchmark focused on verifying LM outputs in complex reasoning settings. Datasets that can be used for this purpose are often designed for other complex reasoning tasks (e.g., QA) targeting specific use-cases (e.g., financial tables), requiring transformations, negative sampling and selection of hard examples to collect such a benchmark. CoverBench provides a diversified evaluation for complex claim verification in a variety of domains, types of reasoning, relatively long inputs, and a variety of standardizations, such as multiple representations for tables where available, and a consistent schema. We manually vet the data for quality to ensure low levels of label noise. Finally, we report a variety of competitive baseline results to show CoverBench is challenging and has very significant headroom. The data is available at https://huggingface.co/datasets/google/coverbench .

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

↑