arXiv AI

Ask, Relax, or Act? Evaluating Actionable Indeterminacy in LLM Preference Reasoning

arXiv AI
Sep 3

Propose to Learn, Learn to Propose: Evaluability-Aware Assistance under Bounded Rationality

The paper introduces ProSE, a framework for AI assistants that generate proposals while considering users’ bounded rationality and evaluability constraints. It proposes a KL‑regularised bounded‑rational binary response model and a depth‑2 Bayes‑adaptive planner, “ProSE‑Plan,” which scores proposals by expected responses and resulting belief updates. Experiments on graph simulations show that “ProSE‑Plan” outperforms evaluability‑unaware and myopic baselines, especially when evaluation cost is high, and that informative probes are crucial for effective assistance.

By Yifan Zhu, Sammie Katt, Samuel Kaski
arXiv AI
Oct 2

Agents Are Systems, Not Models: Rethinking Agentic Evaluation

The paper argues that evaluating agents as fixed models is insufficient, proposing instead to treat them as configurable systems. Using a new benchmark of four scientific tasks, the authors analyze how five configuration aspects—task information, reasoning, self‑verification, time budget, and backbone model—affect performance, noting that about 54% of outcome variance arises from run‑to‑run differences even with the same settings. The study finds that providing more task information has the strongest impact, while interactions among settings (e.g., extra time only helps with adequate information or model capability) and the choice of verification tools significantly shape agent behavior.

By Luis Wiedmann, Leander Girrbach, Cordelia Schmid, Zeynep Akata
arXiv AI
5d ago

Empty Commitments: When Agents Promise What They Cannot Deliver

The paper introduces the concept of "empty commitments," promises made by AI agents that cannot be fulfilled due to the absence of necessary tools or runtime capabilities. It defines three failure types, proposes a detection checker, and evaluates it on 400 human-labeled examples and a benchmark of 293 follow‑up requests. The study shows that many open‑weight models frequently issue such empty commitments, and that simple interventions—informing the model of its runtime, adding a capability card, or running a checker loop—can significantly reduce these failures.

By Jiaqi Tang, Bingyu Shen, Lan Wei, Qing Lu, Bethel Ololade, Danny Galvis, Miles Q. Li, Bin Hu, Boyang Li