Daily Issue
Vol. I — No. 70
09 · 09
Wednesday, 9 September 2026
Generated 2026-09-09 09:36
google/gemini-2.5-flash-lite
I may be as bad as the worst, but, thank God, I am as good as the best. — Walt Whitman 37 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Partly cloudy
Today's range
18.6°↓11.9°
currently 15.3°
Feels
13.0°
Rain
0%
Wind
13 km/h
Humid
63%
Rise
06:26
Set
19:29
§ I

From the arXiv

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

Closing the Consistency Gap: Self-Evolving Agents That Learn to Stay on Course

Evelyn Duesterwald, Benjamin Elder, Lilian Ngweta, Shashanka Ubaru, Malgorzata Zimon

his paper addresses the "consistency gap" in LLM agents, where agents are often accurate on average but unreliable across multiple runs. Their core method involves a "self-evolving agent framework" that identifies unstable steps in agent reasoning and converts them into episodic memory. This memory then guides future executions, significantly reducing the inconsistency gap and improving trustworthiness.

Consistency guideline pipeline: Detect (1) and Generate (2).
Consistency guideline pipeline: Detect (1) and Generate (2).
The SPINE protocol loop. The proxy draws each move from a fixed 24-entry tactic menu (left); every turn t = 1 ​ … ​ 25 t=1\( \dots \) 25 cycles user proxy, target, and judge (centre); the judge records is collapsed , a position strength s t ∈ { 0 , 1 , 2 , 3 , 4 } s_{t}\( \in \)\{0,1,2,3,4\} , and reasserts correction for each target response, which feed the offline metrics CR@T, CT@T, and AUSC (right).
The SPINE protocol loop. The proxy draws each move from a fixed 24-entry tactic menu (left); every turn t = 1 ​ … ​ 25 t=1\( \dots \) 25 cycles user proxy, target, and judge (centre); the judge record…
cs.AIarxiv:2609.09090v1

Measuring LLM Sycophancy under Sustained Multi-Turn Pressure

Leyuan Tang, Kangda Wei et al.

This paper introduces SPINE, a benchmark designed to measure LLM sycophancy under prolonged, adaptive disagreement. Unlike previous evaluations, SPINE uses a persistent LLM proxy to challenge the target model for up to 25 turns. The study reveals that sycophan…

cs.AIarxiv:2609.09115v1

MeClear: Cooperative Game-Theoretic Attribution and Risk-Aware Memory Clearance for Long-Horizon LLM Agents

Boyu Yang, Jiazheng Sun et al.

MeClear is a novel framework for long-horizon LLM agents that addresses the problem of outdated or conflicting information in their external memory. It uses cooperative game-theoretic attribution to identify memories with negative downstream utility and select…

Motivation of MeRepair. Semantic relevance alone cannot determine whether retrieved memories are useful for future tasks. Historical utility may hide temporal degradation and memory interactions. MeRepair estimates future memory utility and performs uncertainty-aware repair to maintain reliable long-term memory for LLM agents.
Motivation of MeRepair. Semantic relevance alone cannot determine whether retrieved memories are useful for future tasks. Historical utility may hide temporal degradation and memory interactions. MeRe…
Gander is an end-to-end model that unifies omni communication, realtime interactive engagement across diverse and complex scenarios, and agentic execution of multi step tasks in workflow oriented environments.
Gander is an end-to-end model that unifies omni communication, realtime interactive engagement across diverse and complex scenarios, and agentic execution of multi step tasks in workflow oriented envi…
cs.AIarxiv:2609.08977v1

Omni Interaction Agent Technical Report

Orantqing, Shengpeng Ji et al.

This paper introduces Gander, an end-to-end model that unifies multi-modal perception, real-time interaction, and agentic capabilities. Its core method is a Cerebellum-Brain collaborative framework, enabling continuous, full-duplex interaction where the Cerebe…

cs.AIarxiv:2609.09153v1

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Yuxing Lu, Yicheng Chen et al.

This paper introduces the Procedural Graph, a novel structure that organizes procedural knowledge for LLM agents. Unlike traditional methods, it uses (procedure, relation, procedure) triplets to guide action selection. The graph self-evolves, allowing agents t…

№06
cs.AI
9

Training-Free Task Vectors for LLM Behavioral Control

Gabriel J. Perin, Lucas Boscaini et al.

This paper introduces Training-Free Task Vectors (TFTVs), a method to control LLM behavior without costly fine-tuning. TFTVs compute task-specific directions in model weights using…

№07
cs.AI
9

Transformers as In-Context Samplers: From Closed-Form Diffusion to Estimation-Free Sampling

Arman Adibi, Alireza Jafari et al.

This paper demonstrates that frozen transformers can perform data generation by simulating iterative samplers from in-context examples. The core method involves constructing transf…

№08
cs.CL
9

AuK Technical Report: An Open-Source Foundational Model for Speech Generation and Editing

Ziyang Ma, Zhikang Niu et al.

AuK is an open-source foundational model that unifies speech generation and editing using natural language instructions and audio context. Its core method involves a multimodal LLM…

№09
cs.CL
9

Experience Funnel: A State-Policy Alternating Loop for Self-Evolving Agents

Wenbo Gao, Zhaomou Song et al.

The Experience Funnel framework enables self-evolving agents by alternating between fast textual state updates and slow policy consolidation. This allows agents to rapidly adapt to…

№10
cs.AI
8

Co-Evolving Harnesses and Models: On-Policy Correction Helps Weaker Models Catch Up Where Imitation Fails

Zhou Yu, Bin Bi et al.

This paper introduces a method for co-evolving agent harnesses (the surrounding system components) and models. They found that evolving the harness alongside a weaker model, and th…

§ II

The Town Square

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