- Rating
- 2
- Confidence
- 4(+1)
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes two Transformer architectures for learning lifted STRIPS world models from symbolic action traces under action-applicability or final-state supervision. The author perform experiments on five planning domains to evaluate generalization to longer planning action sequences and larger object sets, as well as planning with the extracted symbolic models.
Critical strengths
- The problem is well defined. The author's problem formulation is clear, the presentation for architectures and supervision settings are well-designed.
- The experiments provides detailed insight by evaluating the models' generalization along two dimensions: action-sequence length and the number of objects.
- The extracted symbolic models enable inspection of learned preconditions and effects, and their evaluation with an off-the-shelf planner provides evidence beyond predictive accuracy.
Critical weaknesses
-
Insufficient motivation. The paper explores whether Transformers can learn reusable symbolic world models, but does not clearly establish what this adds to existing symbolic induction methods or which limitations it addresses. Moreover, potential advantages of Transformers, such as learning stochastic transition or modelling multimodal inputs, remain unexplored. Thus, it is hard for me to understand the motivation and positioning of the paper.
-
Limited justification of the incremental contribution. Prior work has already demonstrated that Transformers can learn transition dynamics and recover propositional STRIPS models, as acknowledged in the related work section. This paper extends the setting to lifted models, but it does not sufficiently explain what new insights or advantages this extension provides. In particular, LS is designed to share the same learned rules across different object sets, so its object-count generalization may largely reflect this pre-designed structure rather than provide a new insight into the learned Transformer generalization.
-
No demonstrated advantage over symbolic induction methods. The experiments compare only against other Transformer architectures, without evaluating existing symbolic action-model learning methods under matched supervision. Consequently, it is hard for me to identify the relative advantages of the proposed approach.
-
Unverified applicability to context-dependent dynamics. The experiments demonstrate generalization to longer traces and larger object sets within fixed STRIPS domains, but do not verify richer context-dependent action requirements. For example,
stack(a,b)may requirebto be clear whenbis small, whereas a largerbmay be able to support multiple objects without requiringbto be clear. Whether the proposed supervision and extraction procedure can capture such dependencies remains unverified, limiting the demonstrated generalization to clean symbolic data under the tested rule systems.
Questions for authors
-
Can the authors clarify the motivation and incremental contribution discussed in Weaknesses 1 and 2? What new insights and advantages does the lifted setting provides beyond prior work and the structure built into the new architecture?
-
Can the authors compare against existing symbolic action-model induction methods? What are the relative advantages of using the proposed transformer?
-
Can the authors evaluate mixed traces governed by multiple context-dependent rules, with the relevant context provided as input, to test whether the models and extraction procedure recover the appropriate conditions rather than collapse them into a single rule? For example, the preconditions should be dependent on the object size and thus result in different planned traces.
6 comments
Answer to Questions (2/3)
Q2. Can the authors compare against existing symbolic action-model induction methods? What are the relative advantages of using the proposed transformer?
To the best of our knowledge, there exists no Deep Learning-based approach for learning symbolic action models which does not require state transitions, as we do in our applicability setting (where each trace contains its initial state but not its final state).
The only method applicable to this setting is SIFT [2], which is symbolic in nature. However, SIFT lacks model alignment, i.e., the extracted STRIPS model is encoded using different predicates P’ to the set of predicates P of the ground-truth domain. This means we cannot directly use the model learned by SIFT to perform planning, since problems are encoded in terms of ground-truth predicates P instead of learned predicates P’. To perform planning, we would first need to manually translate each problem to the encoding learned by SIFT, after interpreting the meaning of its learned predicates P’. In contrast, the models extracted from our transformers are aligned and can be directly used for planning (see paragraph Direct extraction via symbolic alignment in Section 6, and extracted models in Appendix G).
Another advantage of our approach compared to SIFT is that SIFT runs in time that is exponential in the number of action patterns, which are linear in the number of action names and exponential in the arity of the actions. This computational bottleneck does not arise in our approach where gradient descent is doing all the work (our LS Transformer scales quadratically in the number of action patterns, and the LB Transformer does not depend on it).
Still, we want to emphasize that our goal is not to compete with SIFT, but to study whether transformers can learn symbolic world models that generalize to different and larger sets of objects.
Answer to Questions (3/3)
Q3. Can the authors evaluate mixed traces governed by multiple context-dependent rules, with the relevant context provided as input, to test whether the models and extraction procedure recover the appropriate conditions rather than collapse them into a single rule? For example, the preconditions should be dependent on the object size and thus result in different planned traces.
Our current scope (lifted STRIPS models) is capable of encoding the multiple context-dependent rules you mention, e.g., your size-dependent example “stack(a,b) may require b to be clear when b is small, whereas a larger b may be able to support multiple objects without requiring b to be clear.”
Below, we provide a lifted STRIPS model that adapts Blocksworld to your example, where large blocks can have two blocks on top, and small blocks only one. As it is lifted STRIPS, both our LS and LB Transformers are capable of learning such a model:
(define (domain blocksworld-size-dependent)
(:requirements :strips)
(:constants zero one two)
(:predicates
(on ?x ?y)
(ontable ?x)
(holding ?x)
(handempty)
(occupancy ?x ?n) ;; number of blocks currently on top of ?x (replaces *clear* predicate)
(next ?n ?m)
(capacity ?x ?n) ;; number of blocks ?x can *eventually* have on top
)
(:action pick-up
:parameters (?x)
:precondition (and
(ontable ?x)
(occupancy ?x zero)
(handempty)
)
:effect (and
(holding ?x)
(not (ontable ?x))
(not (occupancy ?x zero))
(not (handempty))
)
)
(:action put-down
:parameters (?x)
:precondition (holding ?x)
:effect (and
(ontable ?x)
(occupancy ?x zero)
(handempty)
(not (holding ?x))
)
)
(:action stack
:parameters (?x ?y ?before ?after)
:precondition (and
(holding ?x)
(occupancy ?y ?before)
(next ?before ?after)
(capacity ?y ?after)
)
:effect (and
(on ?x ?y)
(occupancy ?x zero)
(handempty)
(not (holding ?x))
(not (occupancy ?y ?before))
(occupancy ?y ?after)
)
)
(:action unstack
:parameters (?x ?y ?before ?after)
:precondition (and
(on ?x ?y)
(occupancy ?x zero)
(occupancy ?y ?after)
(next ?before ?after)
(handempty)
)
:effect (and
(holding ?x)
(not (on ?x ?y))
(not (occupancy ?x zero))
(not (handempty))
(not (occupancy ?y ?after))
(occupancy ?y ?before)
)
)
)
References
[1] Núñez-Molina, C., Gómez, V., & Geffner, H. (2026). From Next Token Prediction to (STRIPS) World Models. In Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning.
[2] Gösgens, J., Jansen, N., & Geffner, H. (2025, September). Learning lifted strips models from action traces alone: A simple, general, and scalable solution. In Proceedings of the International Conference on Automated Planning and Scheduling.
[3] Sarrof, Y., Du, Y., Stein, K., Koller, A., Thiébaux, S., & Hahn, M. (2026). On the Ability of Transformers to Verify Plans. arXiv preprint arXiv:2603.19954.
[4] Battaglia, P., Pascanu, R., Lai, M., & Jimenez Rezende, D. (2016). Interaction networks for learning about objects, relations and physics. Advances in neural information processing systems.
[5] Chang, M. B., Ullman, T., Torralba, A., & Tenenbaum, J. B. (2016). A compositional object-based approach to learning physical dynamics. arXiv preprint arXiv:1612.00341.
Answer to Questions (1/3)
Thank you for your feedback. We answer each specific question (Q) below.
Q1. Can the authors clarify the motivation and incremental contribution discussed in Weaknesses 1 and 2? What new insights and advantages does the lifted setting provides beyond prior work and the structure built into the new architecture?
We agree that LS is designed to share rules across object sets. This is an intentional inductive bias, much as convolutional architectures exploit spatial symmetries. But this does not make successful learning or generalization automatic. The architecture defines a hypothesis class of lifted models, including many incorrect ones. Representing the correct model does not guarantee that it can be identified from limited supervision or recovered through gradient descent. We also believe that making these relational inductive biases explicit provides a useful reference for future work into whether and how less structured Transformers learn similar computations without such biases. We will briefly discuss this broader motivation in the revised paper.
Our second proposed LB architecture investigates precisely whether transformers can learn object-independent relational dynamics without explicitly encoding STRIPS rules or variable binding. Here we propose randomized object embeddings, to encourage such computations to emerge through learning and study whether similar generalization can be achieved with weaker symbolic inductive biases.
Thus, our main motivation is to investigate whether transformers can learn lifted world models that generalize to longer traces and larger object sets, a topic of great interest for the Deep Learning community [4,5], and to understand the inductive biases that enable this generalization. This is related to [3], where authors study transformer capabilities to verify plans, whereas we study transformer capabilities to learn lifted world models instead.
We now clarify our contribution, when compared to prior work on learning propositional STRIPS models [1]. In the propositional setting of [1], tokens represent ground actions from a fixed vocabulary shared between training and testing. In our lifted setting, action schemas remain fixed, but test instances contain new objects and previously unseen ground actions, with potentially many more objects that during training.
The main technical challenge is thus variable binding: the transformer must identify when preconditions and effects of different ground actions refer to the same atom. For example, if move(x,y,z) requires at(x,y) and adds at(x,z), the effect of move(a,b,c) makes true the precondition of move(a,c,d), despite involving different argument positions.
Addressing this challenge requires substantial modifications. First, the B-RASP construction (Appendix B) is considerably more complex than for the propositional case, as it needs to consider patterns when matching action preconditions and effects (see Eqs. 6-11). Second, the lifted STRIPS (LS) Transformer (see Section 5.1, Appendix C) learns lifted rules (using patterns) which are grounded on the particular objects in the traces. Doing so requires encoding objects with one-hot vectors (Eq. 16) which are permutted according to patterns (Eqs. 25-33) when computing attention. Both operations allow learned parameters to be independent of object identities and number of objects, and are absent in the propositional STRIPS Transformer. Third, the lifted Stick-Breaking (LB) Transformer leverages randomized object embeddings, consistent within each trace but resampled across presentations, to encourage object-independent reasoning without explicitly encoding symbolic rules, which is also missing in the propositional SB Transformer.
We agree that the contribution and technical challenges introduced by the lifted case were not sufficiently emphasized. We will revise Sections 4--6 to clarify this.