arXiv:2607.11493cs.LGcs.AI2026-07被引 1

用李代数结构优化智能体技能编辑,大幅提速自动调试。

Agentic Skill Optimization over Lie Algebroids

  • 将技能编辑建模为带锚的李代数结构,捕捉编辑间的依赖与顺序影响。
  • 在自然语言因果抽取任务中实现近15倍加速,比暴力验证快得多。
  • 适合研究智能体自我改进、自动化调试或复杂系统优化的开发者。

智能体通过修改提示、规则、计划、工具合约等技能实现自我提升。这些编辑并非向量空间中的独立坐标,而是对结构化产物的局部修复,其效果仅在执行、验证和批评后显现。不同编辑可能有相同的即时可见效果,但涉及路由上下文、模板状态、安全边界或未来可组合性差异,且编辑顺序也会影响结果。本文提出新框架LASKO(Lie Algebroid SKill Optimization),将带类型的锚定Markdown技能视为基范畴,将可用编辑策略视为具有锚映射 $ρ$ 的受控李代数丛的截面。锚映射将编辑策略映射到其可见的Markdown效果;核 $\ker(ρ)$ 表示潜在的模板、路由或实现结构;代数括号用于度量编辑组合的非交换性。初步基准结果显示,LASKO 在技能优化上实现数量级加速,主要因其在投入昂贵的LLM验证前,使用微秒级的李括号筛查测试进行快速筛选。在从自然语言中提取因果关系的任务中,相比直接运行6710亿参数的DeepSeek V3.1 4-bit模型验证所有编辑的暴力方法,LASKO 实现了接近15倍的加速。

原文摘要 · Abstract (English)

Agentic systems increasingly improve themselves by editing skills: prompts, rubrics, plans, tool contracts, examples, validators, and traces. Skill edits are not independent coordinates in a vector space: they are local repairs to structured artifacts whose effects are observed only after rollout, validation, and critique. Distinct edits can have the same immediate visible effect while differing in routing context, template state, guardrail scope, or future composability. The order of edits can matter as well: repairing a schema before a normalization rule need not be equivalent to applying the same edits in the reverse order. This paper introduces a new framework for skill optimization called LASKO, for Lie Algebroid SKill Optimization. LASKO models typed, anchored Markdown skills as the base category and available edit policies as sections of a controlled Lie algebroid with anchor $ρ$. The anchor maps an edit policy to its visible Markdown effect; the kernel $\ker(ρ)$ represents latent template, routing, or implementation structure; and the algebroid bracket measures noncommuting edit composition. As shown in the paper, LASKO achieves order-of-magnitude speedups in skill optimization in our preliminary benchmark results, primarily because it substitutes inexpensive Lie-bracket screening tests that run in microseconds, before investing in expensive validations that require running large language models. On a causal extraction from natural language task, LASKO achieved a speedup of almost $15 \times$ compared to a brute-force approach that validated all edits by running them through a DeepSeek V3.1 4-bit model with 671B parameters.

智能体技能优化李代数自动化调试

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。