The latest AI news, in focus.

Don't Forget What You Just Learned: Self-Directed Repair Turns Agent Mistakes Into Lasting Lessons

arXiv:2610.31846v1 Announce Type: new Abstract: Intelligent agents should learn from their mistakes so that experience leads to continuous improvement. Yet today's agents recover from a mistake only temporarily: in-context reflections are easily forgotten across sessions and compete for limited context, while full-parameter fine-tuning is expensive and can interfere with existing capabilities. We introduce Self-Direction, a mechanism for agents to learn from mistakes that combines the benefits of temporary in-context retries and policy updates. When an agent fails a task, it reflects on its own trajectory in order to extract a lesson and immediately distills it into a lightweight low-rank adapter. By keeping the original weights frozen, Self-Direction prevents adapter training from overwri

From Noisy Retrieval to Decision Evidence: Silver Evidence Demonstrations for In-Context Learning

arXiv:2610.32128v1 Announce Type: new Abstract: RAG and retrieval-augmented few-shot ICL can struggle when decision-relevant evidence is buried in long, noisy context. Retrieved passages and demonstrations may contain redundant or distracting information. Although expert-labeled development examples may identify the text supporting each decision, these annotations are typically used only as answer-side rationales rather than as supervision for filtering noisy retrieval. We propose silver-evidence demonstrations, which replace raw retrieved passages in ICL examples with generated, target-conditioned evidence summaries. For each labeled development example, an LLM generates silver evidence without access to the expert label or gold evidence; this evidence is then paired with the expert label

A new arXiv paper proposes an intelligent agent framework for traceable multimodal emotion reasoning, supporting evidence verification and prompt repair without weight updates.

On October 26, 2026, arXiv published a preprint paper (ID 2610.31685v1) that proposes a traceable multimodal emotion‑reasoning intelligent agent architecture based on frozen large models. By leveraging modality‑specific perception agents, an integration agent, an MLLM critic, and an evidence‑verification stage, the framework achieves error attribution and adaptive optimization of the prompt space, improving the F‑score for emotion recognition across several open‑source multimodal large models (with 2B–38B parameters) by 0.6–2.2 points on the MER2025 dataset.

Why it mattersThis study addresses the trade-off between high instruction fine-tuning costs and the non‑debuggable pipeline of intelligent agents in current multimodal emotion‑reasoning systems by proposing the first end-to-end interpretable framework that integrates evidence citation, certainty verification, failure attribution, and targeted prompt repair. All improvements are implemented without modifying model weights and have been empirically validated across four open-source MLLMs of varying scales, demonstrating both methodological innovation and practical engineering utility.

$M^3$: A Multi-LLM System for Multi-Turn Jailbreaking as a Markov Decision Process

arXiv:2610.31937v1 Announce Type: new Abstract: Modern Large Language Models (LLMs) remain vulnerable to carefully orchestrated multi-turn interactions that progressively bypass safety mechanisms. However, many existing red-teaming approaches rely on heuristics or impose strong assumptions that limit their applicability in fully black box settings. We address this gap by introducing $M^3$, an automated red-teaming framework that formalizes multi-turn jailbreaking as a finite-horizon Markov Decision Process (MDP). In $M^3$, an attacker LLM interacts with a target LLM while operating over a compact internal state produced by a state LLM. Across two benchmarks and six target models, $M^3$ consistently outperforms state-of-the-art multi-turn red-teaming methods in Attack Success Rates (ASR), a

Speculative Diffusion is a Tale of Two Tradeoffs

arXiv:2610.31819v1 Announce Type: new Abstract: Speculative decoding is a technique that accelerates the inference speed of autoregressive large language models (LLMs) by sampling from a faster, lower quality draft model. Traditionally, a fundamental characteristic of speculative decoding is that it is lossless with respect to the verifier distribution, guaranteeing speed without sacrificing quality. This differs from recently developed diffusion LLMs (dLLMs), which are notably able to achieve substantial speedups by degrading the quality of their outputs with less diffusion effort. Because diffusion models are able to sample faster than autoregressive models by generating tokens in parallel, they are considered strong candidates for draft models in speculative diffusion. While it is widel

EDWARD-NMT: Elastic Dimensions With Adaptive Routing and Dual-consistency for Neural Machine Translation

arXiv:2610.32115v1 Announce Type: new Abstract: Sparse Mixture-of-Experts (MoE) is a powerful paradigm for scaling Neural Machine Translation (NMT) and managing language heterogeneity. However, practical limitations hinder its deployment on resource-constrained devices: the entire expert pool must remain in memory, and the per-token compute budget is statically fixed during training by rigid top-k routing. We introduce EDWARD-NMT (Elastic Dimensions With Adaptive Routing and Dual-consistency for NMT), a novel MoE encoder-decoder architecture designed for a train once, deploy anywhere paradigm that exposes a family of deployable sub-networks at inference time. EDWARD-NMT integrates three key innovations: (i) Matryoshka-style elastic dimensions to flexibly reduce the memory footprint; (ii) a

Does LeWorldModel Preserve Local Action Geometry?

arXiv:2610.31716v1 Announce Type: new Abstract: We examine how closely pretrained LeWorldModel (LeWM) reproduces the effects of small action changes. Using matched simulator and model responses, we measure action sensitivity with Gram matrices at three perturbation scales. Across nearly a thousand states from Reacher and OGBench Cube, the most sensitive action directions differ by median angles of about $36^\circ$ and $42^\circ$, respectively, at the smallest scale. Increasing the perturbation tenfold reduces median normalized Gram discrepancy by roughly 70\% on Reacher and 47\% on Cube. Geometry measured in pixels and embeddings varies more across scales than the chosen physical-state geometry. On held-out directions, environment Grams achieve median embedding response errors of 17\% and

The Path to NDE 4.0: A Review of Algorithms, Techniques, and Strategies for Autonomous Inspection

arXiv:2610.31704v1 Announce Type: new Abstract: Non-Destructive Inspection (NDI) is a cornerstone of modern quality assurance, critical for ensuring the safety and reliability of infrastructure and manufactured components without causing damage. This paper presents a comprehensive review of the current NDI landscape, analyzing the field through four distinct lenses, namely, computational algorithms, physical techniques, industrial applications, and research objectives. We synthesize a broad range of academic literature to illustrate the rapid evolution from manual, analog interpretation to a digitized, data-centric paradigm known as NDE 4.0. Our analysis highlights the dominance of ultrasound and visual inspection as primary physical techniques, while revealing a significant shift toward d

Query recall determines the retrieval performance of classical Arabic poetry: BM25 and dense encoders show markedly divergent behavior as query abstraction increases.

A recent study published on October 26, 2026, on arXiv (arXiv:2610.31821v1) shows that, in classical Arabic poetry retrieval tasks, the degree to which users retain fragments of poetic lines—such as whether they can recall half a line—plays a more critical role in determining retrieval performance than model capabilities. BM25 outperforms all dense encoders, including state-of-the-art models with 8B parameters, on “tip-of-the-tongue” queries, but falls significantly behind on abstract queries.

Why it mattersThis study, through systematic benchmarking using a bilingual corpus, a three-index model, and a dual-evaluation protocol, for the first time quantitatively reveals the dominant influence of query abstraction on different retrieval paradigms (lexical vs. dense), and—after being validated by both human annotators and open-source weight models—the conclusions demonstrate methodological universality and empirical robustness.

The study uses the BabyView dataset to validate mechanisms of children’s cross-context word-meaning learning.

The paper (arXiv:2610.31842v1), published on October 26, 2026, trains a contrastive vision–language model using the BabyView corpus—comprising 2,441 hours of longitudinal first-person‑view video from 48 children—to examine the feasibility of the “cross-context learning” hypothesis in real‑world child experiences.

Why it mattersThe study is the first to systematically evaluate cross-context word-meaning learning on large-scale, naturalistic developmental data, revealing the critical role of pre-trained visual representations, the sparsity of learning signals, and the fundamental differences between model and child learning trajectories, thereby holding methodological significance for developmental cognitive modeling and AI language acquisition research.

Permission to Retry: A Study of Authorization and Recovery in AI Agent Workflows

arXiv:2610.31916v1 Announce Type: new Abstract: A durable agent can resume a consequential action while its authority changes and the action's external outcome remains uncertain. We study execution-time reliability of tool-using AI agents, isolating recovery decisions from language-model behavior. Checkpoint state, permission to dispatch, evidence of an external effect and permission to reconcile are distinct obligations. We present a finite conformance study that checks these obligations through histories scored against a provider effect ledger hidden from the recovering application. A prospectively frozen campaign executes 336 histories on native LangGraph and Temporal hosts, crossing 14 schedules, three provider contracts and four matched application policies. All 168 paired host cells

The study proposes a knowledge graph quality assessment framework for the era of large language models.

A paper published on October 26, 2026, on arXiv (ID 2610.31684v1) systematically reviews research on the quality assessment of data, information, linked data, and knowledge graphs (KGs). In response to a new scenario where large language models (LLMs) rely on KGs as the basis for reasoning, the paper proposes a general, customizable framework for evaluating knowledge graph quality, encompassing 24 quality dimensions and multiple quality metrics.

Why it mattersThis paper directly addresses the critical issue of knowledge trustworthiness in the context of the deep integration of large language models (LLMs) and knowledge graphs (KGs). For the first time, it integrates quality-assessment theories from multiple domains to construct a comprehensive evaluation framework tailored to real-world applications. Its publication date—2026-10-26—matches the current date, making it one of the most recent academic advances, and it was posted on the authoritative preprint platform arXiv, ensuring clear provenance and adherence to academic standards.

Latent Coherence: Do Frontier Language Models' Probability Judgments Obey the Law of Total Probability?

arXiv:2610.31833v1 Announce Type: new Abstract: LawZero's Scientist AI trains a Predictor toward the Bayesian posterior, with an objective that penalizes inconsistent probabilities among latent explanations. We ask whether current frontier language models, with no such training, are already consistent in this sense zero-shot: do their probability judgments satisfy the law of total probability, $P(X)=\sum_z P(z)P(X|z)$, when the latent $z$ must be inferred from records in the context? In separate single-turn calls, models are asked for $P(X)$, for $P(z)$ over the latent's states, and for $P(X|z)$; a causal family applies the same test to $P(y|do(x))$ and the back-door adjustment. Every query has an exact ground-truth probability, and a subset of items is asked in three wordings to separate

Spatial Heuristic Strategy based Diffusion Reinforcement Learning for Online 3D Bin Packing

arXiv:2610.32241v1 Announce Type: new Abstract: Traditional heuristic methods have accumulated mature experience in core objectives, such as space utilization and layout compactness of 3D bin packing, relying on artificially designed rule-based logic. However, they exhibit obvious limitations in generalization ability and adaptability to dynamic scenarios. Diffusion reinforcement learning, which integrates the spatial search capability of reinforcement learning and the data distribution modeling capability of diffusion learning, has achieved certain progress in action distribution modeling and decision compliance constraints. Nevertheless, there remain issues including insufficient perception of the spatial topological structure in 3D bin packing and limited layout optimization capability.

Phronix: The Capability-Centric Learning Paradigm for Agents

arXiv:2610.31789v1 Announce Type: new Abstract: Scientific computing increasingly relies on large language model-based agents for performance engineering tasks such as instrumentation, analysis, and workflow porting. However, agent effectiveness depends heavily on the surrounding harness, which typically relies on manually written skills and curated memory. This limits autonomous learning, forcing agents to repeatedly rediscover solutions rather than retain and reuse knowledge from prior executions. We introduce Phronix, a capability-centric learning paradigm that enables agentic harnesses to acquire, validate, and refine reusable capabilities from their own executions. Phronix operates through a predictor-validator-corrector loop: MCP tools and associated skills propose solutions, tool ex

DriveMind: Mind-Evolving Belief Tracking for Closed-Loop Autonomous Driving

arXiv:2610.32069v1 Announce Type: new Abstract: Recent multimodal large language models (MLLMs) can perceive a traffic scene, reason about it, and propose a driving action within a single model. However, existing MLLM-based drivers reason from scratch at each frame and commit to a single explanation, discarding earlier hypotheses about the scene. When the scene is ambiguous, the agent locks in on the wrong interpretation and acts on it before evidence accumulates. In this paper, we propose DriveMind, an MLLM-based driving framework that keeps several hypotheses about the scene alive at the same time and updates their weights as new frames arrive. Inspired by particle filtering, DriveMind propagates each hypothesis through a VLM, scores it against the current observation, and resamples to m

GLP Networking API Specification

arXiv:2610.32583v1 Announce Type: cross Abstract: Multiagent deterministic GLP (madGLP) runs Grassroots Logic Programs (GLP) as agents that communicate solely by asynchronous message passing, and assumes fair delivery: every message sent is eventually delivered. Each agent runs on a person's smartphone, named by the person's public key. A grassroots platform depends on no global resource but the network, so agents must reach one another over Bluetooth Low Energy, on a local network, and across the Internet from behind NAT, via rendezvous servers anyone can run. What madGLP requires of such a network, and what the network requires of the platform, has not been specified. We specify the networking layer beneath madGLP. Anything that can be done in GLP is done in GLP: the layer provides only

Distributional Alignment of LLMs and Its Generalization Properties

arXiv:2610.31687v1 Announce Type: new Abstract: Large language models are increasingly used to simulate and probe human behavior, e.g., for surveys. For these applications, a key property is that outputs satisfy distributional alignment: to match its output distribution with some reference (in this case, human) distribution. An obstacle in achieving distributional alignment is generalizing from small training data. In this work, we study (1) how to distributionally align LLMs; and (2) how aligned LLMs might generalize to unseen samples and unrelated topics and tasks. Using two large-scale benchmarks, we find that LLMs can indeed achieve distributional alignment and generalize to unseen questions of the same domain. Cross-topic generalization depends on the relationship between topics (e.g.

Kolibri: A Sovereign European Model on the Pareto Frontier

arXiv:2610.31945v1 Announce Type: new Abstract: This report introduces Kolibri, an English-German mixture-of-experts transformer with 78.1B total parameters and 3.46B active parameters per token, released as open weights under the Apache 2.0 licence. We built Kolibri for sovereign and specialised deployment, with a particular focus on German and on regulated domains such as public administration, industry, and aerospace. To support these settings, we control the full model-development process, including data, architecture, training infrastructure, post-training, and evaluation. We train Kolibri on 24T tokens across pre-training, mid-training, and long-context extension, with German accounting for more than 20% of the data mix by bytes. To reach this share, we complement German datasets wit

In LLM evaluation, relying solely on the overall F1 score to validate automated scorers carries the risk of misleading results: a new study underscores the need to calibrate for prompt-specific differences.

An arXiv paper (2610.31678v1) points out that, in interactive evaluations of large language models, relying solely on the overall accuracy or F1 score of automated scorers can mask prompt-specific errors, leading to misjudgments of prompt effects. Empirical evidence shows that the same scorer exhibits substantial variation in its false-positive rate across different prompts (2.6%–33.3%), and a seemingly significant 9.3-point effect shrinks to 2.3 points—and becomes non-significant—under dual-LLM review.

Why it mattersThis study, based on real experimental data (6 models, 180 fictional entity‑based questions, and 6 prompt conditions), reveals a widespread methodological flaw in current LLM evaluations: equating the scorer’s overall performance with its reliability on key benchmark tasks. Its central claim—that each prompt must be audited separately and uncertainty must be incorporated—rests on clear empirical evidence and offers actionable recommendations, making it highly timely (published on 2026‑10‑26) and backed by a credible source (the arXiv preprint platform).