让AI主动推进目标,无需等待用户指令。
Context: Proactive Goal-Directed Intelligence via Composable Sandboxed Programs, Declarative Wiring, and Structured Interaction
- 用可组合的沙盒程序和声明式连接实现智能代理
- 每轮对话可复用99%以上缓存,降低计算成本
- 适合需要持续协作的复杂任务场景
我们提出Context,作为Magarshak架构中的智能层,将被动响应的聊天机器人转变为能主动推进共同任务的智能体,无需等待用户提示。该架构基于三个相互增强的机制:写入时上下文组装通过Groker代理预计算带类型的丰富属性,将交互上下文构造成图状态的确定性纯函数;上下文块在语义变化间保持字节级一致,支持近100%的键值缓存重用。可组合的沙盒智慧程序构成受控的LM生成指令库,通过类型化流关系声明式连接到目标类型,按阶段顺序组合,在交互时执行而无需额外大模型调用。主动目标流状态机通过检查图状态,主动输出结构化交互内容(选项数组、治理功能、澄清提示),无需等待用户输入。我们证明了六项形式化结果:上下文稳定性定理,将每轮大模型成本限制为语义变化率的函数;程序组合正确性定理;声明式连接保真定理;主动主导性定理,证明主动智能体在预期完成轮数上弱优于被动智能体;协调开销消除与质量保持,建立多参与方目标对话的帕累托改进;跨平台投票一致性定理。系统已开源于Qbix/Safebox/Safebots套件。
原文摘要 · Abstract (English)
We present Context, the intelligence layer of the Magarshak Architecture, which replaces reactive query-response chatbots with proactive goal-directed agents that advance shared tasks without waiting for user prompts. The architecture rests on three mutually reinforcing mechanisms. Write-time context assembly precomputes enriched typed attributes via Groker agents, assembling interaction context as a deterministic pure function of graph state; context blocks are byte-identical across turns between semantic changes, enabling near-100% KV-cache reuse. Composable sandboxed wisdom programs form a governed library of LM-generated imperative programs declaratively wired to goal types via typed stream relations, composed via phase ordering, and executed at interaction time without further LM calls. Proactive goal stream state machines drive conversations toward terminal states by inspecting graph state and emitting structured interaction content (option arrays, governance affordances, clarification prompts) without awaiting user input. We prove six formal results: the Context Stability Theorem, bounding per-turn LM cost as a function of semantic change rate; a Program Composition Correctness Theorem; a Declarative Wiring Soundness Theorem; the Proactive Dominance Theorem, proving proactive agents weakly dominate reactive agents on expected turns-to-terminal-state; Coordination Overhead Elimination and Quality Preservation, establishing Pareto improvements in multi-participant goal chats; and a Cross-Platform Vote Consistency Theorem. Implemented in the open-source Qbix / Safebox / Safebots stack.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。