Offline Preference-Based Trajectory Evaluation
Fernando Diaz
原文摘要
Offline evaluation of agentic systems often collapses trajectories into a binary terminal success value, discarding information about partial progress. This, in turn, results in widespread ties that create statistical inefficiency by reducing effective sample size and weakening the ability to distinguish systems. We propose preference-based trajectory evaluation, an evaluation measure that compares pairs of trajectories directly by using temporal preferences between time-to-return profiles. We find that, across diverse agentic and interactive benchmarks, success-based metrics result in tied comparisons on roughly 75% of instances, while trajectory-aware preferences reduce ties to roughly 35%, improving discriminative power, ranking stability, and data efficiency. Our results suggest that benchmark saturation, often portrayed as the result of poor data collection or problem difficulty, may also be explained by the design of the evaluation measure.
cs.LG · cs.AI