Daily Issue
Vol. I — No. 69
08 · 09
Tuesday, 8 September 2026
Generated 2026-09-08 09:36
google/gemini-2.5-flash-lite
We campaigned on the fact that we were going to have to take difficult decisions because of the state of the public finances. When we got into government we discovered that actually the public finances were in an even worse state than we thought. — Theresa May 33 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Slight rain
Today's range
18.5°↓14.4°
currently 14.7°
Feels
14.9°
Rain
100%
Wind
8 km/h
Humid
94%
Rise
06:24
Set
19:31
§ I

From the arXiv

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

A Verifier-Guided Explainable Reasoning Framework with Gold-Anchored QLoRA, Task-Aware Mixture-of-Experts, and Group-Relative RLVR

Thi Kim Trang Vo, Nam Tien Le, Thi Kim Nguyet Vo, Minh Khang Tran, Duy Phuong Tran

his paper introduces a framework to improve the explainability and verifiability of LLM reasoning in educational question answering. It achieves this by using a gold-anchored QLoRA for model adaptation, a task-aware router to direct problems to specialized symbolic solvers (like Z3), and a reinforcement learning approach that incorporates feedback from these solvers to refine explanations. The core contribution is a more transparent and trustworthy reasoning process for LLMs, particularly in educational contexts.

Overview of the proposed verifier-guided framework. Gold-anchored targets support QLoRA SFT and calibration. A task-aware MoE router selects the Logic/FOL/Z3 or Physics/SOL verification path. Verifier signals support revision and group-relative RLVR. At inference, one greedy and four sampled responses are grouped by answer equivalence before optional question-only physics verification.
Overview of the proposed verifier-guided framework. Gold-anchored targets support QLoRA SFT and calibration. A task-aware MoE router selects the Logic/FOL/Z3 or Physics/SOL verification path. Verifier signals support revision and group-relative RLVR. At inference, one greedy and …
cs.AIarxiv:2609.05228v1

ACE: Adaptive Calibration-Free Expert Skipping for MoE-based LLMs

Zukang Xu, Zhixiong Zhao et al.

ACE introduces a training-free method to reduce redundant computation in MoE LLMs by adaptively skipping experts for each token. Its core contribution lies in the Global Spectral Proxy and Router-Conditioned Refinement components, which estimate expert contrib…

cs.AIarxiv:2609.05295v1

RISE: Recursive Improvement via Self-Extrapolating Policy Distillation

Yang Li, Semih Yavuz et al.

RISE addresses limitations in language model post-training by creating a synthetic teacher from the model's own training trajectory, avoiding external models or privileged conditioning. It achieves this by extrapolating parameter or logit changes to generate d…

From experience reuse to behavioral structure induction. Existing methods transform trajectories into reusable insights or skills, but the underlying behavioral relations remain implicit. Trace2Tower recovers success-aligned behavioral structures through semantic, transition, and outcome-aware EigenTrace induction.
From experience reuse to behavioral structure induction. Existing methods transform trajectories into reusable insights or skills, but the underlying behavioral relations remain implicit. Trace2Tower …
cs.AIarxiv:2609.05261v1

Trace2Tower: Transition-Aware EigenTrace Induction of Multi-Level Skills for LLM Agents

Jiazheng Sun, Boyu Yang et al.

Trace2Tower addresses limitations in LLM agent skill learning by introducing a transition-aware framework that distills raw execution traces into a hierarchical skill structure. It achieves this by abstracting interactions into events, constructing a graph bas…

cs.AIarxiv:2609.05111v1

Unifying ICL, SFT, KL-Regularized RL Through a Bayesian Lens

Junxin Fan

This paper unifies diverse LLM training and inference methods like ICL, SFT, and RL under a single Bayesian framework. The core method involves constructing a generalized Bayes posterior over outputs using a prior model and a utility signal, then approximating…

№06
cs.AI
8

A Structured Debate-Mixture-of-Agents Framework for Complex Clinical Diagnostic Decision Support

Chang Xia, Leilei Ouyang et al.

This paper introduces Debate-Mixture-of-Agents (DMoA), a novel multi-agent framework designed to mimic the iterative, role-based reasoning of clinical diagnosis, unlike single-turn…

№07
cs.AI
8

Does Your Agent's Memory Survive a Model Upgrade? A Controlled Study of Memory Portability

Ankit Goyal, Jaideep Ray

This paper investigates how well an agent's memory survives model upgrades by comparing four memory storage methods: raw history (LC-RAW), retrieved chunks (RAG), natural language …

№08
cs.AI
8

GUT: Quantifying and Optimizing the Reasoning Uncertainty of LLMs via Graph Complexity

Shuang Liang, Xin-Yu Hu et al.

This paper introduces GUT, a method to quantify and reduce Large Language Model (LLM) reasoning uncertainty. GUT models LLM reasoning as a directed acyclic graph, where graph compl…

№09
cs.AI
8

Measuring AI Accountability Through Argumentation Analysis: Can Model Reasoning Withstand Scrutiny?

Daan R. Henselmans, Derck W. E. Prinzhorn et al.

This paper proposes a novel method for measuring AI accountability by analyzing the structural quality of a model's defense for its verdicts, rather than relying on ground truth. T…

№10
cs.AI
8

PRICE: A Systematic Study of LLM Adaptation Choices for Bitcoin Price Forecasting

Maryam Fakhari, Mehran Safayani

This paper introduces PRICE, a systematic method for adapting LLMs to Bitcoin price forecasting. PRICE combines efficient fine-tuning (LoRA), recursive inference, integer numerical…

§ II

The Town Square

Hacker News 4
125
Tell HN: OpenAI brings back 5 hour limit for plus and business standard users
7 Sept
118
lambdaland.org7 Sept
111
Apparently CodePen 2.0 sends data to their servers as you type
7 Sept
compiled overnight by google/gemini-2.5-flash-lite · end of issue no. 69 · thank you for reading