The latest AI news, in focus.

Why Pay for Long Reasoning When Rewrite Do Trick? Causal Effects of Reasoning History Compaction on Future Generation and Agent Cost

arXiv:2611.03852v1 Announce Type: new Abstract: Reasoning substantially improves language models' ability to solve difficult problems, but long reasoning traces make these gains expensive. Efficient reasoning should express useful analysis in fewer tokens by reducing repetition and text that adds little value to solving the problem. Progress in proprietary models motivates this goal, yet their hidden scratchpads limit direct study of how it is achieved. We investigate whether open-weight models can generate less verbose reasoning by changing the form of their own earlier thoughts, without retraining. Our intervention rewrites prior reasoning into compact state records before pending tool results are revealed, then compares continuations from original and compact histories. Across the tested models, accepted compact histories usually shorten future reasoning; a coding case study also shows less repeated verification after a shared candidate solution. In software-agent deployments, compaction can reduce total spending, although task quality and rewrite-inclusive time depend on the target and compressor. These findings identify reasoning history as one way to reduce future reasoning-token use and motivate model-specific compaction policies evaluated for both efficiency and retained capability.

3, 7, 14, 17, 42: Instruction Tuning Installs and Sharpens Number-Choice Heuristics in Language Models

arXiv:2610.36178v1 Announce Type: new Abstract: We measure, without sampling error, the probability a language model assigns to each integer from 1 to N when asked for a random number. For a fixed prompt the model defines one probability vector, which we compute by summing over each integer's scored spellings rather than estimate by sampling, removing the noise that limits earlier studies [1, 4]. We evaluate 18 open-weight model lines at five ranges up to N = 100, under 29 decoding configurations, on two inference stacks; 15 of them have matched base and instruction-tuned checkpoints that both give usable answers. Instruction tuning makes the distribution less uniform in all 15 pairs. It installs one heuristic, round-number avoidance, and sharpens another, endpoint avoidance. Base checkpoi

$\Psi$-0.6: Adaptive Streams of Thought in a Unified Vision-Language World Model

arXiv:2610.32177v1 Announce Type: new Abstract: Humans reason about the physical world by flexibly combining different forms of inference as a problem unfolds. Achieving this flexibility is a major open challenge in AI: capabilities often remain separated across specialized models, limiting how they can be composed and jointly adapted to a task. We introduce $\Psi$-0.6, a unified vision-language world model that adaptively composes perception, language, geometry, and simulation within a shared reasoning process we call streams of thought. These streams interleave images, text, and explicit representations of geometry and motion, all of which the model can generate and interpret through a shared token interface. $\Psi$-0.6 surpasses leading open-weight models zero-shot on multi-view spatial

How Much Do You Trust A Dog? Quantifying Hint-Following in Reasoning Language Models

arXiv:2610.32055v1 Announce Type: new Abstract: Large language models (LLMs) often exhibit sycophancy, altering their answers to align with user suggestions even on objective factual and reasoning tasks. Yet the quantitative form of this influence--- and whether it is calibrated to source reliability--- remains poorly understood. In this work, we investigate this behavior through hint-induced answer shifts on MMLU questions, evaluating prompts of the form ``[Source] thinks the answer is (X)''. We systematically vary the source to which the hint is attributed (a professor, a friend, or a dog) across three open-source model families, Qwen, Gemma, and SmolLM. We show that the change induced by the hint follows a predictable structure well-characterized by an exponential tilt: the hint induces

SpecMem introduces a real-time tool-call memory management mechanism, enhancing the agent’s response speed.

On October 26, 2026, arXiv published a preprint paper titled “SPECMEM: Accelerating Agentic Tool Calling via Live Memory Management” (ID 2610.31840v1), introducing a new system called SpecMem that significantly reduces tool-call latency by enabling cross-session, online, user-level memory management for tool invocations.

Why it mattersThis study addresses the high latency issue in deploying current tool‑calling agents, which arises from autoregressive decoding. It proposes key techniques such as verifiable write‑back, LRU eviction, and side‑effect gating, and validates their effectiveness on real query streams involving multiple users and sessions—achieving up to 1.74× measured speedup and a 27% average increase in accepted tokens. This represents an important advance in the field of AI system engineering.

Can Test-Time Memory Evolution Outperform Test-Time Training for Scientific Discovery?

arXiv:2610.32046v1 Announce Type: new Abstract: Recent \emph{test-time training} (TTT) frameworks have enabled open-weight large language models (LLMs) to outperform inference-only frameworks powered by frontier models on scientific discovery tasks. However, TTT introduces additional computational cost for online weight updates during the discovery process, making computational efficiency an important consideration when scaling to larger models. This motivates us to explore an efficient \emph{test-time adaptation} method for scientific discovery. We introduce \emph{Test-Time Memory Evolution} (TTME), a plug-and-play test-time adaptation method, as an alternative to TTT. TTME continually updates the external memory by distilling the experience to guide subsequent discovery without updating

Research reveals that open-source large models commonly exhibit list-filling phenomena in structured extraction.

An empirical study published on October 24, 2026, on arXiv (paper ID 2610.30997v1) found that when a JSON extraction schema specifies a minimum number of items in the list but the actual document content falls short, eight open-source weighting models generally treat this minimum value as a generation target rather than a constraint, resulting in 55.4% of output lists exceeding the true count (compared to a baseline of 34.5%). The filler items are often drawn from the original text, and about half pass the source‑consistency check; common mitigation strategies prove only marginally effective.

Why it mattersThis study employed a preregistered protocol to systematically evaluate eight open-source models and six hosted-service models across 558 real-world documents and nine annotated datasets. With a rigorous methodology and publicly available data—both the code and results have been released on GitHub—it reveals a critical yet often overlooked deficiency in structured information extraction that undermines the reliability of downstream tasks: schema‑induced non‑faithful filling behavior.