The latest AI news, in focus.

BlockLock: Reproducible LLM Inference with Fixed Batch Geometry

arXiv:2611.06977v1 Announce Type: new Abstract: Reproducible LLM inference requires that a request produces the same output regardless of the other requests in the batch. Existing solutions pay for this in different ways: batch-invariant kernels constrain every operator, and isolating prefill with fixed-shape decode ({our CoRun-style baseline}) gives up shared prefill compute and pads decode. We present BlockLock, which keeps shared batched prefill and pins only the numerical path of the protected request: it fixes the geometry that the request sees, with {two modes: BlockLock-Rows uses fixed-width rows and retains batched decode of all requests; BlockLock-Pack uses terminal-anchored packing with an isolated dummy segment, then extracts the protected request's KV state for target-only decode. Under a stated per-deployment contract, both modes preserve the target's output bitwise when its companions change.} Across five {dense} models (Qwen3-8B/14B, Llama-3.1-8B-Instruct, and Gemma-3-4B/12B-IT) and three single-GPU deployments (NVIDIA A6000, A100, and H100), we evaluate our approach on both tinyBenchmarks and BFCL{; we also include initial tensor-parallel experiments on two NVIDIA A6000 GPUs. Both modes preserve target sequences and Top20-logit bits in the reported tests.} At equal delivered work, {BlockLock-Rows} reduces latency by 53.5--55.0\% and improves throughput by 115.2--122.2\% relative to vLLM Batch-Invariant; compared with batch-invariant kernels, it needs no custom kernel implementations and constrains only the protected requests.

Prefix Keys and Values Matter Late: RIPE Caching for Self-Speculative Decoding in Looped Language Models

arXiv:2610.34436v1 Announce Type: new Abstract: A looped language model runs one block of layers $R$ times per token, so its key-value (KV) cache holds $R$ planes per recurrent layer, and self-speculative decoding (draft with a few loops, verify with all $R$) reads them all. We find that prefix keys and values matter late: at equal perturbation size, loops 25-32 are $e^{15.0}$ (Huginn-0125) and $e^{12.8}$ (Raven-Llama) times more sensitive than loops 2-9, and the planes approach the last one geometrically, at 0.88 and 0.81 per loop. Whether the deepest plane alone suffices then depends on how ripe the late planes are: on Raven, storing only it is indistinguishable from a bf16-to-fp32 change; on Huginn, 1% of positions carry 74% of its error. We turn this into RIPE, which stores the deepest

RSI-Opt: Recursive Self-Improvement Optimizer Agents For Model Training

arXiv:2610.32026v1 Announce Type: new Abstract: Conventional neural-network training typically follows a predefined optimization recipe, motivating a LLM agent that monitors training dynamics and adjusts optimizer settings as training progresses, but a fixed agent policy does not accumulate experience across runs. We introduce RSI-Opt, a plug-and-play Recursive Self-Improvement Optimizer Agents which evolves the knowledge that guides this process: a prompt, a playbook of procedures, a library of tested optimizer code, and a decision cadence. A meta-agent rewrites this policy using evidence from earlier runs, and an archive retains evaluated policies for further evolution. Across 5 generations on three training tasks, the meta-agents develop reusable procedures and code and conduct their ow

Toward Open ISA Supercomputing: A Comparative Study of RISC-V, Arm, and x86 Architectures on HPC Workloads

arXiv:2610.32632v1 Announce Type: new Abstract: RISC-V is emerging as a candidate architecture for high-performance computing (HPC), but its competitiveness against established x86 and Arm processors remains difficult to assess because existing studies use different platforms, workloads, and methodologies, and rarely consider energy efficiency. Our work provides an evaluation of contemporary HPC RISC-V, Arm, and x86 processors using a common software stack and methodology. We characterize the Sophgo SG2044 and compare it with the NVIDIA Grace CPU Superchip and Intel Xeon Platinum 8480+ across four HPC benchmarks (STREAM, HPL, HPL-MxP, and HPCG) and four representative applications (iPIC3D, PLUTO, OpenFOAM, and llama.cpp). The version of HPL-MxP linked to OpenBLAS built and used for this wo

Research reveals the local geometric structure of semantic meaning in large language models

A paper published on October 24, 2026, on arXiv (ID 2610.30715v1) characterizes the local geometric properties of semantic meaning in embedding space across four decoder-only large language models—Gemma 4, Llama 3.2, Qwen 2.5, and Pythia—using cross-lingual probes and fine-grained probes.

Why it mattersThis study is the first to systematically characterize the invariance, variability, and refinement mechanisms within “the same semantic factor” in LLMs, proposing the “local anisotropic neighborhood” model. The approach has been validated through blind human evaluations, demonstrating rigorous methodology, broad model coverage, and cross-architecture consistency in its findings.

FusionEval Released: A New Benchmark for Large Language Model Fusion

On October 24, 2026, researchers published the paper arXiv:2610.30162v1 on arXiv, introducing FusionEval—the first unified benchmark specifically designed to evaluate fusion methods for large language models. It covers vulnerable aspects such as reasoning chain length and tool invocation, and supports comparisons between fine-tuning-based and zero-shot fusion approaches.

Why it mattersThis benchmark fills the gap left by existing evaluations, which inadequately cover long-chain reasoning and tool usage; it clearly distinguishes between average performance and worst-case capability retention, provides a reproducible expert pool (based on Qwen3/Llama), multi-dimensional metrics (including GPU memory and runtime), and open-source code, offering strong practical guidance.

Research on Modulating the Capability Distribution of Large Language Models via Singular Value Spectrum Intervention: Empirical Analysis of Llama and Qwen Models

An AI study published on October 24, 2026, on arXiv (ID 2610.30676v1) applied post-hoc singular-value spectrum smoothing and spike perturbations to five open-source Llama and Qwen instruction-tuned models, finding that this lightweight intervention can systematically reshape the trade-offs in model performance across three capability domains: factual knowledge, language understanding, and deductive reasoning.

Why it mattersThis paper is the first to empirically demonstrate, within a multi‑model, multi‑task framework, the causal impact of the singular value spectrum of transformer feedforward layers on downstream capabilities, revealing structurally sensitive patterns in capability allocation and offering a new pathway for decoupling model capabilities and enabling controllable editing. All conclusions are based on publicly available models and standard benchmarks, with transparent methods and comprehensive evaluation dimensions.