2026-08-02

AI Agents

A benchmark audit re-checks 150 failure-scored trajectories from five computer-use agent benchmarks and finds 15.3% of the FAIL verdicts are wrong — evaluator false negatives and broken tasks — meaning your CUA scores may be lying to you. A separate systematic study asks whether the popular filesystem-as-memory pattern actually pays off, and mostly finds it doesn't. Also today: coding-agent benchmarks beyond correctness, agent RL from environmental feedback, and modular robotics.

5 papers 1 news 1 blogs 19 appendix 489 considered

Papers

5

SWE-NFI: Studying and Benchmarking Coding Agents for Non-Functional Improvements

arxiv:arxiv-software-eng — Pengyu Xue, He Yang Yuan, Xin Wang, Junkai Chen, Haonan Zhang, Boyuan Chen, Zishuo Ding, Zhenhao Li, Weiyi Shang 8/10 code-agentsevals
SWE-NFI benchmarks something correctness suites ignore: behavior-preserving non-functional improvements — refactors, structural cleanups, quality changes that don't alter observable behavior. It's 188 tasks from real merged Python PRs, with 92 executable rules combining functional-correctness tests and rule-based NFI scoring. The best agent hits 70% functional correctness but every agent trails human developers on NFI overall, and the gap is stark on structural improvements (agent scores 0.0–1.3 versus 1.5 human). A reproducible answer to why agent PRs feel technically-passing-but-off.

How Benchmarks Mis-Score Computer-Use Agents

arxiv:arxiv-agents — Zihan Dong, Zhiyuan Ma, Zekun Wang, Yunqing Li, Zirou Liu, Ruixuan Deng, Qishi Zhan, Rui Qian 8/10 evalsobservability
This audits how computer-use agent benchmarks actually score. Reviewing 150 public failure-scored trajectories across five web, enterprise, and desktop benchmarks, the authors find 15.3% of FAIL verdicts are wrong — 10.7% evaluator false negatives, 4.7% broken tasks. For genuine failures, a three-tier taxonomy shows verification/feedback and planning errors dominate over execution/grounding, which a single scalar success rate can't surface. They organize the failure modes into a reliability framework and derive stage-specific design rules for task construction, trajectory capture, scoring, and reporting.

Filesystem-Based Memory for LLM Agents: Organization, Evolution, and Sustainability

arxiv:arxiv-agents — Sizhe Zhou, Sheldon Yu, Hui Wei, Junda Wu, Siru Ouyang, Yizhu Jiao, Shijia Pan, Julian McAuley, Yu Zhang, Tong Yu, Jiawei Han 8/10 memoryframeworks
The first systematic study of the now-default agent memory pattern: a directory tree of markdown files the agent reads, writes, and reorganizes with generic file tools. The authors formalize three roles — management, search, and execution agents — around one memory filesystem, then vary memory shape (organized hierarchy, verbatim dump, chunk retrieval), scale, tool harness, and agent strength while tracking answer quality, cost, and store health. The reliable payoff is search economy: organized stores roughly halve retrieval cost when material is large. But under sustained growth, organization erodes — today's agents fall short of the pattern's promise.

RoboBRIDGE: A Modular Framework for Bridging Policies to Robust Real-World Robotic Agents

arxiv:arxiv-agents — Sihyung Yoon, Minjong Yoo, Sanghyun Ahn, Seojeong Choi, Honguk Woo 7/10 frameworkssafety
RoboBRIDGE is an orchestration layer that turns a pretrained Vision-Language-Action model into a deployable robotic agent without retraining the backbone. Five modules — Monitor, Perceptor, Planner, Controller, Robot Interface — address the gaps VLAs expose in deployment: no failure recovery, drift over long horizons, brittleness to observation and embodiment shifts. The Monitor does rapid detection plus hierarchical recovery before errors cascade; the Planner replans while the Perceptor updates scene understanding asynchronously to avoid stalls; the Controller factors skills into LoRA-adapted primitives. Evaluated on LIBERO, RoboCasa, and real hardware across multiple platforms.

TAPO: Transition-Aware Policy Optimization for LLM Agents

arxiv:arxiv-agents — Cong Li, Peixi Peng, Yisen Zhao, Xinyu Hu, Shudong Liu, Zhan Su, Zhuojian Li 7/10 researchplanning
TAPO addresses a waste in agent RL: methods lean on sparse task rewards while ignoring the dense signal already flowing back as environmental feedback after each action. It alternates policy optimization with transition supervision, repurposing existing rollout data to train action-conditioned next-observation prediction on a shared backbone — no extra expert data, sampling, or inference overhead. Tested on WebShop and ALFWorld across model scales and multiple policy-optimization algorithms, it consistently beats pure policy optimization as a plug-in module. A cheap, well-motivated add-on rather than a new training regime.

News

1

Predictive Speculative KV Replication for Bursty LLM Inference

hn:hn-llm — shreybirmiwal 6/10 infracost-latency
A technique for bursty LLM inference: predictively replicate KV cache to absorb load spikes, with a GitHub repo (bite-the-bullet) attached. The framing targets a real operational pain — bursty request patterns where cold KV state stalls throughput. The item itself is thin (41 points, 4 comments, mostly a link), so the actual replication strategy, eviction policy, and any latency numbers live in the repo and post rather than here. Worth a look if you're running agents with spiky, correlated traffic.

Blogs

1

datasette-apps 0.2a0

rss:simonw 6/10 tool-usecode-agents
datasette-apps 0.2a0 adds two agent tools worth noting. app_debug() renders an app in a hidden iframe (opacity: 0, pointer-events: none) and runs agent-supplied JavaScript inside that sandbox, so the agent can smoke-test that its own generated app works and even measure element dimensions. app_list() lets the agent enumerate apps the user can edit. Both ride the new context.browser_task() mechanism from datasette-agent 0.4a0. A clean, concrete pattern for giving an agent closed-loop verification of UI it just built.
19 more items the ranker flagged but didn't feature

Papers

Blogs