跳到正文
Jones Ray

ScholarPulse 日报 2026-10-24

2026-10-24 学术简报:2 篇。论文提出自适应技能粒度框架,通过运行时路由与“宏观到微观”失败恢复,解决了代码智能体固定技能粒度的脆弱性问题。

今日速览

序号标题来源日期主题推荐等级
1Adaptive Skill Granularity for Coding Agents: Runtime Routing and Macro-to-Micro RecoveryarXiv2026-10-22AI-Agent高
2Certified Execution Harness for Agentic AI: Safe and Least-Intrusive Petri-Net Supervisory Control Between Reasoning and ActionarXiv2026-10-22AI-Agent高

重点论文与技术动态

1. Adaptive Skill Granularity for Coding Agents: Runtime Routing and Macro-to-Micro Recovery

一句话结论

论文提出自适应技能粒度框架,通过运行时路由与“宏观到微观”失败恢复,解决了代码智能体固定技能粒度的脆弱性问题。

核心内容

方法与数据

价值判断

摘要 Reusable skills allow large language model agents to package task-specific procedures, tool affordances, and execution guidance into modular units. Prior work has largely studied how agents retrieve, compose, or synthesize skills before execution. In coding agents, however, execution poses an additional runtime control problem: the same task may be solved through primitive tool calls, macro skills, or hybrid execution that starts with a macro and falls back to micro-level recovery. We introduce Adaptive Skill Granularity, a framework that treats skill granularity as an action-abstraction policy conditioned on task structure, execution state, and macro-skill failures. The system combines a feature-based granularity controller and a finite-state recovery executor. We evaluate the framework with a deterministic coding-agent protocol using verifier-defined success, total cost, and process metrics such as macro adoption, failure recovery, route match, and transition correctness. Results show that fixed macro execution is efficient when applicable but brittle under mismatch, while runtime routing and explicit macro-to-micro recovery improve robustness and recover controlled macro failures that fixed-granularity execution leaves unresolved. Our findings suggest that skill libraries for coding agents should be treated not only as retrievable resources, but also as controllable, verifiable, and recoverable execution abstractions.

2. Certified Execution Harness for Agentic AI: Safe and Least-Intrusive Petri-Net Supervisory Control Between Reasoning and Action

一句话结论

本文提出基于 Petri 网监督控制的智能体执行框架,在提示注入攻击下提供形式化安全保证,并优化了带重试成本的闭环重规划侵入性。

核心内容

方法与数据

价值判断

摘要 This paper studies the problem of safe tool execution for large language model (LLM) agents under prompt injection. Using Petri nets, we formalize the execution harness between the LLM and its tools as a supervisory control problem, in which marks represent capabilities, approvals and budgets. Since a transition fires only if the marks it needs are present, an injected request whose preconditions are unmet or already spent is refused regardless of its wording. Treating tool outcomes as uncontrollable, we enforce safety by the conventional maximally permissive supervisor, and this safety transfers to the running system under four assumptions. Moreover, to capture an agent that may propose again after a refusal, we introduce the notion of a replanning closed loop, in which each retry costs an inference call. We show that, in this loop, the conventional supervisor can be arbitrarily more intrusive than a stricter safe one. Furthermore, for a given proposer model, the maximally permissive least-intrusive supervisor is characterized as a value-threshold refinement of the conventional one. Under precise conditions, this refinement orders two concurrent actions by at most one monitor place. On an autonomous release agent, we find by synthesis that safe deployment requires a step that the supervisor can refuse after a rollout starts.