Daily Issue
Vol. I — No. 34
21 · 07
Tuesday, 21 July 2026
Generated 2026-07-21 10:17
google/gemini-2.5-flash-lite
If we are to survive, we must have ideas, vision, and courage. These things are rarely produced by committees. Everything that matters in our intellectual and moral life begins with an individual confronting his own mind and conscience in a room by himself. — Arthur M. Schlesinger, Jr. 33 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Overcast
Today's range
24.2°15.6°
currently 19.5°
Feels
18.5°
Rain
0%
Wind
9 km/h
Humid
58%
Rise
05:09
Set
21:05
§ I

From the arXiv

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

Adaptive Adversaries: A Multi-Turn, Multi-LLM Benchmark for LLM Agent Security

Devina Jain, David Hartmann, Chuan Li

his paper introduces a novel benchmark for evaluating LLM agent security against adaptive, multi-turn attacks. Its core method involves an autonomous LLM attacker that learns from defender responses across multiple rounds to refine its attacks. The key contribution is demonstrating that adaptive, multi-LLM attacks significantly increase success rates compared to static attacks, uncovering novel vulnerabilities and highlighting the limitations of current defense strategies.

3 × \( \times \) 3 attacker × \( \times \) defender ASR matrix ( N = 5 N{=}5 runs per scenario, 945 total battles), with 95% bootstrap CIs in brackets.
3 × \( \times \) 3 attacker × \( \times \) defender ASR matrix ( N = 5 N{=}5 runs per scenario, 945 total battles), with 95% bootstrap CIs in brackets.
Figure 1. Comparison of memory retrieval paradigms. (a) Static reranker is unable to adapt to data distribution shifts. (b) Reranker with RL update struggles with sample inefficiency. (c) Our EAR (Exploratory-Assimilating Reflection) achieves both high initial recall and sample-efficient updates.
Figure 1. Comparison of memory retrieval paradigms. (a) Static reranker is unable to adapt to data distribution shifts. (b) Reranker with RL update struggles with sample inefficiency. (c) Our EAR (Exp…
cs.AIarxiv:2607.17879v1

Exploratory and Assimilating Reflection: Reflective Recall Cycle for Long-term Memory

Ganesh Senrayan, Moyuru Yamada et al.

This paper introduces Exploratory-Assimilating Reflection (EAR), a novel framework for LLM-based agents to manage long-term memory. EAR employs an iterative search (Exploratory Reflection) to gather relevant memories and then refines a global reranker by repla…

cs.AIarxiv:2607.18114v1

How Does Alignment Tuning Shape Representations of Sycophancy and Related Cue-Induced Biases in LLMs?

Prakhar Gupta, Terry Jingchen Zhang et al.

This paper investigates how alignment tuning in LLMs creates susceptibility to prompt-induced biases like sycophancy. The core method involves extracting and analyzing "bias directions" within model representations. The key contribution is demonstrating that a…

Left: per-bias direction extraction and intervention. For each (biased, unbiased) prompt pair, the model either resists the cue (gives the correct answer) or flips (caves to the bias’s target letter). We extract d bias = μ flipped − μ resisted d_{\( \mathrm{bias} \)}=\( \mu \)_{\( \mathrm{flipped} \)}-\( \mu \)_{\( \mathrm{resisted} \)} from last-token residual-stream activations (here illustrated for Suggested Answer ); subtracting α ⋅ d bias \( \alpha \)\( \cdot \) d_{\( \mathrm{bias} \)} at inference time debiases the model (§ 8 ), adding amplifies cue-following. Right: scope of the problem. Per-(model, bias) flip rate: fraction of pairs the model would have answered correctly on the unbiased prompt but flips on when reframed with the bias cue. OLMo’s Post Hoc (99%) leaves no resisted contrast for LODO testing (§ 5 ).
Left: per-bias direction extraction and intervention. For each (biased, unbiased) prompt pair, the model either resists the cue (gives the correct answer) or flips (caves to the bias’s target letter).…
Solver-grounded LLM and agentic workflow for smart grids. (a) Conventional power system studies rely on trusted numerical tools, followed by explicit verification before results are reported. (b) In the proposed solver-grounded agentic workflow, the LLM acts as an interface and orchestration layer: it parses natural language requests, retrieves relevant context, plans tool calls, and summarizes outputs, but numerical quantities are reported only if they originate from a trusted solver or simulator and pass a verification gate. If verification fails, the solver-grounded workflow either repairs the setup through bounded retries, or returns a safe failure message rather than fabricating numerical results.
Solver-grounded LLM and agentic workflow for smart grids. (a) Conventional power system studies rely on trusted numerical tools, followed by explicit verification before results are reported. (b) In t…
cs.AIarxiv:2607.18147v1

LLMs and Agentic AI Systems for Smart Grids: A Tutorial on Architectures and Applications

Daniela Rojas, Abdulwahab Albassam et al.

This paper proposes a "solver-grounded" design principle for LLM-based agentic AI systems in smart grids, ensuring numerical outputs are from trusted tools and explicitly verified. This approach addresses the lack of unified design and evaluation in the field,…

cs.AIarxiv:2607.18006v1

MADA-RL: Multi-Agent Debate-Aware Reinforcement Learning for Parameter-Efficient Reasoning in Compact Models

Martino M. L. Pulici, Cuong Xuan Chu et al.

MADA-RL is a post-training framework that trains compact language models for efficient reasoning. It specializes models into generator and critic roles, using a novel "counterfactual critic advantage" signal to train the critic to improve upon the generator's …

№06
cs.AI
9

Rethinking Heterogeneous LLM Merging: A Weighted Model Averaging Perspective

Jiahe Fan, Yinghao Hou et al.

This paper proposes a simple, training-free method for merging heterogeneous Large Language Models (LLMs) by adapting their parameter spaces and then performing weighted averaging.…

№07
cs.LG
9

DiFA: Inference-Time Forward-Process Alignment for Diffusion Models

Shigui Li, Delu Zeng

DiFA reframes diffusion model inference as a sequential state estimation problem, treating iterative predictions as correlated observations. It builds a "forward-aligned temporal c…

№08
cs.LG
9

PPL-Factory: Task-Aware and Budget-Aware Data Selection from Language Modeling to Reasoning

Hang Zhang, Warren J. Gross

PPL-Factory proposes a task-aware and budget-aware data selection method for fine-tuning large language models. It improves upon existing perplexity-based approaches by considering…

№09
cs.AI
8

A Geometric Perspective on Stabilizing Value Conflict Resolution

Saket Reddy, Andy Liu

This paper proposes using Chain-of-Thought (CoT) reasoning to stabilize value conflict resolution in LLMs, which are often hindered by compressed scalar rewards in RLHF. Geometrica…

№10
cs.AI
8

Can We Break LLMs Out of Self-Loops? Fine-Grained Reasoning Control with Activation Steering

Sheldon Yu, Tong Yu et al.

This paper introduces SOPHIA, a method to control the reasoning process of LLMs by intervening on their internal latent states. It identifies that LLMs can get stuck in "self-loops…

§ II

The Town Square

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