Daily Issue
Vol. I — No. 91
08 · 10
Thursday, 8 October 2026
Generated 2026-10-08 09:42
google/gemini-2.5-flash-lite
If I like a food, I'll eat it, even if I know it's not good for me. — Kim Kardashian 34 items · 3 sections
§ 0

The Morning

Local weather 1
This morning in
London
Clear sky
Today's range
14.9°↓7.9°
currently 10.3°
Feels
6.6°
Rain
17%
Wind
15 km/h
Humid
63%
Rise
07:12
Set
18:22
§ I

From the arXiv

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

Open-MMUnlearning: Unifying Methods and Evaluation for MLLM Unlearning

Junkai Chen, Yuhao He, Qianshan Wei, Junxiang You, Jingwen Shao

his paper introduces Open-MMUnlearning, a unified, open-source framework for evaluating machine unlearning in multimodal large language models (MLLMs). It addresses the fragmentation in existing methods by providing standardized interfaces for preparing models, processing data, applying unlearning techniques, and evaluating performance across privacy, safety, and copyright concerns. The framework's key contribution is enabling systematic and comprehensive assessment of MLLM unlearning by supporting diverse models, methods, and benchmarks.

Overview of Open-MMUnlearning . The Data Worker prepares fine-tuning, evaluation, and unlearning data from benchmarks spanning privacy, safety, and copyright. The Model Loader supplies MLLM backbones, the Trainer executes fine-tuning and general and MLLM-specific unlearning methods, and the Unified Evaluator assesses Forget Quality, Model Utility, and Robustness through model-, input-, and output-side evaluations.
Overview of Open-MMUnlearning . The Data Worker prepares fine-tuning, evaluation, and unlearning data from benchmarks spanning privacy, safety, and copyright. The Model Loader supplies MLLM backbones, the Trainer executes fine-tuning and general and MLLM-specific unlearning metho…
A unified agentic trajectory-derived probing framework. By replaying a coding-agent trajectory on a coding task against the task’s own verifier V V , we locate the decisive step T ⋆ T^{\( \star \)} , the earliest step whose cumulative patch resolves the task. At this decisive step, (i) Decisive-Action BPB measures the byte-normalized likelihood which a base model assigns to the golden action; (ii) Patch MCQ evaluates base model’s capability of differentiating the golden action from non-resolving alternatives; (iii) Prefix-conditioned pass ​ @ ​ K \( \mathrm{pass@} \)K measures a base model’s empirical success rate under sampling: it draws K K continuations from T ⋆ T^{\( \star \)} and lets the task’s own verifier V V judge them.
A unified agentic trajectory-derived probing framework. By replaying a coding-agent trajectory on a coding task against the task’s own verifier V V , we locate the decisive step T ⋆ T^{\( \star \)} , …
cs.AIarxiv:2610.10478v1

Before They Can Solve: Predicting Post-Training Coding-Agent Performance from Base Models

Tan Yu, Alexander Bukharin et al.

This paper proposes a method to predict the potential of base models for agentic coding tasks without expensive post-training. It identifies the "decisive step" within a successful agent trajectory – the first code-changing action that makes the repository pas…

cs.AIarxiv:2610.10311v1

Fault-tolerant foundation models

Trevor McCourt, Ila R. Fiete et al.

This paper demonstrates that large language models (LLMs) can be trained to be resilient to unreliable hardware, with error tolerance increasing with model size. The core method involves modifying neural scaling laws based on training on simulated faulty hardw…

Overview of MuRA-Bench construction and evaluation. Expert-revised, request-specific rubrics support fine-grained assessment with MusicFlamingo. Gold rubrics are used exclusively for evaluation and are not exposed to the generation system.
Overview of MuRA-Bench construction and evaluation. Expert-revised, request-specific rubrics support fine-grained assessment with MusicFlamingo. Gold rubrics are used exclusively for evaluation and ar…
cs.AIarxiv:2610.10355v1

MIRA: A Musical Intent Refinement Agent for Aligning Text-to-Music Generation with User Intent

Zekai Liu, Zhilin Wang et al.

This paper addresses the challenge of aligning text-to-music generation with user intent by proposing a rubric-based evaluation framework. Their core method, MIRA (Musical Intent Refinement Agent), refines prompts for black-box text-to-music models by iterativ…

cs.AIarxiv:2610.10455v1

PHRBench: A Behavioral Evaluation of Post-Hallucination Reasoning in LLMs

Linghao Meng, Feng He et al.

This paper introduces PHRBench, a novel benchmark designed to evaluate how Large Language Models (LLMs) handle and correct hallucinated information during multi-stage reasoning. The core method involves a controlled evaluation of LLM reasoning trajectories, ca…

Overview of behaviorally structured post-hallucination reasoning. (a) Hallucinations that escape upstream detection can propagate into downstream reasoning, making recovery critical for reliable LLM systems. (b) Final correctness alone cannot reveal how a model handles hallucinated context. (c) PHRBench reveals a scaling tension between vulnerability and correction, characterizes and predicts successful correction before generation.
Overview of behaviorally structured post-hallucination reasoning. (a) Hallucinations that escape upstream detection can propagate into downstream reasoning, making recovery critical for reliable LLM s…
№06
cs.AI
8

Reasoning-Token Spikes Under Prompted Untruthful Responding in Large Language Models

Maverick Morales, Tomáš Dominik et al.

This paper proposes a new method for detecting untruthful responses in large language models by monitoring the *number* of reasoning tokens generated, rather than their content. Th…

№07
cs.AI
8

RECAST: Learning to Compute the Right Context through Adaptive Evidence Routing

Yilun Hao, Krishna Sayana et al.

RECAST addresses the limitation of traditional RAG by learning to actively *derive* evidence rather than just retrieve it. Its core method involves a RouterLM that sequentially dec…

№08
cs.AI
8

RoboQuest: Generalist Physical Agents that Search, Inspect and Test

Liu Renhang, Navonil Majumder et al.

RoboQuest introduces a benchmark for embodied agents that must actively explore and gather information through physical interaction to complete tasks in unfamiliar environments. It…

№09
cs.AI
8

SemanticFold: Latent Sequence Compression SeparatesLanguage Modeling, Decodability, and Reasoning

Mingyan Liu, Min Huang

SemanticFold is a novel method that compresses prompt prefixes in large language models by folding hidden states at learned boundaries. This technique aims to determine if such com…

№10
cs.AI
8

SLDR: Defending Against Malicious Fine-tuning via Selective Layers Recovery and Dynamic Routing

Hui Zhang, Yachao Yuan et al.

SLDR defends against malicious LLM fine-tuning by selectively recovering layers most sensitive to safety. It trains a lightweight adapter on these critical layers and uses dynamic …

§ II

The Town Square

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