paper-with-me

홈 › Papers

Beyond Task Completion: Revealing Corrupt Success in LLM Agents through Procedure-Aware Evaluation

2026-03-03 · Hongliu Cao, Ilias Driouich, Eoin Thomas arxiv

Large Language Model (LLM)-based agents are increasingly adopted in high-stakes settings, but current benchmarks evaluate mainly whether a task was completed, not how. We introduce Procedure-Aware Evaluation (PAE), a framework that formalizes agent procedures as structured observations and exposes consistency relationships between what agents observe, communicate, and execute. PAE evaluates agents along complementary axes (Utility, Efficiency, Interaction Quality, Procedural Integrity) and applies multi-dimensional gating that categorically disqualifies corrupt outcomes. Evaluating state-of-the-art LLM agents on tau-bench yields findings at the axis, compliance, and benchmark levels. At the axis level, the dimensions capture non-redundant failure modes: utility masks reliability gaps, speed does not imply precision, and conciseness does not predict intent adherence. At the procedural compliance level, 27-78% of benchmark reported successes are corrupt successes concealing violations across interaction and integrity. Furthermore, gating substantially collapses Pass^4 rate and affects model rankings. The analysis of corrupt success cases reveals distinctive per-model failure signatures: GPT-5 spreads errors across policy, execution, and intent dimensions; Kimi-K2-Thinking concentrates 78% of violations in policy faithfulness and compliance; and Mistral-Large-3 is dominated by faithfulness failures. At the benchmark level, our analysis exposes structural flaws in the benchmark design, including task scope gaps, contradictory reward signals, and simulator artifacts that produce accidental successes.

📄 PDF Abstract BibTeX arXiv:2603.03116

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Beyond Low Rank: A Graph-Based Propagation Approach to Tensor Completion for Multi-Acquisition Scenarios

2023-12-06 · Iain Rolland, Sivasakthy Selvakumaran, Andrea Marinoni

Tensor completion refers to the problem of recovering the missing, corrupted or unobserved entries in data represented by tensors. In this paper, we tackle the tensor completion problem in the scenario in which multiple …

Denoising-While-Completing Network (DWCNet): Robust Point Cloud Completion Under Corruption

2025-07-22 · Keneni W. Tesema, Lyndon Hill, Mark W. Jones, Gary K. L. Tam arxiv

Point cloud completion is crucial for 3D computer vision tasks in autonomous driving, augmented reality, and robotics. However, obtaining clean and complete point clouds from real-world environments is challenging due to…

Point Cloud CompletionContrastive LearningAutonomous DrivingPoint Clouds

Matrix Data Deep Decoder - Geometric Learning for Structured Data Completion

2021-01-01 · Maria Schmidt, Alexander Bronstein

In this work, we present a fully convolutional end to end method to reconstruct corrupted sparse matrices of Non-Euclidean data. The classic example for such matrices is recommender systems matrices where the rows/column…

DecoderGraph Neural NetworkMatrix CompletionRecommendation Systems

Robust PCA via Outlier Pursuit

2010-10-20 · NeurIPS 2010 12 · Huan Xu, Constantine Caramanis, Sujay Sanghavi

Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it is nevertheless plagued by a well-known, w…

Collaborative FilteringDimensionality ReductionMatrix Completion

Towards Blind Bitstream-corrupted Video Recovery via a Visual Foundation Model-driven Framework

2025-07-30 · Tianyi Liu, Kejun Wu, Chen Cai, Yi Wang 외 arxiv

Video signals are vulnerable in multimedia communication and storage systems, as even slight bitstream-domain corruption can lead to significant pixel-domain degradation. To recover faithful spatio-temporal content from …