AGENTIC-SYSTEMSMay 14, 20261 min read11 views

Do Androids Dream of Breaking the Game? Systematically Auditing AI Agent Benchmarks with BenchJack

Researchers introduce BenchJack, an automated red-teaming system designed to identify and patch 'reward hacking' flaws in AI agent benchmarks, revealing 219 distinct vulnerabilities across 10 major evaluation frameworks.

Computer Science > Artificial Intelligence

Title: Do Androids Dream of Breaking the Game? Systematically Auditing AI Agent Benchmarks with BenchJack

Agent benchmarks have become the de facto measure of frontier AI competence, guiding model selection, investment, and deployment. However, reward hacking, where agents maximize a score without performing the intended task, emerges spontaneously in frontier models without overfitting. We argue that benchmarks must be secure by design. From past incidents of reward hacks, we derive a taxonomy of eight recurring flaw patterns and compile them into the Agent-Eval Checklist for benchmark designers. We condense the insights into BenchJack, an automated red-teaming system that drives coding agents to audit benchmarks and identify possible reward-hacking exploits in a clairvoyant manner. Moreover, we extend BenchJack to an iterative generative-adversarial pipeline that discovers new flaws and patches them iteratively to improve benchmark robustness. We apply BenchJack to 10 popular agent benchmarks spanning software engineering, web navigation, desktop computing, and terminal operations. BenchJack synthesizes reward-hacking exploits that achieve near-perfect scores on most of the benchmarks without solving a single task, surfacing 219 distinct flaws across the eight classes. Moreover, BenchJack's extended pipeline reduces the hackable-task ratio from near 100% to under 10% on four benchmarks without fatal design flaws, fully patching WebArena and OSWorld within three iterations. Our results show that evaluation pipelines have not internalized an adversarial mindset, and that proactive auditing could help close the security gap for the fast-paced benchmarking space.

Source: arXiv cs.AI Recent

More in this category

agentic-systems

MUX: Continuous Reasoning via Multiplexed Tokens

Researchers introduced MUX, a novel latent reasoning method that compresses discrete text-based reasoning steps into continuous multiplexed tokens. By enabling lossless superposition, MUX significantly boosts LLM reasoning efficiency and speed across complex problem-solving tasks.

agentic-systems

ProbSPARQL: Querying Knowledge Graphs with Multi-dimensional, Uncertain Numeric Data

Researchers have introduced ProbSPARQL, an upward-compatible SPARQL extension designed to query multi-dimensional and uncertain numeric measurement data within Knowledge Graphs, providing significant query performance gains for complex industrial applications.

agentic-systems

Position: AI/ML Deepfake Research is Misaligned with AI-Generated Non-Consensual Intimate Imagery (AIG-NCII)

Current AI/ML research on deepfakes focuses primarily on epistemic harms like fake news and scams, leaving a dangerous gap in addressing AI-generated non-consensual intimate imagery (AIG-NCII) and its dignity harms to victims.

NOW LET US Related – Cross-Dialect Generalization Without Retraining: Benchmarks and Evaluation of Schema-Derived Constrained Decoding for MLIR

agentic-systems

Cross-Dialect Generalization Without Retraining: Benchmarks and Evaluation of Schema-Derived Constrained Decoding for MLIR

Researchers introduced schema-derived constrained decoding for MLIR, enabling a 1.7B small language model to match or beat 15B-34B LLMs without retraining, while generating code 8x-25x faster.

agentic-systems

Beyond Accuracy and Cost: Latency-Aware LLM Query Routing for Dynamic Workloads

Researchers introduced a novel latency-aware LLM query router that jointly optimizes generation latency, accuracy, and cost. The framework achieves up to a 40% improvement in accuracy-cost utility while maintaining low latency under dynamic workloads.

agentic-systems

MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers

MILP-Evo introduces an LLM-guided closed-loop program evolution framework for automatically designing white-box MILP solver components. By iteratively generating and evaluating executable code directly in SCIP, it discovers inspectable and highly competitive domain-specialized solver logic.