让大模型团队协作研究更可靠,解决长时间运行中的失效问题。
PRIMA: Operational Patterns for Resilient Multi-Agent Research with Verifiable Identity and Convergent Feedback
- 设计三层抗脆弱机制,自动恢复中断任务并防止子智能体跑偏。
- 通过结构化提示层约束任务执行,确保工具使用与上下文一致。
- 适合长期复杂科研项目,尤其需要可验证身份和稳定输出的场景。
将大语言模型作为协同多智能体系统进行数小时级科研作业时,单次评估无法发现诸多失败模式:上游服务无预警限流、子智能体偏离任务、用描述代替操作、自我道歉引发无限修订、把上下文当指令执行。本文提出PRIMA,包含三项核心操作模式:(1) 弹性恢复层,检测上游限流信号,持久化暂停记录,重启后不重做已收敛工作;(2) 子智能体操作规范,以结构化提示封装任务忠实度、工具使用、修订逻辑与步骤边界;(3) 多阶段应用模式,分步草稿与显式跨文档协调后再合成成果。其基础协议包括:带明确收敛标准的研究程序语言、双指标评分引擎(LLM打分+沙箱代码)、外层元优化循环、事件驱动持久化、钩子式中间件、上下文压缩及多提供者抽象。智能体身份基于素数幂生成,无需中心注册即可实现无冲突标识与可验证集群归属。理论保证包括$O(k)$验证开销、$O(V+E)$ DAG验证,以及由算术基本定理保障的身份唯一性。图同构案例验证架构有效性:生成六步协议,产出一篇论文,提出新标准形式算法,含三定理五猜想。
原文摘要 · Abstract (English)
Operating LLMs as coordinated multi-agent research systems over multi-hour runs surfaces failure modes that single-shot evaluation cannot: upstream providers throttle without warning, sub-agents drift the task to fit accessible tools, narrate machinery instead of using it, open revision iterations with self-apology, or treat upstream context as executable directives. We present PRIMA, whose primary contributions are three operational patterns for surviving these failure modes: (1) a resilience-and-recovery layer that detects upstream rate-limit signals, persists a typed pause record to disk, and resumes long-running runs without re-executing converged work even across process restarts; (2) a sub-agent operating discipline encoding task-fidelity, tool-use, revision, and inter-step context-boundary norms as a structural prompt layer; (3) a multi-phase application pattern for structured engineering deliverables pairing orthogonal draft steps with an explicit cross-document harmonization pass before final synthesis. These sit atop a foundational protocol: a research-program specification language with explicit convergence criteria, a dual-metric scoring engine (LLM-judged rubric plus sandboxed code), an outer meta-optimization loop, event-driven persistence, hook-based middleware, context compaction, and a multi-provider LLM abstraction. Agent identities derive from prime powers, giving collision-free identifiers and trivially-verifiable cluster membership without a central registry. Theoretical guarantees include $O(k)$ verification, $O(V+E)$ DAG validation, and identity collision freedom by the Fundamental Theorem of Arithmetic. A Graph Isomorphism case study grounds the architectural claims in a generated artifact: a six-step protocol that produced a research paper proposing a new canonical-form algorithm with three theorems and five conjectures.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。