The latest AI news, in focus.

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).

Understanding Communication Failures in Multi-Agent LLM Systems

arXiv:2610.32060v1 Announce Type: new Abstract: Multi-agent LLM systems aim to improve reasoning through debate, evidence sharing, and mutual correction, but interaction can also introduce failures that final accuracy alone cannot explain. Agents may converge too early, ignore dissent, suppress correct minority answers, or preserve a wrong framing across rounds. We present a corpus-grounded taxonomy of communication failures, built from 3,211 failed multi-round trajectories across medical QA, coding, finance, multi-hop reasoning, ethics, and embodied text tasks. Using this taxonomy, we analyze failure distributions across datasets and system designs, round-level error dynamics, recovery hardness, majority transitions, minority-signal suppression, and self-reported confidence. We find that

Behaviour analysis for large language model-driven agents

arXiv:2610.32087v1 Announce Type: new Abstract: Understanding language-agent behaviour requires learning how actions are organised across a trajectory and how this organisation relates to context and outcomes. We propose a general framework that connects data-driven behavioural discovery with analysis and experimental investigation. Categories developed from recorded activity define what is measured. Analyses preserve the behaviours' positions in the process and express their relationships as interpretable hypotheses. Statistical assessment and tests in held-out contexts examine the strength and scope of the evidence. Experiments, including prompt steering, then test how behaviour and outcomes change under deliberately varied conditions. A study of iterative self-reflection illustrates how

PaperFormalizer: Author-in-the-Loop Autoformalization of Research Papers in Lean

arXiv:2610.31810v1 Announce Type: new Abstract: Even a carefully proofread paper can leave small gaps in its proofs or its stated assumptions. We introduce PaperFormalizer, a Lean-based agentic pipeline that helps authors find and close such gaps in their own papers and turn each paper into a Lean-verified version. Starting from the LaTeX source, PaperFormalizer transcribes the paper into a dependency graph of statements, audits each statement in natural language for faithfulness, ambiguity and correctness, and then formalizes and proves the statements in Lean against Mathlib, optional domain libraries and the author's personal toolkit. Only the author knows what a statement is meant to say and how a formalization gap in a result is best fixed. The pipeline therefore stops and asks the aut

Towards Adversarially Robust Multigraph Neural Networks for Financial Crime Analysis

arXiv:2610.31718v1 Announce Type: new Abstract: Financial transaction networks are naturally represented as multigraphs, where repeated transactions between the same pair of accounts are modeled as distinct edges. Recently proposed multigraph neural network architectures leverage this structure explicitly to achieve a strong performance on anti-money laundering (AML) tasks. However, their robustness to adversaries that manipulate transaction structures to evade detection remains largely unexplored. We present the first scalable framework for structural attacks and adversarial training of multigraph neural networks using node-edge incidence matrices, adapting projected gradient descent and projected randomized block coordinate descent methods to optimize structural perturbations over such m

StackGen3D: Stable 3D Block Stack Generation from Multiview Silhouettes

arXiv:2610.31803v1 Announce Type: new Abstract: Generating physically stable 3D structures from visual specifications requires resolving geometric ambiguity while accounting for physical interactions among objects. We present StackGen3D, a framework for generating stable block assemblies conditioned on a given block inventory and three orthographic silhouettes. Our approach consists of two stages. First, we develop a physics-informed graph neural network (PI-GNN) that models support relations between blocks and serves as a fast stability predictor for curating a diverse dataset of stable structures. Second, we train a conditional flow-matching model on this dataset to capture the multimodal distribution of block configurations consistent with the target silhouettes. At inference time, ligh

LazyFlash: Forward-Dense, Backward-Sparse Attention for Accelerated Long-Context Fine-Tuning

arXiv:2610.31911v1 Announce Type: new Abstract: As large language models (LLMs) process increasingly long sequences, attention becomes a major computational bottleneck. Sparse attention mostly targets inference, yet many methods still train densely or cannot support sparse training, and their added complexity makes sparsity hard to turn into wall-clock speedups, leaving dense attention widely used in practice. This paper introduces LazyFlash, a forward-dense, backward-sparse attention method built on the observation that attention training is dominated by the backward pass. LazyFlash keeps the forward pass exactly dense, so the trained model remains a standard dense model that existing systems such as vLLM can serve without any change. For the backward pass, LazyFlash proposes a gradient-a

Democratizing LLM Training with the Edge: Challenges, Systems, and the Road Ahead

arXiv:2610.32215v1 Announce Type: new Abstract: The growing computational power of modern GPU data centers has let a few industrial giants train and deploy large language models (LLMs) on massive amounts of data. Yet the sheer scale of these models and their training data makes centralized development increasingly hard to sustain, and at the same time shuts out smaller institutions that hold relevant private data but lack comparable infrastructure. In this paper, we organize our positions on distributed LLM training around the pretraining and fine-tuning paradigms, covering federated learning, split learning, and decentralized approaches, and we assess their readiness for geo-distributed settings with heterogeneous hardware and unreliable connectivity. We then present a {\em unified} syste

X-Dubbing: Speech-to-Speech Translation under Temporal and Visual Constraints

arXiv:2610.32042v1 Announce Type: new Abstract: Cross-lingual dubbing aims to convert source speech into target-language speech that remains synchronized with the original video. The key to this task is to produce a faithful translation that is naturally speakable within the source timing, which is non-trivial because languages differ in duration, rhythm, and articulation. In this paper, we propose X-Dubbing, which formulates the task as a joint problem of time-aware speech-to-text translation and video-aware text-to-speech. Specifically, our method consists of a Dubbing Translator that generates temporally structured scripts and a Voice Actor that renders them in synchrony with the source video, both grounded in a language-agnostic timing budget. We further refine the translator with dubb

Research reveals that activation interventions struggle to achieve conditional reuse in tool usage models.

The paper was posted on arXiv on October 26, 2026 (ID 2610.31686), and, based on the Qwen3.5-27B model, it systematically examined the impact of activation interventions on “conditional reuse” capabilities in tool-use tasks that depend on temporal or permission-based eligibility assessments. The experiments showed that while the intervention significantly improved the accuracy of target selection, it failed to generalize in scenarios involving fact‑based and identifier‑recombination tasks, and it did not enhance independent judgments of candidate eligibility.

Why it mattersThis study is the first to clearly distinguish among three types of capabilities—“goal-selection control,” “condition-sensitive judgment,” and “complete-action correctness”—and demonstrates that merely optimizing output answers is insufficient to ensure that a model truly understands and reuses the conditions set by an intervention (such as time or permissions), thereby offering methodological implications for trustworthy tool invocation and the design of controllable AI systems.

Quantum Cadence: Post-Quantum Consensus with Multiple Concurrent Proposers

arXiv:2610.32803v1 Announce Type: new Abstract: The consensus protocols of most high-performance blockchains use quorum certificates, which bundle the signatures of a quorum of validators. Signature schemes such as BLS can aggregate the signatures of a whole quorum into a single short signature, which keeps these certificates small. A large-scale quantum computer would break these schemes, and no post-quantum scheme with comparable aggregate size and aggregation time is known. Without aggregation, a certificate holds one large post-quantum signature per member of the quorum, so it becomes infeasible for each validator to broadcast certificates, as modern consensus protocols often require. We present Quantum Cadence, a post-quantum consensus protocol with multiple concurrent proposers that

New research reveals serious measurement bias in LLM-based math tutoring assessments: exact-match scoring underestimates effectiveness by nearly 40 percentage points.

The paper “MisconceptDialogue: Evaluation Criteria Shape Measured Success in LLM Math Tutoring,” published on arXiv on October 26, 2026, introduces the MISCONCEPTDIALOGUE automated evaluation framework, which assesses the performance of five open-source small-parameter LLMs (7B–14B) as math tutoring models through over 5,000 rounds of dialogue. The study finds that the mainstream exact-match scoring method achieves only a 42.1% remediation success rate, whereas an expert‑calibrated LLM referee evaluates the same dialogues at 81.3%, a gap of 39.2 percentage points; moreover, this discrepancy is not accidental—four types of LLM referees show high agreement with 200 human‑annotated results, with a maximum kappa coefficient of 0.91. In addition, the models exhibit virtually no differentiation in their responses to diagnostic information (correct or incorrect concepts), indicating their limited ability to effectively leverage such diagnostic inputs.

Why it mattersThis study directly addresses the core flaw in current methodologies for evaluating LLM-based educational applications: reliance on a single, rigid automated scoring system can severely distort assessments of actual competence. Its large-scale simulation experiments, multi-rater convergence validation, and empirical analysis of the breakdown in diagnostic–instructional coupling provide critical warnings and a replicable methodological benchmark for standardizing AI-driven educational assessment.

The study proposes the “Schema Consistency Index” (SCI) to assess the coherence of belief representations in language models.

On October 26, 2026, arXiv published the paper arXiv:2610.31683v1, introducing the Schema Coherence Inventory (SCI)—a 96-item forced-choice scale designed to assess whether the beliefs attributed to persona-conditioned language models genuinely structure their cognition, rather than merely eliciting emotional responses.

Why it mattersThis study fills the current gap in the lack of a verifiable measurement method for the “degree of belief internalization” in language models; through validation by clinical experts, testing across multiple model backbones, and the design of target-specific criteria, it provides the first assessment framework that focuses on cognitive structures rather than emotional representations, and has open-sourced all its tools.