构建细粒度错误归因的工具调用评测基准,解决现有方法覆盖不足与判断不可靠问题。
PluginEval: A Diagnostic Benchmark for Fine-Grained Error Attribution in Function Calling

- 将工具调用拆解为三步决策,生成与验证分离,提升评估可靠性
- 通过对抗性负例覆盖罕见场景,实现对模型失败模式的精准定位
- 提供详细错误分类,适合研究模型鲁棒性与自主代理系统开发者
可靠评估工具路由对日益作为自主代理运行的大语言模型至关重要。当前基准存在三大结构性缺陷:数据分布呈幂律导致稀有场景覆盖不足;缺乏对抗性难例使模型间性能差异模糊;标注依赖未经执行验证的LLM判断。本文提出PluginEval,采用两阶段框架系统缓解上述问题。首先,将工具调用建模为三步决策,分离生成与验证:由LLM提出候选调用,再通过确定性验证和真实API执行获取可靠质量信号。其次,按能力、意图、边界分解每个插件,识别触发与排除场景,并生成不同难度查询填补覆盖空白,包括针对三种失效模式的对抗性负例,返回第一阶段进行标注。此过程形成闭环迭代直至覆盖收敛。评估时超越平均准确率,采用锚定黄金标注的LLM判官,将失败分类为遗漏调用、误调用或参数错误,生成各模型的详细错误画像。我们评估了五类模型家族,含专有模型与开源权重模型,分析其在不同难度级别及错误类别上的表现,并通过与人工标注的一致性验证判官有效性。
原文摘要 · Abstract (English)
Reliable evaluation of tool routing is critical as Large Language Models increasingly operate as autonomous agents. Current benchmarks face three structural limitations: data distributions that follow a power law leave rare scenarios underrepresented; the absence of adversarial hard negatives obscures performance differences across models; and annotation pipelines depend on LLM judgments that have not been validated through execution. In this paper, we introduce PluginEval, a benchmark constructed through a two-stage framework that systematically mitigates these limitations. First, we formulate tool routing as a sequence of three decisions and separate generation from verification. LLMs propose candidate calls, while deterministic validation and real API execution provide reliable quality signals. Second, we decompose each plugin by capability, intent, and boundary to identify trigger and exclusion scenarios. We then generate queries at different difficulty levels to fill coverage gaps, including adversarial negatives targeting three failure modes, and return them to the first stage for annotation. This process creates a closed loop that iterates until coverage converges. For evaluation, we move beyond aggregate accuracy. An LLM judge anchored to gold annotations classifies failures as missed calls, spurious calls, or parameter errors, producing a detailed error profile for each model. We evaluate five model families, including proprietary models and models with open weights, analyze their performance across difficulty levels and error categories, and validate the judge through agreement with human annotations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。