arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.04557cs.CL
收藏

基于显式潜在转移的文本规划

Textual Planning with Explicit Latent Transitions

technion(技术学院);ibm(国际商业机器公司)

Eliezer Shlomi, Ido Levy, Eilam Shapira, Michael Katz, Guy Uziel, Segev Shlomov, Nir Mashkif, Roi Reichart, Sarah Keren

AI总结:

本文提出EmbedPlan,通过冻结语言嵌入空间实现高效文本规划,展示在多个领域中插值性能良好,但跨领域泛化仍存在挑战。

摘要:

基于大语言模型的规划受到逐词生成和重复完整前向传递的限制,使得多步骤前瞻和基于展开的搜索在延迟和计算上都很昂贵。我们提出了EmbedPlan,它用一个轻量级的转移模型替代自回归的下一状态生成,该模型在冻结的语言嵌入空间中运行。EmbedPlan将自然语言状态和动作描述编码为向量,预测下一状态嵌入,并通过最近邻相似性检索下一状态,从而实现快速规划计算而无需微调编码器。我们使用六个逐渐增加难度的评估协议,在九个经典规划领域中评估下一状态预测:插值、计划变体、外推、多领域、跨领域和留一法。结果表明,插值性能接近完美,但当泛化需要转移到未见问题或未见领域时会出现明显退化;计划变体评估表明泛化到替代计划而不是记忆已见轨迹。总体而言,冻结嵌入在观察领域转移后支持领域内动态学习,而跨领域转移仍是一个瓶颈。

英文摘要:

Planning requires a transition model that predicts how each action changes the current state. When a large language model (LLM) plays this role, every next state is generated token by token, which makes searching over many possible futures slow and expensive. Existing alternatives either still query an LLM at every step or require a symbolic model of the domain. We propose EmbedPlan, a transition model built on frozen text embeddings: it embeds natural language descriptions of the state and the action with a frozen LLM, predicts the embedding of the next state with a lightweight learned network, and returns the closest real state. Because this network can be trained on top of any encoder, EmbedPlan also provides a controlled way to compare text representations for learning transitions. We evaluate it on 9 classical planning domains, under six settings that hold out progressively more of the data, from transitions to entire domains, and against baselines ranging from predicting no change to learning symbolic action rules. On planning problems seen during training, EmbedPlan almost always ranks the true next state among its top five guesses, still does so for most queries even when every observed state is a candidate, and retains 92-99% of its single-step accuracy when predicting several steps ahead from its own outputs. Given the same candidate states as GPT-5.4, it picks the true next state more often while taking about 0.17 ms per transition with cached embeddings. Accuracy is lower on unseen problems and near chance on unseen domains, and the controlled comparison traces this limit to the state representation rather than to the learned transition.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑