Selection-Aware Stress Testing for Interactive Agents

Yang Xu, Chenang Li, Jiefu Zhang, Haixiang Sun, Zhou Li +1 more
8/31/2026
cs.LGstat.APstat.ML

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

Agent evaluations often use one benchmark to choose a workflow and then search for task types where its advantage weakens, so both conclusions are selected from the same data. We introduce Selection-Aware Semantic Stress Testing (\SASST{}), which learns a task reweighting from pre-execution features on discovery tasks and evaluates the same paired comparison on separate confirmation tasks. The protocol checks support and stability, uses joint bounds for all planned claims, and can return no claim. We prove conditional asymptotic validity under stated cluster assumptions. A forty-cluster audit finds Gaussian undercoverage and conservative Bonferroni $t$ bounds. In one 480-episode $τ$-bench study, a $3.75$ point discovery gain vanished on confirmation. A second-model study likewise confirmed neither a workflow benefit nor a stable stress rule.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{xu2026selectionaware,
  title  = {Selection-Aware Stress Testing for Interactive Agents},
  author = {Yang Xu and Chenang Li and Jiefu Zhang and Haixiang Sun and Zhou Li and Vaneet Aggarwal},
  year   = {2026},
  eprint = {2608.30916},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2608.30916v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2608.30916.svg)](https://codeofpaper.com/paper/2608.30916)

Discussion