arXiv:2506.20911cs.CV2025-06被引 1

用智能子程序复用提升多轮图像编辑效率

FaSTA$^*$: Fast-Slow Toolpath Agent with Subroutine Mining for Efficient Multi-turn Image Editing

  • 结合大模型快速规划与局部A*搜索精准执行
  • 通过归纳已有成功路径提取可复用子程序
  • 适合需要高效多步编辑的交互式图像应用

我们开发了一种低成本神经符号代理,用于解决复杂的多轮图像编辑任务,例如“检测图像中的长椅并将其染成粉色,同时移除猫以获得更清晰视角,并将墙壁染成黄色”。该方法结合大型语言模型(LLMs)的快速高层子任务规划与每个子任务的慢速、精确、工具调用及局部A$^*$搜索,以找到成本高效的工具路径——即一系列对AI工具的调用序列。为降低在相似子任务上重复运行A$^*$的成本,我们利用大模型对过往成功工具路径进行归纳推理,持续提取和优化常用子程序,并将其作为新工具在后续任务中复用,实现自适应的快慢协同规划:先尝试高层子程序,仅在失败时才激活低层A$^*$搜索。这种可复用的符号化子程序显著降低了相同类型子任务在相似图像上的探索成本,形成了类人般的快慢工具路径代理“FaSTA$^*$”:由大模型首先进行快速任务规划与基于规则的子程序选择,预期覆盖大部分任务;仅当遇到新颖或复杂子任务时,才触发慢速的A$^*$搜索。与近期图像编辑方法相比,我们证明了FaSTA$^*$在计算效率上显著更优,同时在成功率上仍保持与当前最先进基线相当的水平。代码与数据可在https://github.com/tianyi-lab/FaSTAR获取。

原文摘要 · Abstract (English)

We develop a cost-efficient neurosymbolic agent to address challenging multi-turn image editing tasks such as ``Detect the bench in the image while recoloring it to pink. Also, remove the cat for a clearer view and recolor the wall to yellow.'' It combines the fast, high-level subtask planning by large language models (LLMs) with the slow, accurate, tool-use, and local A$^*$ search per subtask to find a cost-efficient toolpath -- a sequence of calls to AI tools. To save the cost of A$^*$ on similar subtasks, we perform inductive reasoning on previously successful toolpaths via LLMs to continuously extract/refine frequently used subroutines and reuse them as new tools for future tasks in an adaptive fast-slow planning, where the higher-level subroutines are explored first, and only when they fail, the low-level A$^*$ search is activated. The reusable symbolic subroutines considerably save exploration cost on the same types of subtasks applied to similar images, yielding a human-like fast-slow toolpath agent ``FaSTA$^*$'': fast subtask planning followed by rule-based subroutine selection per subtask is attempted by LLMs at first, which is expected to cover most tasks, while slow A$^*$ search is only triggered for novel and challenging subtasks. By comparing with recent image editing approaches, we demonstrate FaSTA$^*$ is significantly more computationally efficient while remaining competitive with the state-of-the-art baseline in terms of success rate. Our code and data can be accessed at https://github.com/tianyi-lab/FaSTAR.

图像编辑工具路径子程序复用多轮交互

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