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

从Transformer表示中学习认知地图以实现部分观测环境中的高效规划

Learning Cognitive Maps from Transformer Representations for Efficient Planning in Partially Observed Environments

Google DeepMind(谷歌DeepMind)

Antoine Dedieu, Wolfgang Lehrach, Guangyao Zhou, Dileep George, Miguel Lázaro-Gredilla

AI总结:

本文提出带离散瓶颈的Transformer模型TDB,通过从部分观测环境的历史中学习压缩表示并提取认知地图,结合外部求解器实现比普通Transformer或LSTM更快的最短路径规划和更高的上下文准确率。

摘要:

尽管普通Transformer及其为下一token预测训练的变体在广泛任务上表现出色,包括仅在推理阶段才揭示的上下文任务,但它们(a)并未学习到可灵活查询的环境显式世界模型,(b)无法用于规划或导航。本文考虑部分观测环境(POEs),其中智能体在导航时接收到感知上存在混叠的观测,这使得路径规划变得困难。我们提出了一种具有(多个)离散瓶颈的Transformer,称为TDB,其潜在编码学习观测和动作历史的压缩表示。在训练TDB根据历史预测未来观测之后,我们从其活跃瓶颈索引中提取可解释的环境认知地图。随后将这些地图与外部求解器配对,以解决(带约束的)路径规划问题。首先,我们表明在POEs上训练的TDB(a)保持了普通Transformer或LSTM近乎完美的预测性能,同时(b)以指数级更快的速度解决最短路径问题。其次,TDB从文本数据集中提取可解释表示,同时达到比普通序列模型更高的上下文准确率。最后,在新的POEs中,TDB(a)达到近乎完美的上下文准确率,(b)学习准确的上下文认知地图,(c)解决上下文路径规划问题。

英文摘要:

Despite their stellar performance on a wide range of tasks, including in-context tasks only revealed during inference, vanilla transformers and variants trained for next-token predictions (a) do not learn an explicit world model of their environment which can be flexibly queried and (b) cannot be used for planning or navigation. In this paper, we consider partially observed environments (POEs), where an agent receives perceptually aliased observations as it navigates, which makes path planning hard. We introduce a transformer with (multiple) discrete bottleneck(s), TDB, whose latent codes learn a compressed representation of the history of observations and actions. After training a TDB to predict the future observation(s) given the history, we extract interpretable cognitive maps of the environment from its active bottleneck(s) indices. These maps are then paired with an external solver to solve (constrained) path planning problems. First, we show that a TDB trained on POEs (a) retains the near perfect predictive performance of a vanilla transformer or an LSTM while (b) solving shortest path problems exponentially faster. Second, a TDB extracts interpretable representations from text datasets, while reaching higher in-context accuracy than vanilla sequence models. Finally, in new POEs, a TDB (a) reaches near-perfect in-context accuracy, (b) learns accurate in-context cognitive maps (c) solves in-context path planning problems.

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

↑