用迷宫预测数据集测试Transformer的世界动态建模能力
AGI Maze Prediction Datasets: A Compact Benchmark for Learning World Dynamics with Transformers
- 构建可程序生成的迷宫环境,评估模型对动作后果的预测能力
- 带结构的工作内存模型在固定时域任务上达到完美验证准确率
- 适合研究语言与结构化状态结合的AI架构设计
世界建模需要一个能够维持并更新内部状态以推理行动后果的预测模型。我们提出AGI迷宫预测数据集与基准测试,这是一个轻量级可控实验平台,用于研究Transformer及其他预测模型在此类能力上的表现。该基准源自程序生成的有状态网格世界,包含逐步转移预测、固定时域状态预测以及序列文本观测预测。采用源迷宫不重叠的训练与验证划分,并结合贪婪精确匹配评估,以区分学习可迁移的动作条件动态与记忆熟悉布局中的转移。我们建立了从零开始的字节级Transformer基线,并与两种工作内存增强型架构进行比较。通用辅助隐状态Transformer虽能完美拟合部分训练集,但未显著提升泛化性能;而伪视频空间记忆Transformer则从输入地图初始化二维隐式工作区,仅通过动作历史更新,无需中间地图、位置或状态标签。在相同数据、目标和评估协议下,该模型在选定固定时域任务中实现完美验证准确率,而字节与无结构记忆基线未能做到,且大幅改善了序列文本追踪预测。结果表明,结构化、任务对齐的工作内存比单纯增加隐层容量更有效。更广泛地,我们认为语言理解依赖于持久数据结构及其上的计算;该基准为测试将文本接口与学习到的结构化状态相耦合的架构提供了紧凑场景。
原文摘要 · Abstract (English)
World modeling requires a predictive model to maintain and update an internal state adequate for reasoning about the consequences of actions. We introduce the AGI Maze Prediction Datasets and Benchmark, a lightweight controlled testbed for studying this capability in Transformers and other predictive models. Derived from procedurally generated, stateful grid worlds, the benchmark comprises per-step transition prediction, fixed-horizon state prediction, and sequential textual-observation prediction. Source-maze-disjoint training and validation splits, together with greedy exact-match evaluation, distinguish learning transferable action-conditioned dynamics from memorizing transitions in familiar layouts. We establish from-scratch byte-level Transformer baselines and compare them with two working-memory-augmented architectures. A generic auxiliary latent-memory Transformer can fit some training sets perfectly but does not consistently improve held-out performance. In contrast, a pseudo-video spatial-memory Transformer initializes a two-dimensional latent workspace from the input map and updates it from action history without receiving intermediate maps, positions, or state labels. Under the same data, objectives, and evaluation protocol, this model reaches perfect validation accuracy on selected fixed-horizon tasks where the byte and unstructured-memory baselines do not, and substantially improves sequential text-trace prediction. These results suggest that structured, task-aligned working memory can be more useful than additional latent capacity alone. More broadly, we argue that language grounding is mediated by persistent data structures and computations over them; the benchmark offers a compact setting for testing architectures that couple textual interfaces to learned structured state.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。