论文

本文以 Oracle-to-PostgreSQL 迁移为受控软件转换任务，研究跨 agent 的 specification portability。研究包含两个阶段：首先在 1,006 个 PL/SQL 文件上评估 specification-first 迁移 pipeline，其中 623 个成功重新生成，380 个生成脚本在 PostgreSQL 16 中成功执行；其次使用 Amazon Kiro、Google Gemini 与 GitHub Copilot（含 Claude Code 与 Cursor）在 1,802 个 Oracle 脚本及其对应 PostgreSQL 实现的[数据集]上进行跨 agent 实验。This paper investigates cross-agent specification portability using Oracle-to-PostgreSQL migration as a controlled software transformation task. The study combines two experimental stages. First, a specification-first migration pipeline was evaluated on 1,006 PL/SQL files, of which 623 were successfully regenerated and 380 generated scripts executed successfully in PostgreSQL 16. Second, cross-agent experiments were conducted on a dataset of 1,802 Oracle scripts with corresponding PostgreSQL implementations using Amazon Kiro, Google Gemini, and GitHub Copilot, with Claude Code and Cursor inclu

我们提出 PhysCaP，一种面向机器人操作主动感知的物理信息驱动 code-as-policy agent。尽管 vision-language-action 策略擅长模仿示教，但它们依赖被动观察，无法推断对操作至关重要的潜在物理属性。PhysCaP 在 code-as-policy 框架基础上引入物理信息驱动的探索层，通过交互实现显式信息获取。它提出了无需训练的物理属性提取模块，仅依靠机器人本体感知即可估算物体质量和刚度，无需额外传感器。为了在 balanWe present PhysCaP, a Physics-Informed Code-as-Policy agent for active perception in robotic manipulation. While vision-language-action policies excel at imitating demonstrations, they rely on passive observation and fail to infer latent physical properties critical for manipulation. PhysCaP augments code-as-policy frameworks with a physics-informed exploration layer that enables explicit information-seeking through interaction. It introduces training-free physical property extraction modules that estimate object mass and stiffness from robot proprioception without additional sensors. To balan

开放式真实交互允许多种有效行为：Agent 可直接回答、请求澄清、提供进度更新，或在执行前进行确认。这种灵活性打破了基于分组的 RL 的核心假设：同一分组内对比的 rollout 不再保证行为可比。因此奖励模型对交互风格的偏好可能扭曲相对优势，使优化偏向奖励偏好的行为而非情境适配的行为。我们将其形式化为奖励公平性问题，并提出 ARC（Advantage RegularizatiOpen-ended real-world interaction admits multiple valid behaviors: an agent may answer directly, ask for clarification, provide progress updates, or confirm before acting. This flexibility breaks a core assumption behind group-based RL: rollouts compared within a group are no longer guaranteed to be behaviorally comparable. As a result, reward-model preferences over interaction style can distort relative advantages and steer optimization toward reward-preferred behaviors rather than context-appropriate ones. We formalize this as a reward fairness problem and propose ARC (Advantage Regularizati

一条安全规则与一段情景日志在同一 AI Agent 上下文中争夺 token。当预算溢出时，二者以相同速率被压缩；但只有规则需要精确措辞才能保持可执行性。在 20 种生产环境 Agent 配置下，Claude Code 基于 Sonnet 4.6 的 /compact 提示在一轮压缩后保留 53% 的安全规则，五轮后仅保留 10%。我们将此现象命名为"压缩悬崖"（Compaction Cliff）。我们提出 Knowledge Triage 框架，通过对 Agent 知识库的每一行按类型分类，并为每类配置独立的保留策略来解决该问题。三种确定性 operatA safety rule and an episodic log compete for the same tokens in an AI agent's context. When the budget overflows, both are summarized at the same rate; only the rule needs exact wording to remain enforceable. On 20 production agent configurations, Claude Code's /compact prompt on Sonnet 4.6 preserves 53\% of safety rules after one compaction round and 10\% after five. We name this the Compaction Cliff. We address it with Knowledge Triage, a framework that classifies each line of an agent's knowledge base by type and routes each type through its own retention policy. Three deterministic operat

自主研究系统执行长研究工作流的能力日益增强，但仅靠自动化并不能确保所得流程保持科学严谨性。我们提出 AutoResearch，一个两阶段系统，将 Idea Generation 与 Idea Execution 相连，以同时解决研究想法如何形成以及如何通过实验可靠建立的问题。在 Idea Generation 中，AutoResearch 持续整合新出现的研究信号与累积的领域知识，识别可迁移的机理洞察，并采用多模型生成与跨模型Autonomous research systems are increasingly capable of executing long research workflows, yet automation alone does not ensure that the resulting process remains scientifically grounded. We introduce AutoResearch, a two-stage system that connects Idea Generation with Idea Execution to address both how research ideas are formed and how they are reliably established through experimentation. In Idea Generation, AutoResearch continuously integrates emerging research signals with accumulated domain knowledge, identifies transferable mechanistic insights, and uses multi-model generation and cross-r

本工作提出 QBugLM，一个多 Agent 框架，可自动化量子软件调试流水线，覆盖基于分类法的缺陷注入、基于 LLM 的检测与修复，直至基于仿真的验证，框架无关地支持 OpenQASM 3.0 程序。This work proposes QBugLM, a multi-agent framework that automates the quantum software debugging pipeline, from taxonomy-driven bug injection to LLM-based detection and repair, and finally to simulation-based validation, for framework-agnostic OpenQASM 3.0 programs.

PLENA 是一个软硬件协同设计的系统，采用三条核心优化路径，具备新颖的扁平化 systolic-array 架构以及支持非对称量化方案的高效计算与存储单元（路径 2）。PLENA is a hardware-software codesigned system that applies three core optimization pathways that features a novel flattened systolic-array architecture and efficient compute and memory units that support an asymmetric quantization scheme (Pathway 2).

GLM-5 在真实编码任务中展现出前所未有的能力，在端到端软件工程挑战的处理上超越既有基线，并提出了新颖的异步 Agent RL 算法，进一步提升了 RL 质量。GLM-5 demonstrates unprecedented capability in real-world coding tasks, surpassing previous baselines in handling end-to-end software engineering challenges and proposing novel asynchronous agent RL algorithms that further improve RL quality.

本教程综合了推动这些汇聚方向的算法、系统与设计原则，为数据科学与数据挖掘研究者提供统一视角，涵盖将 LLM、图数据管理、图挖掘、图 ML 与 agentic 计算融合到下一代 graph-native AI 系统中。This tutorial synthesizes the algorithms, systems, and design principles driving these converging directions, offering data science and data mining researchers a unified perspective on integrating LLMs, graph data management, graph mining, graph ML, and agentic computation into next-generation graph-native AI systems.

本文认为，AI agent——即以大语言模型作为主要推理引擎、动态生成与丢弃代码作为工具性资源的系统——的出现构成了对"软件"本身的根本性重构，而非渐进式的工具改进。This paper argues that the emergence of AI agents -- systems where large language models serve as the primary reasoning engine, dynamically generating and discarding code as an instrumental resource -- constitutes a fundamental restructuring of what software is, not an incremental tool improvement.

本文提出 Memanto，一种面向 agentic 人工智能的通用记忆层，挑战了"必须依赖知识图谱复杂度才能实现高保真 agent 记忆"的普遍假设，并取得 SOTA 准确率。Memanto is introduced, a universal memory layer for agentic artificial intelligence that challenges the prevailing assumption that knowledge graph complexity is necessary to achieve high fidelity agent memory and achieves state of the art accuracy scores.

Continuum，一个通过为 KV cache 保留引入 TTL 机制来优化多轮 Agent 工作负载任务完成时间的服务系统，能保持多轮连续性，并降低 Agent 工作流的延迟。Continuum, a serving system to optimize job completion time for multi-turn agent workloads by introducing time-to-live mechanism for KV cache retention, preserves multi-turn continuity, and reduces delay for agentic workflows.

本文对一个自 2026 年 3 月起持续运行的个人助理 Agent 运行时中的静默失败进行纵向研究，该系统包含约 40 个定时任务、8 个 LLM 提供商、一个工具治理代理以及一个知识库记忆层，由 4,286 个单元测试和 827 项治理检查守护。A longitudinal study of silent failures in a personal-assistant agent runtime in continuous production since March 2026, with roughly 40 scheduled jobs, 8 LLM providers, a tool-governance proxy, and a knowledge-base memory plane, defended by 4,286 unit tests and 827 governance checks is presented.

结果表明，纯视觉设置会降低准确率并增加 token 成本，因为 Agent 缺乏足够的符号化细节，需通过重复的视觉查询进行补偿；研究指向一种面向下一代编码 Agent 的实用文本与视觉混合设计。The results show that a strictly vision-only setup degrades accuracy and increases token cost, because agents lack sufficient symbolic detail and compensate with repeated visual queries, and point to a practical hybrid text-and-vision design for next-generation coding agents.

提出了用于复杂图像创建与编辑的大规模多模态工具调用数据集 CanvasCraft，以及通过多轮交互学习编排异构视觉工具的工具增强多模态 Agent CanvasAgent。CanvasCraft, a large-scale multimodal tool-use dataset for complex image creation and editing, and CanvasAgent, a tool-augmented multimodal agent that learns to orchestrate heterogeneous visual tools through multi-turn interaction are introduced.

结果表明，显式且可编辑的搜索工作流为将文献搜索智能体与复杂科学意图对齐提供了有效且可控的接口。The results show that explicit, editable search workflows provide an effective and controllable interface for aligning literature search agents with complex scientific intent.

提出 ATMA：在现有记忆系统之上的状态感知叠加层，保留被替换记录与过渡记录，为查询所需的"目标状态视图"构建证据包，并向问答模块暴露当前、历史与过渡三类标签。This work proposes ATMA, a state aware overlay for existing memory systems, which keeps superseded and transition records in the bank, builds evidence packets for the query's requested state view, and exposes current, historical, and transition labels to QA.

提出了一种 Agent 设计和一套经过验证、可复用的方法，用于研究显式记忆层如何影响长周期 LLM Agent 决策，并给出了一种替代的有界契约。An agent design and a validated, reusable methodology for studying how explicit memory layers shape long-horizon LLM-agent decisions, as well as an alternative bounded contract, are introduced.

提出 TRACE，一个针对演化会话数据在时序证据图上的查询处理框架，将词汇召回与证据重建分离，从而在长会话历史中实现有界的查询时推理。TRACE is presented, a query processing framework over temporal evidence graphs for evolving conversational data that separates lexical recall from evidence reconstruction, enabling bounded query-time reasoning over long conversational histories.

本文将 PSP 形式化为逆向规划问题，并提出 SPIRE，一个通过有意破坏干净幻灯片的视觉结构来近似求解 PSP 的原则性框架，从而构建一个可验证的去噪任务。This work formulates PSP as an inverse planning problem, and proposes SPIRE, a principled framework to solve PSP approximately, by intentionally corrupting the visual structures of clean slides, which creates a verifiable task to denoise the corruption.

本文提出 AI-Infra-Guard，一个围绕单一观测组织 AI 红队测试的开源框架，是目前唯一覆盖所有层面（包括对日益扩展 AI Agent 能力的 Agent Skills 供应链审计）的开源框架。AI-Infra-Guard is presented, an open-source framework that organizes AI red teaming around a single observation, and is the only open-source framework to span all of these, including supply-chain auditing of the agent skills that increasingly extend AI agents.

本文探索多轮视觉推理，观察到 MLLM 反复无法定位目标，导致冗长的推理轨迹，进而提出 PixelEyes，一种将推理与感知显式解耦的多轮视觉推理 Agent。This paper explores multi-turn visual reasoning and observes that MLLMs repeatedly fail to localize the target, leading to long, redundant trajectories, and proposes PixelEyes, a multi-turn visual reasoning agent that explicitly decouples reasoning from perception.

研究发现，模型规模、推理能力与 Agent 脚手架以不同方式影响弃答行为，能力更强或更大的模型有时反而在及时弃答上表现更差。It is found that model scale, reasoning, and agent scaffolding affect abstention in different ways, where larger or more capable models sometimes perform worse at timely abstention.

本文探讨了具身集体智能 (ECI) 这一未来多机器人范式，其中机器人团队将世界上下文、任务进度与技能经验作为共享资源进行累积与利用。This article explores Embodied Collective Intelligence (ECI), a future multi-robot paradigm in which a robot team accumulates and uses world context, task progress, and skill experience as shared resources.

本文提出一种基于 Agentic Large Language Model (LLM) 的主动容错控制 (FTC) 框架，可将故障检测输出转化为基于特定工厂知识的、符合约束的恢复动作。该方法结合：(i) 将操作员职责分解为监测、规划、动作合成、仿真、验证与重新提示的多 Agent 工作流；(ii) 数字过程工厂孪生 (DPPT)，提供工厂数据、模型以及用于执行前测试的仿真服务；(iii) 基于 CPSMod 本体构建的 Graph Retrieval-Augmented Generation (Graph RAG) 层。We propose an agentic Large Language Model (LLM) framework for active Fault-Tolerant Control (FTC) that transforms fault detection outputs into constraint-aware recovery actions grounded in plant-specific knowledge. The approach couples (i) a multi-agent workflow that decomposes operator duties into monitoring, planning, action synthesis, simulation, validation, and reprompting; (ii) a Digital Process Plant Twin (DPPT) that exposes plant data, models, and a simulation service for pre-execution testing; and (iii) a Graph Retrieval-Augmented Generation (Graph RAG) layer built on the CPSMod ontol

提出 Gradient-Based Connections（GBC）——一种面向多智能体系统的细粒度归因与优化方法，可提升多智能体性能，超越强力的单智能体与多智能体基线；且归因质量越高，优化效果越显著。Gradient-Based Connections (GBC) is proposed, an approach for fine-grained attribution and optimization of multi-agent systems that improves multi-agent performance and outperforms strong single-agent and multi-agent baselines and higher attribution quality is associated with greater optimization effectiveness.

PAVE 是一种逐步式标注协议，利用来自故障注入的已知干预来重建因果传播路径；逐步式的因果真值正是可信的基于 LLM 的 RCA Agent 所缺失的关键一环。PAVE, a step-wise labeling protocol that leverages known interventions from fault injection to reconstruct causal propagation paths, is introduced, a step-wise causal ground truth is the missing piece for trustworthy LLM-based RCA agents.

一项针对基于 LLM 的程序修复中执行行为的双阶段实证研究揭示了一些模式，表明当前 Agent 不加区分地使用执行，在获益甚微的实例上仍承担其开销；执行应被视为具有明确成本效益权衡的资源。A two-stage empirical study over execution behavior in LLM-based program repair reveals patterns suggest that current agents apply execution indiscriminately, paying its cost on instances where it provides little benefit, and execution should be treated as a resource with an explicit cost-benefit tradeoff.

路由、投票、级联、融合与 Mixture-of-Agents 等多模型 LLM 系统常被用于超越单模型精度；研究表明其增益受限于一个该领域鲜少报告的量化指标，且在缺乏强查询级路由信号时，组合模型很少能胜过单一最佳模型。Multi-model LLM systems such as routing, voting, cascades, fusion, and mixture-of-agents are used to beat single-model accuracy, it is shown that their gain is capped by a quantity the field rarely reports, and combining models rarely beats the single best model without a strong query-level routing signal.

本文认为，将上下文学习（ICL）扩展至终身设置是 AI Agent 持续学习的实用方案；要在固定硬件预算下用 Transformer 理解终身上下文，需要注意力的参数化形式。It is argued that extending in-context learning to lifelong settings is a practical solution for continual learning in AI agents and that parametric forms of attention are needed to understand a lifetime of context with transformers on a fixed hardware budget.

研究发现，强化学习（RL）与监督微调（SFT）交错训练可显著提升稳定性，但在格式与内容分布外（OOD）评测下性能下降；并展示了多样化监督信号如何引导探索式学习。It is found that interleaving supervised fine-tuning with RL substantially improves stability, but exhibits degraded performance under format and content out-of-distribution (OOD) evaluation, and how diverse supervisory signals can guide exploratory learning is demonstrated.

提出 SkillHone，一个基于持久决策历史实现 Agent Skill 持续进化的 harness；在内部工具辅助的分析场景中提升了准确率，并在未预先集成搜索栈的情况下优于商业支持的深度研究 Agent。SkillHone is introduced, a harness for continual agent skill evolution grounded in persistent decision history that improves accuracy on internal tool-mediated analysis scenarios and outperforms commercially backed deep-research agents without a pre-integrated search stack.

提出 conversational infill：让一个小型 talker 模型在外部 reasoner 模型产生结果前即时生成上下文相关的回复以掩盖延迟，并在推理过程中将 reasoner 流式输出的知识流畅地融合到回复中。Conversational infill is introduced, where a small talker model both immediately generates contextually grounded responses to hide the latency of an external reasoner model and fluently integrates streamed reasoner knowledge into its responses during inference.

对话式与工具使用的 LLM Agent 在上下文窗口中同时从多个方向被填充，而必须在多轮之间回忆信息的 Agent（即 memory 的典型场景）恰恰是 recency 截断失效的地方。Conversational and tool-using LLM agents operate over a context window that fills from several directions simultaneously, and agents that must recall information across many turns, the defining case for memory, are precisely where recency truncation fails.

提出 S-Agent，一种面向连续多视图图像与视频理解与推理的空间工具使用 Agent 范式，以无需训练的方式持续提升开源与闭源 VLM。This work introduces S-Agent, a spatial tool-use agentic paradigm for understanding and reasoning over continuous multi-view images and videos, and consistently improves both open-source and closed-source VLMs in a training-free manner.

揭示了指导的生成方式才是决定性变量，并提出 probe-and-refine tuning（探测-微调）：通过合成 bug 修复探测任务，利用单次 LLM 调用迭代诊断并修补仓库的指导文件，调优过程中不涉及 Agent 循环或工具调用。It is shown that how the guidance is produced is the decisive variable, and probe-and-refine tuning is introduced, a procedure that uses synthetic bug-fix probes to iteratively diagnose and patch a repository's guidance file through single-shot LLM calls, with no agent loop or tool use during tuning.