Daily Issue
Vol. I — No. 31
16 · 07
Thursday, 16 July 2026
Generated 2026-07-16 10:14
google/gemini-2.5-flash-lite
I opened the large central window of my office room to its full on the fine early May morning. Then I stood for a few moments, breathing in the soft, warm air that was charged with the scent of white lilacs below. — Angus Wilson 33 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Clear sky
Today's range
28.5°17.1°
currently 24.3°
Feels
24.3°
Rain
0%
Wind
12 km/h
Humid
45%
Rise
05:03
Set
21:11
§ I

From the arXiv

arXiv preprints 10 of 20
cs.AIarxiv:2607.13705v1Lead article

AgentCompass: A Unified Evaluation Infrastructure for Agent Capabilities

Zichen Ding, Jiaye Ge, Shufan Jiang, Kai Chen, Mo Li

gentCompass provides a unified, open-source infrastructure for evaluating LLM-based agents by decoupling benchmarks, harnesses, and environments. This modular design promotes flexibility, reproducibility, and reduces redundant engineering. Its key contribution lies in offering a scalable and transparent system for diagnosing agent failures and advancing agent research.

Capability profiles of representative models across the five core evaluation dimensions.
Capability profiles of representative models across the five core evaluation dimensions.
Architecture of MEDA . Specialized agents (centre) each read a defined input artifact and write a defined output artifact (right) to a shared session directory. Solid arrows apply in both operating modes; green dashed arrows are active only in data-anchored mode, in which a supplied time series feeds the Explorer (EDA + SINDy screening) and the Runner . The ground-truth equations are quarantined from all discovery agents and read only after the blind search ends, by the Evaluator (red dashed arrow).
Architecture of MEDA . Specialized agents (centre) each read a defined input artifact and write a defined output artifact (right) to a shared session directory. Solid arrows apply in both operating mo…
cs.AIarxiv:2607.13608v1

Automatic Ordinary Differential Equations Discovery For Biological Systems Using Large Language Model Powered Agentic System

David Krongauz, Arad Zulti et al.

This paper introduces MEDA, an LLM- and symbolic regression-powered agentic system for discovering Ordinary Differential Equation (ODE) models of biological systems. MEDA leverages LLMs to retrieve domain knowledge, define variables, and generate constraints, …

cs.AIarxiv:2607.13884v1

Experience Memory Graph: One-Shot Error Correction for Agents

Wenjun Wang, Yuchen Fang et al.

This paper introduces the Experience Memory Graph (EMG) to address error correction in LLM agents. EMG reformulates failure recovery as a graph matching problem, converting failed and successful trajectories into directed action decision graphs. By matching th…

Figure 1 . Difference of error correction based on (a) reflect-replay loop and (b) Experience Memory Graph. Existing methods rely on iterative test‑time reflection — the agent replans and re‑executes after each failure, causing high latency and cost. Our Experience Memory Graph extracts error correction paths offline by computing graph edit paths that transform failed trajectories into successful ones from paired training trajectories of the same task, distills them into insights, and stores them in a memory graph. At test time, retrieval enables one‑shot exectution without loops.
Figure 1 . Difference of error correction based on (a) reflect-replay loop and (b) Experience Memory Graph. Existing methods rely on iterative test‑time reflection — the agent replans and re‑executes …
Figure 1. Motivating example of error propagation across stages in MLLMs. (a) A case where an early grounding error propagates to the later reasoning stage and leads to an incorrect answer. (b) Statistical experiments with LLaVA-v1.5-7B (Liu et al. , 2023a ) on GCPD dataset (constructed from RLHF-V (Yu et al. , 2024 ) ), showing that introducing errors into 0, 1, or 2 grounding stages is associated with progressively lower final reasoning accuracy, consistent with error propagation in MLLMs.
Figure 1. Motivating example of error propagation across stages in MLLMs. (a) A case where an early grounding error propagates to the later reasoning stage and leads to an incorrect answer. (b) Statis…
cs.AIarxiv:2607.13712v1

Groc-PO: Grounded Context Preference Optimization for Truthful Multimodal LLMs

Zhixiao Zheng, Zheren Fu et al.

This paper addresses untruthfulness in multimodal LLMs by proposing Groc-PO. Unlike standard methods that optimize only the final answer, Groc-PO applies preference optimization at earlier grounding stages. This grounded approach aims to prevent error propagat…

cs.AIarxiv:2607.13591v1

Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents

Eric Hanchen Jiang, Zhi Zhang et al.

This paper introduces MemCon, a framework that treats LLM agent memory management as a learned, adaptive process. Instead of fixed heuristics, MemCon uses a Markov Decision Process to train an online policy that dynamically decides when, what, and how to retri…

Overview of MemCon . (Left) Task streams from ALFWorld, PDDL, and ScienceWorld are executed through three agent frameworks (Lobster, LangGraph, Agent-FW) sharing one LLM backbone. (Middle) The Memory MDP runs four steps per retrieval: extract a compact state ϕ ​ ( s ) \( \phi \)(s) from task + memory signals; select an action via the UCB policy over Q ​ ( ϕ , a ) Q(\( \phi \),a) ; the backend-agnostic wrapper issues retrieval to the inner backend with policy-chosen top_k / insight_k /hop; retrieved context (optionally plus an injected success plan) is fed to the LLM, and the episode is scored ( + 1 +1 success, − 0.5 -0.5 failure, plus efficiency bonus). (Right) Online learning: the action space is { Retrieve (varying depth), PlanInject , Re-Retrieve , Consolidate , Forget , NoOp }; after each episode the reverse-discounted reward γ | ep | − j − 1 ​ r i \( \gamma \)^{|\( \text{ep} \)|-j-1}r_{i} updates every visited ( ϕ j , a j ) (\( \phi_{j} \),a_{j}) .
Overview of MemCon . (Left) Task streams from ALFWorld, PDDL, and ScienceWorld are executed through three agent frameworks (Lobster, LangGraph, Agent-FW) sharing one LLM backbone. (Middle) The Memory …
№06
cs.AI
9

Protective Capacity Hallucination: When Large Language Models Claim Nonexistent Capabilities

Eunna Lee, Jungpyo Nam et al.

This paper introduces "Protective Capacity Hallucination" (PCH), where Large Language Models (LLMs) falsely claim to perform real-world protective actions they cannot execute when …

№07
cs.AI
9

STOCKTAKE: Measuring the Gap Between Perception and Action in LLM Agents with a Fair Oracle

Sagar Deb, Ashwanth Krishnan

This paper introduces STOCKTAKE, a benchmark for evaluating LLM agents on complex, multi-week decision tasks where the true state of the world is hidden. STOCKTAKE's core method us…

№08
cs.LG
9

TRACE: Turn-level Reward Assignment via Credit Estimation for Long-Horizon Agents

Leitian Tao, Baolin Peng et al.

TRACE addresses the challenge of assigning credit to individual actions in long-horizon multi-turn agents. It achieves this by representing agent rollouts as state transitions and …

№09
cs.CL
9

SPyCE: Skill-Policy Co-evolution for Multimodal Agents

Ru Zhang, Weijie Qiu

SPyCE proposes a novel framework for multimodal agents that learns reusable skills alongside the policy during reinforcement learning. Instead of treating trajectories as mere rewa…

№10
cs.AI
8

CAVA: Canonical Action Verification and Attestation for Runtime Governance of Agentic AI Systems

Zexun Wang

CAVA addresses the challenge of governing agentic AI systems by creating a "runtime-semantics layer." Its core method is to convert diverse runtime records of agent actions into st…

§ II

The Town Square

Hacker News 4
compiled overnight by google/gemini-2.5-flash-lite · end of issue no. 31 · thank you for reading