Cover image

The Cost of Asking Only for Today

TL;DR for operators A persistent assistant can miss valuable information if it asks about a preference only when the answer improves its current task enough to justify the interruption. Wang and colleagues investigate this problem through Active Preference Acquisition (APA), which values questions according to expected benefits across future tasks.1 In their synthetic benchmark, 34.4% of budget-feasible valuable initially missing preferences at a 20-task horizon are worth acquiring only through cumulative reuse. APA acquires 80.3% of these preferences versus 5.1% for current-task valuation, with a statistically significant net-utility advantage among affected users. However, its overall 10-task advantage is statistically inconclusive after adjustment, and a privileged oracle achieves better utility while collecting fewer preferences. The operational lesson is to select questions by expected downstream value, not to maximize the number of answers collected. ...

November 14, 2026 · 8 min · Zelina
Cover image

The Summary Kept the Files. The Agent Lost the Fix.

TL;DR for operators A coding agent can retain the right files and repair evidence after context compaction yet fail to complete work that it could finish with its full history. Compact-Bench1 measures this failure through matched execution continuations, not summary inspection alone. Across 14 summarizer backbones, stable compaction-induced damage ranges from 5% to 64% of 22 validated full-history repair successes. The benchmark also finds that configurations preserving more exact technical details do not necessarily complete more repairs. A mechanical extractor retains 79.1% of recurring structured details, versus at most 16.0% for the tested LLM configurations, but its ability to preserve executable progress is not evaluated. ...

November 12, 2026 · 9 min · Zelina
Cover image

Remembering Why Is Not Proving Why

TL;DR for operators A research agent can preserve an experiment without preserving why its result might hold. CauProphet1 addresses this by storing reusable causal hypotheses with supporting evidence, contradictions, and applicability conditions, then adapting them to new tasks. Across two chronological financial factor studies, the system improves mean next-period RankIC by 25.4% relative to ReAct with text memory, although it performs worse in the volume-only study. It also improves pre-resolution forecasting accuracy and intervention-effect estimation in selected benchmarks. These are task-performance results, not proof that its stored causal relationships are correct. ...

November 11, 2026 · 9 min · Zelina
Cover image

Keep the Record, Rebuild the Rule

TL;DR for operators An AI agent can retain a complete record of what it did without permanently storing every rule it infers from that record. This distinction matters when an instruction derived from one successful task is subsequently reused in circumstances where it no longer applies. A new agent-memory architecture called Anti-Persistence keeps execution trajectories and outcomes but generates task-specific guidance only when needed, discarding that guidance afterward. Across nine benchmark–model combinations, it achieves 59.9% mean held-out success, compared with 53.5% for trajectory-only memory, 49.0% for abstraction-only memory, and 49.3% for joint memory. ...

November 7, 2026 · 8 min · Zelina
Cover image

The Cost of Remembering Every Possible Answer

TL;DR for operators An agent must often retain information before knowing which question it will need to answer later. Compressing that information reduces immediate storage, but some answers may then require access to an archived record. The relevant costs include retained state, archive storage, retrieval width, decoding latency, and the questions the representation can still answer. ...

November 6, 2026 · 7 min · Zelina
Cover image

The Skill Was Retrieved, Not Proven

TL;DR for operators An agent completes a task after retrieving several reusable instructions. Its execution log records the instructions and the successful outcome, but not which instruction actually helped. Keeping every instruction associated with success can preserve redundant or harmful guidance; removing instructions with weak performance records can eliminate capabilities the model still needs. ...

November 6, 2026 · 8 min · Zelina
Cover image

Tomorrow's Answers, Yesterday's Evidence

TL;DR for operators An intelligence agent that forecasts tomorrow’s events can learn from today’s completed predictions, but only if it preserves what was knowable when each forecast was made. Otherwise, its apparent improvement may reflect access to answers revealed after the deadline. EvoForesight investigates three ways to improve such an agent: updating model parameters, retaining reusable forecasting procedures, and generating new questions around observed weaknesses. In controlled experiments, accumulated skills reduced tool calls by approximately 44% on recurring structured tasks while maintaining numeric accuracy. On heterogeneous tasks, they increased searches but improved forecasts. ...

November 5, 2026 · 9 min · Zelina
Cover image

When One Bad Memory Hides Another

TL;DR for operators A persistent-memory agent can retrieve two harmful records that substitute for one another. Remove either record alone, and the remaining one can preserve the same wrong answer, making both look harmless under a one-at-a-time deletion test. MeClear1 addresses that failure mode by measuring each retrieved memory across multiple combinations of the surrounding context rather than only against the full retrieved set. It uses sampled Shapley contributions to identify negatively contributing memories, ranks them, and then tests nested clearance candidates. A nonempty clearance is accepted only when it produces positive empirical task gain and passes a fixed recovery check. ...

October 12, 2026 · 7 min · Zelina
Cover image

Correct Now Is Not Enough: Testing Agent Memory for What Happens Next

TL;DR for operators An agent can have a compressed memory that answers the current question perfectly and is already inadequate for the next update. Guangzhe Zhang’s Correct Now, Insufficient Later: Auditing Update Sufficiency in Context Compression1 demonstrates the problem with paired synthetic histories. On DeepSeek, the paper’s frontier selector and a latest-only variant both score 96/96 on current reads. After a later update makes older evidence relevant, frontier remains at 96/96, while latest-only falls to 32/96. ...

October 6, 2026 · 6 min · Zelina
Cover image

Who Goes First? Turning Shared Assistants Into Dependency-Aware Organizational Agents

TL;DR for operators A shared enterprise assistant does not only need to remember more people. It must often determine which fact, permission, instruction, or decision has to exist before another action is valid. Org-Agent addresses this by decomposing multi-user work into atomic subtasks, connecting prerequisite relationships in a dynamic execution graph, ordering those subtasks so prerequisites run first, and carrying retrieved evidence and intermediate results into later steps.1 ...

October 4, 2026 · 6 min · Zelina