Albacel Reads Issue #3

Reads ·

Issue #3

Covers November 6 – November 8, 2026

What agents carry forward: memory that corrects itself, stale TODOs that send agents off course, undo buttons that actually undo, and where the next dollar of agent compute pays off.

This issue is about what agents carry from one step to the next, and what it costs when that’s wrong. Anthropic’s post on agent memory and Google’s study of agents chasing stale TODOs are two sides of the same problem: whatever an agent reads, it tends to trust. Two AI Engineer talks cover the operational side. One shows that agents which finish a task often can’t undo it. The other shows a strong lead model with cheap workers getting close to frontier results for much less. If you read two, start with the memory post and Agent Distraction.

The posts

AI Engineer

Video · 16:38

Your Coding Agent Can't Undo Its Own Mistakes - Tanmay Sah & Dolly Sah

Tanmay Sah, Dolly Sah

47% of successful runs recovered correctly after an injected failure

Two researchers present UndoBench and EvoUndo, which test whether coding agents can recover after something goes wrong. Across 2,880 paired trials, agents completed the normal task 84% of the time, but only 47% of those successes recovered correctly when a failure was injected. When a request timed out after the server had already acted, naive retries created duplicate effects in 54% of trials. When agents modified their own harness (prompts, tools, middleware, config), 197 of 478 capability gains had recovery defects. Prompting the agent to fix this recovered none of them. Recording the prior state before each change and adding richer undo operations recovered 180 of 197, raising the number of changes that could safely be accepted from 281 to 461 out of 600. The timeout example starts at 2:00 and the EvoUndo loop at 10:15.

Building agentsMarkets & safe use Agents acting in the world

Watch on YouTube (opens in a new tab)

IBM Technology

Video · 10:01

Why AI Models Run Faster on Some Chips: The KV Cache Effect

A ten-minute explainer on why the same model can generate text at very different speeds on different accelerators. The KV cache, the stored attention state of earlier tokens, sits in large but slow device memory and has to be moved into small, fast on-chip memory at each step. Which layer manages that movement varies by chip. On data-center GPUs it’s the serving runtime and attention kernels, with vLLM-style paging of small blocks. On TPUs the compiler plans the tiling and pipelining. On IBM’s Spyre, the compiler explicitly schedules every load and store into a 2 MB scratchpad per core. The closing point, at 9:06: when comparing accelerators, ask how they move the model’s memory, not only how much math they can do.

Inference stack

Watch on YouTube (opens in a new tab)

AI Engineer

Video · 31:22

How to Get Frontier Coding Results at 70% Lower Cost - Nouha Dziri, Cohere

Nouha Dziri

−60% cost with a strong lead and cheap workers, at about the same score

Cohere ran controlled experiments on teams of coding agents, a lead model plus workers, on a hard reverse-engineering benchmark, changing one design choice at a time. Teams beat a single agent by up to about 10 points but cost 4–7x as much, and a blocking lead beat an async one, which often moved on before its workers reported back. Extra agents paid off only at the task’s bottleneck, which here was planning: money spent there returned about 1.6x the reward of other stages, while extra implementers or verifiers just added cost. Pairing a strong lead with cheap workers matched an all-strong team at about 60% lower cost, but cheap workers couldn’t make up for a weak lead. Sixteen cheap planners came out 70% cheaper than a full team. Workers rarely messaged each other even when they could. The stage-by-stage results start at 11:18 and the model mixing at 19:50.

Building agentsChoosing models What agents cost Harness and multi-agent design

Watch on YouTube (opens in a new tab)

Anthropic Engineering

The components of agent memory

Lance Martin

13% → 48% scores as a wiki built by dreaming grew over 128 sessions

Anthropic lays out how it designs memory for Claude: notes written during a session, plus “dreaming”, an offline pass that rereads past transcripts to correct notes, build linked wikis, and decide which notes get loaded into every new session. Newer models judge what’s worth saving much better. Playing Pokémon, Sonnet 3.7 wrote 413 files and earned one badge, while Fable 5 wrote about ten and earned four. Telling Opus models to “record only failures” cost them much of what memory gained them. On a 420M-token company corpus, a wiki built over 128 dreaming sessions lifted scores from 13% to 48%, and wiki plus search beat search alone (61% vs. 53%) while saving about 20,000 tokens per question. In a legal task, giving each contract its own page written by a single agent, instead of a shared table, raised the facts kept from 41 of 57 to all 57.

Building agents Context and memory

Read at Anthropic Engineering (opens in a new tab)

Transluce

Scaling Laws for Finetuning Effect Prediction

Yue Chen Li, Yaowen Ye, Jacob Steinhardt

Transluce trained “oversight” models to predict how a small model (Qwen3.5-2B) would answer prompts after being fine-tuned on a given bundle of documents. It used up to 328,000 examples and oversight models from 0.8B to 14B parameters. Prediction quality followed a Chinchilla-style power law in model size and data, with optimal data growing faster than optimal model size, but it flattened between 4B and 9B and hit an apparent floor that more compute doesn’t remove. The oversight model trained from the same 2B base as the subject beat larger ones, which the authors call a privileged-access effect. On harder tests (datasets that look benign but instill behaviors such as recommending drunk driving), the 2B and 9B oversight models beat the pre-finetuning baseline, though out-of-distribution loss fell more slowly than validation loss.

Choosing modelsMarkets & safe use

Read at Transluce (opens in a new tab)

Google Developers: AI

Agent Distraction

Sam Saccone, Madhuri Garikapati

+77% tokens per session when an agent detours into a stale TODO

Google traced coding-agent sessions across thousands of its engineers, using inline TODO(bug/...) comments as a measurable signal of stale context. 13% of sessions came across one. In 6% of those encounters the agent acted on the bug, and 83% of those actions were unprompted. Of the unprompted detours, 41% chased bugs that were already fixed or abandoned, and 57% expanded scope into open bugs nobody asked about. Controlling for developer, task and model, these detours added 70% more steps, 77% more tokens and 105% more wait time per session. Google then had agents dig through bug and file history to confirm which TODOs were obsolete and propose deleting them. Over six months they removed thousands, and reviewers accepted more than 95% of the changes.

Building agentsAdvising Context and memory

Read at Google Developers: AI (opens in a new tab)

Anthropic Research

AI for scientific discovery: How researchers use Claude

~2× output gain from today’s AI in the most AI-ready fields

Anthropic classified about 207,000 research sessions on Claude and Claude Code, using only privacy-preserving labels, and paired them with a survey of 528 scientists. Data analysis accounts for about a third of Claude sessions and nearly half of Claude Code sessions. Ideation and data gathering, which scientists rate most important, get little use. Tasks in the top fifth on an AI capability score get two to four times the use their share of researcher time would predict, and that score correlates strongly with how suitable a task is for reinforcement learning (0.78). With wide adoption of today’s capabilities, the model has AI taking on 27–52% of researcher time and raising output by 1.35x to about 2x. Even automating all non-physical work caps lab sciences at 3–4x, because physical steps take about 40% of researcher time there.

AdvisingMarkets & safe use Work and adoption

Read at Anthropic Research (opens in a new tab)

LangChain

Agents Are Going Async

Sydney Runkle, Thushanth Bengre

LangChain argues that a standard ReAct loop can’t be responsive and productive at the same time, because each long tool call blocks it. The fix is to split the agent into an orchestrator that stays with the user and async subagents that run in the background. The orchestrator manages them with five tools: start, check, update, cancel and list. A follow-up instruction either interrupts and restarts a subagent (for corrections) or waits until its current run finishes (for additions). Every unfinished task is listed in the orchestrator’s system prompt. Results arrive mid-run if the orchestrator is busy, wake it if it’s idle, and wait if it’s paused on an approval. The post points to the same pattern in Claude Code, OpenAI’s dots and DeepSeek Harness. Task notifications are still in beta.

Building agents Harness and multi-agent design

Read at LangChain (opens in a new tab)

LangChain

Context Engineering (Agent Memory) for AI Agents Starts with Retrieval

Jess Weng

The post sorts agent retrieval failures into three kinds: inefficient searching, too much context at once, and irrelevant or stale context. It walks through fixes using a weekly competitive-analysis agent as the example. Search names and keywords before reading files (glob and grep, then page through results 100 lines at a time), add semantic search only when the wording is unpredictable, and let the agent decide when to search again instead of retrieving once up front. Results over about 20,000 tokens are saved to a file, and the agent gets back only the path and a preview. For custom retrieval tools, the pattern is “retrieve, offload, delegate”: write results to files, return only the paths, and have subagents read each file and report back only the key facts and the source. To stop stale context, carry dates through into the text the model sees, and treat retrieved text as untrusted.

Building agents Context and memory

Read at LangChain (opens in a new tab)