Beyond Outcomes: Dual-View Relational Learning for Efficient Agent Benchmarking

arXiv:2609.18909v1 Announce Type: cross Abstract: Agent benchmarks are substantially more costly to evaluate than conventional LLM benchmarks. Benchmark compression is therefore a natural solution, yet existing methods primarily model redundancy in task--model final-score distributions, which is important in agentic evaluation. To address this limitation, we analyze large-scale trajectories and identify six complementary process signals that are systematically associated with final agent performance. To disentangle agent performance redundancy from a complete perspective, we propose DualViewEval, an agent benchmark compression method that jointly exploits outcome and process relations to learn an exact-size miniset and predict the full-benchmark scores. Across five agent benchmarks and five representative baselines, DualViewEval achieves the best results in all datasets. With only 20 tasks, it achieves 24imes--40imes compression on APEX-Agents and BFCL, reducing mean absolute error (MAE) by 14.5%--28.2% over the strongest competitors while improving Kendall's au by up to 7.2% relative to EssenceBench on SWE-bench Verified. The selected minisets further reveal capability differences among different agents, providing compact and diagnostic feedback for efficient agentic model development.

Related

• Efficient SWE Agent Benchmarking via Trajectory-Aware Evaluation
• EgoGapBench: Benchmarking Egocentric Action Selection in Multi-Agent Scenes
• PBT-Bench: Benchmarking AI Agents on Property-Based Testing
• Multi-Agent Routing as Set-Valued Prediction: A WildChat Benchmark and Cost-Aware Evaluation

Source: arXiv cs.AI | 2026-09-17