Research library
Search papers on equipment connectivity, quality inspection, production analysis, and manufacturing work.
Search and filter
New paper summaries
Summaries are editorial notes, not statements by the original authors. Check the original paper. Updated 2026-11-20.
- 159Theory / Deep Learning
There Will Be a Scientific Theory of Deep Learning
- Traditional deep learning theory struggles to explain the complex, nonconvex, and overparameterized behavior seen in modern neural networks.
- Current deep learning system design and optimization practices often rely on empirical trial and error rather than a principled scientific foundation.
- A fundamental scientific understanding is needed to describe, characterize, and control increasingly powerful AI systems in terms of safety and interpretability.
- The paper proposes a scientific theory of learning dynamics for deep learning that aims to characterize the fundamental properties of neural networks and their training processes through first-principles computation.
- It advocates a scientific methodology for deep learning theory that emphasizes empirical observation, falsifiable predictions, and the search for simple, unifying principles.
- It synthesizes and reinterprets prior work across five categories, such as analytically solvable settings, insightful limits, and empirical laws, as evidence for the theory's feasibility and emergence.
- 158Agents / Multi-Agent / Safety
Diversity Collapse in Multi-Agent LLM Systems: Structural Coupling and Collective Failure in Open-Ended Idea Generation
- The assumption that multi-agent LLM systems inherently broaden idea diversity on complex creative tasks has been only weakly validated.
- When the underlying LLMs are homogeneous, different roles in a MAS often amplify shared pretraining biases rather than introducing true novelty, leading to computational inefficiency and early convergence.
- A lack of idea diversity in exploratory domains can trap users in narrow solution spaces, create overconfidence in suboptimal answers, and suppress unconventional hypotheses.
- We conducted a systematic empirical study using scientific research proposal generation as the task and evaluated diversity at three levels: model intelligence, agent cognition, and system dynamics.
- We developed a general three-stage multi-agent ideation pipeline consisting of role instantiation, iterative deliberation using a specified topology, and proposal synthesis by an editor agent.
- We quantified diversity with four complementary metrics, such as Vendi Score and Semantic Dispersion, and explored solutions by varying agent personas, group size, and communication topologies such as Nominal Group Technique (NGT) and Subgroups.
- 157Agents / RAG / Multi-Agent
MASS-RAG: Multi-Agent Synthesis Retrieval-Augmented Generation
- Large language models (LLMs) often generate factually unreliable or hallucinated outputs because they rely on static parametric knowledge.
- Traditional retrieval-augmented generation (RAG) struggles with noisy, incomplete, or irrelevant retrieval context, which degrades generation quality.
- Existing multi-agent RAG frameworks often use a single judging agent for filtering, which limits their ability to identify and exploit diverse, complementary evidence distributed across documents.
- We introduce MASS-RAG, a training-free multi-agent synthesis framework with specialized LLM agents for evidence refinement, selective candidate-answer generation, and final-answer synthesis.
- It uses three distinct filter agents, Summarizer, Extractor, and Reasoner, each of which processes retrieved documents from a unique and complementary perspective to refine query-relevant evidence.
- It uses a selective Answer Agent that independently generates candidate answers from each filtered response, and a Synthesis Agent that combines those candidates or the filtered evidence into a unified final answer.
- 156Agents / Memory / Architecture
Stateless Decision Memory for Enterprise AI Agents
- There is a gap between the sophisticated stateful memory structures used in academic LLM agent research and the simpler retrieval-augmented generation (RAG) pipelines widely used in enterprise deployment.
- Enterprise AI agents in regulated domains such as finance and healthcare require core system properties such as deterministic reproducibility, auditable provenance, multi-tenant isolation, and horizontal scalability.
- Existing stateful memory structures often violate these enterprise requirements because they rely on evolving internal representations and path-dependent updates.
- The paper proposes Deterministic Projection Memory (DPM), which consists of an append-only event log and a task-conditional projection mechanism.
- The append-only event log stores raw events, such as document chunks and tool outputs, in arrival order and serves as a single persistent source of truth.
- At decision time, a stateless projection component implemented as a single temperature-zero LLM call generates a structured memory view, such as facts, reasoning, and compliance notes, from the full event log and task specification, constrained by a fixed memory budget.
- 155Agents / EDA / Code Generation
Autonomous Evolution of EDA Tools: Multi-Agent Self-Evolved ABC
- The development of electronic design automation (EDA) tools is labor-intensive and constrained by the complexity of heuristic design, interactions among algorithms, and the reengineering effort required for large codebases such as ABC.
- ABC, the de facto standard for logic synthesis, is difficult to evolve because its monolithic 1.2-million-line C codebase, deep interdependencies, and static heuristics make it hard to integrate new research.
- Existing LLM-based code evolution frameworks were limited to isolated functions or smaller repositories of tens of thousands of lines, and could not handle the scale and multi-objective optimization of full EDA tools.
- The self-evolution framework integrates multi-agent LLMs (Claude Sonnet 4.5) with domain expertise and uses a pre-evolution knowledge bootstrapping stage that teaches the structure of ABC and the related literature.
- The multi-agent structure assigns specialized LLM agents, Flow, Mapper, Logic Minimization, and Planning, to distinct subsystems of the ABC codebase, enabling collaborative and localized code evolution.
- The evolutionary iterative workflow includes code generation, compilation, formal equivalence checking (CEC) for correctness, distributed benchmark evaluation, and QoR feedback to refine the tool.
- 154Agents / Web / Reasoning
Training LLM Agents for Spontaneous, Reward-Free Self-Evolution via World Knowledge Exploration
- Existing self-evolving LLM agents depend heavily on external human supervision, such as predefined tasks, workflows, or validated reward signals.
- Unlike humans, whose exploration is driven by curiosity, agents lack the ability to learn spontaneously and autonomously in new environments without explicit instructions or rewards.
- Current paradigms often shift the engineering burden into complex agent orchestration instead of enabling genuine workflow-free, reward-free self-evolution.
- The authors introduce Native Evolution, a decoupled agent life cycle in which the agent autonomously explores the environment at inference time without tasks or rewards and summarizes the experience into structured World Knowledge, or K.
- They develop an outcome-based reward function used only during training that measures the usefulness of the generated K by performance on potential downstream tasks.
- They use a two-stage training framework that first applies supervised fine-tuning to internalize meta-evolutionary behavior and then applies reinforcement-based rejection sampling to optimize exploration and information-management strategies.
- 153Agents / RAG / Skills
Skill-RAG: Failure-State-Aware Retrieval Augmentation via Hidden-State Probing and Skill Routing
- Existing retrieval-augmented generation systems often diagnose post-retrieval failure poorly and respond with generic retries instead of addressing the root cause.
- Persistent retrieval failures often arise from a structural mismatch between the user query and the available evidence, such as broad queries or multi-hop questions, which cannot be fixed by repeated retrieval alone.
- Traditional adaptive RAG approaches lack fine-grained, failure-conditioned control and cannot distinguish different types of retrieval mismatch or the model's internal failure state.
- Skill-RAG uses a recurrent pipeline with a hidden-state prober that detects whether the LLM is in a failure state based on its internal representation after retrieval.
- When failure is detected, a prompt-based skill router diagnoses the specific cause of the query-evidence mismatch and selects one of four predefined target retrieval skills, such as query rewriting, question decomposition, or evidence focusing.
- The selected skill performs corrective actions such as restructuring the query and triggering a new retrieval round, and the loop continues until the prober indicates sufficiency, a termination skill is chosen, or the maximum number of rounds is reached.
- 152LLMs / Architecture / Distillation
Attention to Mamba: A Recipe for Cross-Architecture Distillation
- Transformer models are powerful, but they incur quadratic compute cost as sequence length grows, which limits efficiency on long sequences and inference.
- Alternative linear architectures, including state-space models such as Mamba, offer efficiency but often underperform Transformers on downstream tasks at scale.
- Previous attempts at cross-architecture distillation from Transformers to Mamba-like structures struggled to preserve performance and often required hybrid attention-SSM solutions.
- The paper develops a principled two-stage distillation recipe that transfers first from Softmax Attention to Linear Attention (Hedgehog), and then from Linear Attention to adapted Mamba (HedgeMamba).
- The Mamba SSM mixer parameters are initialized using the feature maps learned in the Linear Attention stage, and additional Mamba components are set to act as identity operators.
- The full HedgeMamba structure is then fine-tuned with standard cross-entropy loss on the answers, activating all Mamba components.
- 151Agents / Self-Improvement
Autogenesis: A Self-Evolving Agent Protocol
- Recent advances in LLM-based agent systems have shown promise for handling complex long-horizon tasks.
- However, existing agent protocols, such as A2A and MCP, do not adequately specify entity lifecycle and context management, version tracking, or evolution-safe update interfaces, which encourages monolithic designs and fragile glue code.
- The paper introduces Autogenesis Protocol (AGP), a self-evolving protocol that separates what evolves from how evolution happens.
- Its Resource Substrate Protocol Layer (RSPL) models prompts, agents, tools, environments, and memory as protocol-native resources with explicit state, lifecycle, and versioned interfaces.
- Its Self Evolution Protocol Layer (SEPL) specifies closed-loop operator interfaces for proposing, evaluating, and confirming improvements, with auditable lineage and rollback.
- Building on AGP, the paper presents Autogenesis System (AGS), a self-evolving multi-agent system that dynamically instantiates, retrieves, and refines protocol-native resources at runtime.
- 150Agents / Safety / Evaluation
Multi-User Large Language Model Agents
- Large language models and their agents are optimized mainly for single-actor interaction scenarios, which overlooks distinct user identities, roles, and potentially conflicting goals.
- Existing LLM agent systems lack native protocols for distinguishing user roles, enforcing information boundaries, or resolving conflicts among multiple users' interests.
- Current models struggle to manage the heterogeneous utility, different permission levels, information asymmetry, and privacy constraints embedded in realistic team workflows and organizational tools.
- The authors formalize multi-user LLM interaction as a multi-actor decision problem in which a single agent optimizes a weighted social objective while accounting for each user's utility, permissions, and access-control policy.
- They establish a unified interaction protocol that defines user personas with explicit permissions and private context, along with agent mechanisms that observe shared context and provide personalized updates.
- To empirically evaluate modern LLMs on multi-actor tasks, they design a suite of three stress-test scenarios: multi-user instruction following, user-to-user access control, and multi-user meeting coordination.
- 149Agents / Web / Skills
WebXSkill: Skill Learning for Autonomous Web Agents
- Autonomous web agents struggle with long-horizon, multi-page workflows because they do not effectively retain and reuse procedural knowledge.
- Existing skill formulations suffer from a grounding gap, where skills are either interpretable but not executable, or executable but opaque to the agent.
- Prior skill-learning methods often require high acquisition cost or lack context-aware retrieval, which limits scalability and efficiency.
- WEBXSKILL proposes a new executable skill that combines parameterized action programs with step-level natural-language guidance, which supports both direct execution and agent interpretation.
- It implements a three-stage pipeline for skill management: extraction from synthetic trajectories, organization into a URL-based skill graph, and deployment through grounded or guided modes.
- The framework uses LLM-based abstraction for skill generalization and a curation process that includes online deduplication and executability checks to build a robust skill library.
- 148Agents / Coding / Production
LLM-Based Automated Diagnosis Of Integration Test Failures At Google
- Diagnosing integration test failures is highly time-consuming, often taking hours or days, and imposes a substantial cognitive burden on developers.
- Modern distributed systems produce huge volumes of logs, averaging 11,058 lines across 26 files per failure from many distributed, dynamically named sources, which makes manual inspection difficult.
- Logs are often semi-structured and heterogeneous, with a low signal-to-noise ratio, so many warnings and errors unrelated to the real root cause obscure the key information.
- The authors implemented Auto-Diagnose, an LLM-centered automation pipeline that collects and aggregates logs from the test driver and system under test (SUT) components when an integration test fails.
- It uses Gemini 2.5 Flash together with carefully designed prompt templates that include step-by-step guided reasoning, strict negative constraints to prevent guessing, and a precise output format for diagnosis.
- The LLM output is post-processed into readable Markdown and the identified relevant log lines are made clickable, integrating diagnosis directly into Google's internal code review system, Critique, for a smooth developer workflow.
- 147Agents / Memory
Memory Transfer Learning: How Memories are Transferred Across Domains in Coding Agents
- Existing self-evolving AI agents for coding tasks usually restrict memory use to homogeneous task domains and overlook the shared infrastructural substrate, such as programming languages and runtime environments.
- This limitation prevents agents from leveraging transferable knowledge across diverse real-world coding problems, which hurts generalization and robust performance.
- Prior work lacked a systematic study of how memory transfers across domains and of the design principles for effective memory in these heterogeneous settings.
- The paper develops Memory Transfer Learning, a two-stage process consisting of offline memory generation from agent reasoning trajectories and online memory retrieval while solving new tasks.
- Using an LLM for generation, it creates four distinct memory representations, Trajectory, Workflow, Summary, and Insight, spanning low-level task details through high-level generalized meta-knowledge.
- It retrieves the most relevant memory from heterogeneous domain memory pools using embedding-based cosine similarity and supplies it to the coding agent's system prompt.
- 146LLMs / Architecture
Nemotron 3 Super: Open, Efficient Mixture-of-Experts Hybrid Mamba-Transformer Model for Agentic Reasoning
- Existing large language models struggle with reasoning efficiency and real-world deployment cost, and earlier Mixture-of-Experts (MoE) designs often ignored real latency and memory-bandwidth constraints.
- Scaling large language model pretraining to trillions of tokens while preserving stability and accuracy in low-precision formats remains unsolved, and it hinders energy efficiency and hardware friendliness.
- Developing robust and generalizable agentic reasoning capabilities in LLMs for multi-stage tool use and long-horizon tasks requires both specialized architectural and training approaches.
- The paper introduces a hybrid Mamba-attention Mixture-of-Experts (MoE) architecture with a new LatentMoE design for efficient routing and a Multi-Token Prediction (MTP) mechanism that improves modeling quality and speculative decoding.
- It performs large-scale pretraining on 25 trillion tokens using NVIDIA's proprietary low-precision NVFP4 format, demonstrating stability and accuracy at scale.
- It implements a multi-stage post-training pipeline that combines extensive supervised fine-tuning (SFT) with multi-environment reinforcement learning from verifiable rewards (RLVR), with a focus on agentic reasoning and long-context capability up to 1M tokens.
- 145Agents / Evaluation / Coding
AlphaEval: Evaluating Agents in Production
- There is a substantial research-to-production gap in AI agent evaluation because current benchmarks do not reflect the complexity of real-world commercial deployment.
- Traditional benchmarks rely on explicitly defined requirements, deterministic metrics, and static tasks, which contrasts with operational settings characterized by implicit constraints, subjective judgment, and changing demands.
- Evaluation often focuses on the base language model and overlooks the substantial effect of the full agent product or scaffold on real-world performance.
- The authors introduced AlphaEval, a benchmark with 94 tasks collected from seven companies across six O*NET job zones and derived from active commercial deployments.
- They implemented a four-stage requirements-to-benchmark construction framework that turns authentic, under-specified operational requirements into executable and automated evaluation tasks.
- They integrated a pluralistic evaluation methodology, such as reference answers, formal logic, rubric-based scoring, and execution-based scoring, with LLM-as-a-Judge and task-specific economic-value annotations.
- 144Agents / Research
Toward Autonomous Long-Horizon Engineering for ML Research
- Current autonomous AI systems struggle with long-horizon tasks that take hours to days and require sustained, coherent progress across multiple stages.
- Machine learning research papers are often underspecified, forcing agents to infer missing implementation details and manage complex environment setup.
- Interpreting delayed and noisy experimental feedback and maintaining project state continuity across iteration cycles pose major challenges.
- AiScientist implements thin control over thick state, where the top-level Orchestrator uses concise summaries and detailed project information lives in a permission-scoped shared workspace.
- It uses a File-as-Bus protocol for artifact-mediated coordination and leverages the structured organization of the shared workspace to preserve persistent state and cumulative progress.
- Its hierarchical orchestration model lets the Orchestrator delegate tasks to Tier-1 specialist agents exposed as callable tools, such as paper-understanding, implementation, and experimentation experts.
- 143Reasoning / Efficiency
LightThinker++: From Reasoning Compression to Memory Management
- LLMs generate many tokens, and the quadratic complexity of attention together with the linear growth of the KV cache creates substantial compute and memory overhead for complex reasoning.
- Existing context management techniques such as prompt engineering and real-time token pruning often require extensive data construction or introduce significant inference latency.
- Implicit compression methods are efficient, but they risk irreversible information loss that can create a logical bottleneck in complex reasoning tasks that require detailed intermediate steps.
- The initial framework, LightThinker, trains the LLM to implicitly compress long reasoning traces into concise semantic representations using special gist tokens and split attention masks.
- LightThinker++ extends this with explicit, action-level memory management through primitives such as commit, expand, and fold, enabling dynamic preservation of semantic summaries and restoration of raw reasoning detail.
- It uses a specialized environment-aware trajectory synthesis pipeline to train the model with purposeful memory scheduling and generate expert demonstrations that interleave reasoning with explicit memory operations.
- 142Multimodal / Medical
MedGemma 1.5 Technical Report
- We introduce MedGemma 1.5 4B, the latest model in the MedGemma collection.
- MedGemma 1.5 extends MedGemma 1 by integrating additional capabilities: high-dimensional medical imaging, including CT and MRI volumes and whole-slide histopathology images; anatomical localization with bounding boxes; multi-view chest X-ray analysis; and improved medical document understanding, including lab reports and electronic health records.
- The report details the innovations needed to enable these modalities within a single architecture, including new training data, long-context 3D volume slicing, and whole-slide pathology sampling.
- Compared with MedGemma 1 4B, MedGemma 1.5 4B shows substantial gains on these new domains, improving 3D MRI state classification accuracy by 11% and 3D CT state classification by 3% in absolute terms.
- On whole-slide pathology images, MedGemma 1.5 4B improves macro F1 by 47%.
- It also improves anatomical localization in chest X-rays by increasing Intersection over Union by 35%, and it achieves 4% macro accuracy on longitudinal chest X-ray analysis.
- 141Agents / Skills
How Well Do Agentic Skills Work in the Wild: Benchmarking LLM Skill Usage in Realistic Settings
- Existing LLM agent skill benchmarks often rely on idealized conditions, where preselected, hand-crafted skills are provided directly to the agent.
- In real-world scenarios, agents face challenges such as independently selecting relevant skills from many options, retrieving skills from large and uncurated repositories, and adapting general skills to specific queries.
- The true utility and limits of agent skills under practical, non-ideal conditions have remained largely unquantified.
- The authors built a large dataset of 34,198 real-world skills to simulate realistic retrieval and adaptation conditions for LLM agents.
- They developed a skill retrieval engine and evaluated different retrieval strategies, including keyword, semantic, hybrid, and agentic retrieval, to identify effective skill discovery methods.
- They evaluate LLM agent performance across six progressively more realistic settings on SKILLSBENCH and TERMINAL-BENCH 2.0, introducing the challenges of selection, retrieval, and adaptation.
- 140Agents / Coding
Scaling Coding Agents via Atomic Skills
- [Withdrawn paper] The latest arXiv version, v2, states that Yue Liu has withdrawn this paper; this version was posted on 24 April 2026.
- The stated reason is that significant data errors discovered after submission affect the validity of the results; the author says a corrected version may be submitted later.
- Official reason: We request standard withdrawal of this submission because significant errors were discovered in the data after submission, which affect the validity of the results. We may submit a corrected version later
- Previously described methods and performance figures were pre-withdrawal claims and are not presented as valid research findings or grounds for recommending adoption.
- Official withdrawal notice and version history: https://arxiv.org/abs/2604.05013 .
- 139Agents / Evaluation
The Art of Building Verifiers for Computer Use Agents
- Reliable verification of task success for Computer Use Agents is difficult because trajectories are long, visually rich, and ambiguous.
- Human annotation of CUA trajectories is tedious and expensive, and it often misses subtle or transient failures.
- Existing automatic verification systems have high false-positive rates because they struggle with token limits, context management, and correctly attributing success or failure in complex environments.
- It introduces Universal Verifier (UV), an evaluation system for CUA trajectories based on four principles of robust verification.
- It uses carefully designed non-overlapping rubrics and two-pass grading to detect hallucinations, and it separates evaluation into process rewards and binary outcome labels.
- UV distinguishes controllable agent failures from uncontrollable environmental factors and uses a divide-and-conquer strategy for multimodal context management with screenshot evidence.
- 138Agents / Multi-Agent
Single-Agent LLMs Outperform Multi-Agent Systems on Multi-Hop Reasoning Under Equal Thinking Token Budgets
- It is unclear whether the performance gains in multi-agent LLM systems are due to structural advantages or simply to higher test-time compute.
- Prior comparisons between MAS and single-agent systems are often confounded by unequal token usage, which makes direct comparisons unreliable.
- A robust evaluation method that strictly controls thought-token budgets is needed to clarify the source of the gains.
- They introduce a theoretical framework based on the Data Processing Inequality to argue for the information efficiency of single-agent systems under a fixed reasoning budget.
- They extensively evaluate a range of single-agent and multi-agent architectures, including Sequential, Debate, and Ensemble, across three LLM families, Qwen3, DeepSeek, and Gemini, on the multi-hop reasoning tasks FRAMES and MuSiQue.
- They enforce strict control of the thought-token budget, meaning intermediate reasoning tokens excluding the prompt and final answer, to ensure fair comparisons across systems.
- 137Agents / Memory
Memory Intelligence Agent
- Existing memory systems for Deep Research Agents primarily rely on long-context memory, which leads to attention dilution, noise injection, and high storage and compute costs.
- Most existing memory systems capture knowledge-oriented memory, or what, but fail to use process-oriented memory and conceptual knowledge, or how, which are central for guiding future planning in deep research.
- The poor planning and execution of DRA come from the fact that, when memory is used only for few-shot Chain-of-Thought (CoT), the planner lacks task-specific learning and the executor misreads instructions.
- MIA proposes a Manager-Planner-Executor architecture that separates nonparametric memory storage of past search trajectories from parametric planning and execution, and it uses a hybrid retrieval strategy.
- A two-stage alternating reinforcement learning (RL) strategy promotes synergistic co-evolution between the Planner and the Executor, ensuring alignment between high-level planning and effective low-level task execution.
- Test-Time Learning (TTL) and a new unsupervised evaluation framework enable continuous self-evolution, allowing the agent to refine both nonparametric and parametric memory online without explicit supervision.
- 136LLMs / Architecture
Neural Computers
- Traditional computers, AI agents, and world models often split computation, memory, and input-output into separate hardware or software modules, or into external execution environments.
- Existing systems depend on explicit, human-designed instruction sets, which can become rigid in domains that require high-dimensional, statistical, and globally coupled processing.
- Existing AI agents usually mediate an external execution environment rather than internalizing the executable state into the computer itself.
- This paper proposes Neural Computer (NC), in which the neural network itself acts as an active computer by internalizing computation, memory, and input-output within a latent runtime state.
- NC is implemented as a video model that can roll out screen frames based on commands and user actions, and it is trained directly on input-output traces from command-line interface (CLI) and graphical user interface (GUI) environments.
- The method includes using a diffusion transformer, a VAE, and specialized techniques for action injection and cursor supervision to develop interface-specific prototypes called NC-CLIGen and NC-GUIWorld.
- 135Multi-Agent / Theory
On the Reliability Limits of LLM-Based Multi-Agent Planning
- It models agents, messages, private tool signals, end actions, and optional human escalation within a single Bayesian risk framework rather than as role names such as planner or critic.
- It proves an upper bound on reliability: when there is no new exogenous information, additional agent steps can only transform or compress shared evidence, not beat a centralized Bayesian decision-maker who has that evidence.
- It characterizes inter-agent prose as a lossy communication channel. The relevant design metric is posterior distortion, not the number of agents, the number of rounds, or transcript length.
- The experiments show a large relay penalty. gpt-4.1-mini drops from 90.7 percent single-agent accuracy to 41.2 percent with two relay agents, 43.5 percent with three, and 22.5 percent with five, while posterior-vector communication reaches 75.2 percent versus 58.1 percent for prose on a matched subset.
- Tool use matters only when it changes the information structure. Wikipedia access is mostly redundant on MMLU, but synthetic KB lookups raise accuracy from 24.3 percent without tools to 82.7 percent.
- 134LLMs / Economics
The Price Reversal Phenomenon: When Cheaper Reasoning Models End Up Costing More
- The method defines real cost as the sum of input-token and output-token costs, includes thinking tokens in billable output, and compares rankings based on list price with rankings based on measured total cost.
- They audited eight RLMs, including GPT-5.2, Gemini 3 Flash/Pro, Claude Opus/Haiku, Kimi, and MiniMax variants, across 9 datasets and 11,872 queries, using prices from February and March 2026.
- Among 252 pairwise comparisons, 21.8% showed price reversal. Gemini 3 Flash is 78% cheaper than GPT-5.2 on the published price, but 22% more expensive in total cost, and in a cited extreme case it cost 28 times more than Claude Haiku 4.5 on MMLUPro.
- RLM procurement should benchmark real workloads and disclose per-request prompt, reasoning, and final-generation cost breakdowns, because even semantic or length-based predictors face stochastic variation in thinking tokens.
- 133Multi-Agent
Self-Organizing LLM Agents
- Methodologically, the study formalizes agent organization as a dynamic system with roles, interaction phases, memory, impact, and stochastic LLM behavior, and then compares eight coordination protocols under the same task and evaluation pipeline.
- The core idea is that sequential coordination gives only order and visibility into previous outputs, which allows agents to create task-specific roles without fixed role prompts, skip low-value participation, and form shallow hierarchies.
- As a result, on complex tasks sequential coordination reaches much higher quality than fully shared or fully autonomous coordination and exceeds a centralized coordinator by 14%. Quality remains stable up to 256 agents, and 8 agents generate 5,006 distinct role names.
- The limitation and the takeaway are that self-organization is bounded by capability. Strong models benefit, while weak models may degrade, so the practical prescription is not to remove all structure but to use a minimal scaffold with models that can perform meta-reasoning.
- 132Code Agents / Long Context
Coding Agents are Effective Long-Context Processors
- The method is to represent long documents and large corpora as navigable files and directories, then let the coding agent choose executable operations such as grep, sed, Python aggregation, and note files.
- The core idea is that long-context reasoning becomes environment interaction, so the model no longer needs to compress everything into latent attention or a single retrieved snippet.
- As a result, it reports an average improvement of 17.3 percent over the previous best published system, achieves SOTA on four of five benchmarks, and shows strong scaling from 188K-token context to a 3-trillion-token Wikipedia corpus.
- The limitation and implication are that this approach depends on the agent's tool capabilities and on data organization, and that naive retriever addition can suppress useful exploration, so future systems need retrieval that complements rather than replaces filesystem search.
- 131Agents / Benchmarks
Meta-Harness: End-to-End Optimization of Model Harnesses
- The core idea is to treat the harness as executable stateful code rather than a prompt template, and to search the end-to-end logic of retrieval, memory, prompt assembly, and environment handling.
- In the optimization loop, a coding-agent proposer explores an uncompressed filesystem of prior code, scores, prompts, model outputs, tool calls, and traces, then submits a new harness candidate for evaluation.
- In the empirical results, online classification accuracy was 48.6 percent versus 40.9 percent for ACE while using four times fewer context tokens, average accuracy improved by 4.7 points on 200 IMO-level math problems across five held-out models, and TerminalBench-2 results reached 37.6 percent for Claude Haiku 4.5 and 76.4 percent for Claude Opus 4.6 in the alphaXiv report.
- The significance is that raw traces let the proposer debug long-horizon credit-assignment failures, such as when an early memory miss causes a later answer failure that a score-only or summary-only optimizer would miss.
- 130Code Agents
Effective Strategies for Asynchronous Software Engineering Agents
- The core method is this: a manager builds a task dependency graph, delegates only qualified nodes, and updates the state when engineer agents complete sub-tasks.
- The execution model is this: engineers edit in isolated git worktrees, run local tests before committing, and return changes through a structured branch-and-merge pipeline.
- Empirically, CAID improves PaperBench by 26.7 percentage points and Commit0-Lite by 14.3 percentage points over the single-agent baseline, suggesting gains in both accuracy and long-horizon coordination.
- A key takeaway is that parallelism has an optimum. Two to four engineers help, but with eight engineers results can worsen as merge conflicts, dependency waits, and verification overhead outweigh the added headcount.
From research to product use
Operating capabilities, pilots, and technologies in development are identified separately.
View technology