Daily Issue
Vol. I — No. 14
29 · 05
Friday, 29 May 2026
Generated 2026-05-29 10:51
google/gemini-2.5-flash-lite
I am proud to have been capable of giving people hope again. — Francois Hollande 34 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Overcast
Today's range
25.7°18.9°
currently 22.3°
Feels
21.8°
Rain
18%
Wind
10 km/h
Humid
47%
Rise
04:51
Set
21:04
§ I

From the arXiv

arXiv preprints 10 of 20
cs.AIarxiv:2602.05472Lead article

ALIVE: Awakening LLM Reasoning via Adversarial Learning and Instructive Verbal Evaluation

Yiwen Duan, Jing Ye, Xinpei Zhao

LIVE addresses the "reward bottleneck" in LLM reasoning by moving beyond costly scalar rewards. Its core method, Adversarial Learning with Instructive Verbal Evaluation, unifies problem posing, solving, and judging within a single policy. This allows LLMs to internalize reasoning logic directly from raw text through adversarial training and verbal feedback, fostering a deeper, self-contained understanding of correctness.

Overview of ALIVE. A unified policy model π \( \pi_{\theta} \) alternates among three roles in a closed-loop learning cycle: the Constructor masks reasoning-critical spans in text to create hindsight-verifiable tasks, the Solver generates reasoning trajectories for these tasks, and the Reviewer evaluates the resulting solutions with both verbal critiques and soft rewards. The same parameters are updated by combining task-difficulty, hard-verification, soft-review, and feedback-conditioned learning signals.
Overview of ALIVE. A unified policy model π \( \pi_{\theta} \) alternates among three roles in a closed-loop learning cycle: the Constructor masks reasoning-critical spans in text to create hindsight-verifiable tasks, the Solver generates reasoning trajectories for these tasks, a…
Overview of Co-ReAct. (i) Collect: sample candidate next actions at each branching point and rank them with multi-judge expert consensus. (ii) Train: GRPO with a Spearman reward between the rubric-induced ranking and the expert ranking. (iii) Infer: the trained rubric drives a five-tuple (Rubric, Reason, Act, Verify, Observe) loop.
Overview of Co-ReAct. (i) Collect: sample candidate next actions at each branching point and rank them with multi-judge expert consensus. (ii) Train: GRPO with a Spearman reward between the rubric-ind…
cs.AIarxiv:2605.23590

Co-ReAct: Rubrics as Step-Level Collaborators for ReAct Agents

Jiazheng Kang, Bowen Zhang et al.

Co-ReAct introduces a novel framework where rubrics act as step-level collaborators for ReAct agents. Instead of just evaluating final outputs, Co-ReAct integrates rubrics directly into the agent's decision-making process during inference, guiding each reasoni…

cs.AIarxiv:2605.23605

DiLaDiff: Distilled Latent-Augmented Diffusion for Language Modeling

Jean-Marie Lemercier, Tomas Geffner et al.

DiLaDiff addresses the token correlation issue in diffusion language models by introducing a continuous latent space. This latent space, learned via an auto-encoder and a latent diffusion model, captures semantic information. A consistency model then distills …

DiLaDiff: hybrid continuous-discrete diffusion with self-distilled latent. The latent space is crafted with encoder ℰ \( \mathcal{E}_{\phi} \) and decoder 𝐱 θ {\( \mathbf{x} \)}_{\( \theta \)} and learned a posteriori with a diffusion process with denoiser 𝐳 ψ {\( \mathbf{z} \)}_{\( \psi \)} . The latent diffusion trajectories are further self-distilled with MeanFlow student 𝐮 η ​ ( 𝐳 τ , τ , r ) \( \mathbf{u}_{\eta} \)({\( \mathbf{z} \)}_{\( \tau \)},\( \tau \),r) .
DiLaDiff: hybrid continuous-discrete diffusion with self-distilled latent. The latent space is crafted with encoder ℰ \( \mathcal{E}_{\phi} \) and decoder 𝐱 θ {\( \mathbf{x} \)}_{\( \theta \)} and le…
Overview of KG-R1 , a multi-turn agentic KG-RAG framework. The framework enables cost-efficient inference and demonstrates strong cross-KG transferability.
Overview of KG-R1 , a multi-turn agentic KG-RAG framework. The framework enables cost-efficient inference and demonstrates strong cross-KG transferability.
cs.AIarxiv:2509.26383

Efficient and Transferable Agentic Knowledge Graph RAG via Reinforcement Learning

Junhong Lin, Shicheng Liu et al.

This paper introduces KG-R1, an agentic framework that uses reinforcement learning to optimize knowledge-graph retrieval-augmented generation (KG-RAG). Instead of fixed multi-module pipelines, a single agent learns to interact with knowledge graphs, retrieving…

cs.AIarxiv:2605.23218

Foundation Protocol: A Coordination Layer for Agentic Society

Bang Liu, Yongfeng Gu et al.

The Foundation Protocol (FP) introduces a graph-based coordination layer for agentic societies, unifying diverse entities like agents, humans, and institutions. Its core method is to provide a flexible framework for multi-party organization, event-based collab…

A compact view of the web’s evolution: each generation raised capability while exposing new coordination failures. Web 4.0-like systems intensify those failures because agents act, interact, and transact at scale.
A compact view of the web’s evolution: each generation raised capability while exposing new coordination failures. Web 4.0-like systems intensify those failures because agents act, interact, and trans…
№06
cs.AI
9

GENSTRAT: Toward a Science of Strategic Reasoning in Large Language Models

Vartan Shadarevian, Kia Ghods et al.

This paper introduces GENSTRAT, a novel benchmark for evaluating strategic reasoning in LLMs. Its core method involves procedurally generating a diverse distribution of imperfect-i…

№07
cs.AI
9

Goal-Conditioned Agents that Learn Everything All at Once

Michael Matthews, Matthew Jackson et al.

This paper introduces Learning Everything All at Once (LEO), a method for goal-conditioned reinforcement learning. LEO efficiently learns from all transitions by jointly outputting…

№08
cs.AI
9

It's the humans, not the data: Geopolitical bias in LLMs originates in post-training, amplified by the language of the prompt

Stuart Bladon, Brinnae Bent

This paper demonstrates that geopolitical bias in LLMs primarily emerges during post-training, not pre-training, contradicting common assumptions. The researchers found that models…

№09
cs.AI
9

MemAudit: Post-hoc Auditing of Poisoned Agent Memory via Causal Attribution and Structural Anomaly Detection

Zhewen Tan, Yilun Yao et al.

MemAudit is a post-hoc framework for auditing poisoned memory in LLM agents. It uses causal attribution to identify memories that causally influence harmful outputs and structural …

№10
cs.AI
9

Model Spec Midtraining: Improving How Alignment Training Generalizes

Chloe Li, Nevan Wichers et al.

This paper introduces Model Spec Midtraining (MSM) to improve how language models generalize during alignment training. MSM involves training models on synthetic documents discussi…

§ II

The Town Square

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