- Rating
- 4(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper addresses two bottlenecks in multi-task RL with LTL specifications: (1) Plato uses a small predicate-specific network to map predicate parameters directly into the proposition/goal embedding. The authors argue that this induces a low-dimensional geometry over propositions and enables generalization across parameter values. (2) P2BRS constructs a potential function from manually supplied, coarse per-predicate robustness metrics. Those metrics are bounded and adaptively scaled; Boolean subgoals are composed with a persistence-gating mechanism, and the resulting potential is used with standard potential-based reward shaping.
The paper evaluates these ideas on four environments, including quadruped navigation, two-drone navigation, Franka manipulation, and a discrete navigation domain. It compares Plato against discretization, parameter concatenation, and SIAMS/FiLM, primarily using StructLTL, and additionally shows compatibility with LTL2Action.
Critical strengths
The paper has a clear motivation and a well-structured experimental story. The Franka manipulation results are particularly strong, showing that P2BRS can turn near-failing policies into reliable ones. The ablations are useful and support the importance of key design choices such as persistence gating. The paper is also transparent about its assumptions and provides strong implementation and reproducibility details.
Critical weaknesses
The comparison does not fully isolate the benefit of the Plato embedding design. Plato injects predicate parameters directly into the goal embedding, while Concatenate and SIAMS place the parameters on the state/observation side, and Discretize uses independent lookup embeddings. A simple goal-side baseline—for example, concatenating a learned predicate embedding with its parameters and passing them through a shared MLP—would help determine whether Plato's gains come from its predicate-specific embedding structure or simply from conditioning the goal representation on the parameters. Without this comparison, the source of the representation improvement is not fully clear.
Questions for authors
Have you tested P2BRS together with the other representation baselines, especially Discretize, Concatenate, or SIAMS in FrankaCubesEnv? This would help determine how much of the improvement comes from the Plato representation versus the reward-shaping method.
3 comments
Thank you for your response, i have no more concern.
raise my score to 4.
Rebuttal Response Reply
We thank the reviewer for their engagement and for raising their score. We are glad our additional experiments addressed their concerns. Their suggestions clarified the respective contributions of the Plato embedding and P$^2$BRS, and we believe they have strengthened the paper.
Rebuttal
We thank the reviewer for their review, and are glad that they found "a clear motivation and a well-structured experimental story", that "the Franka manipulation results are particularly strong", and that the paper is "transparent about its assumptions".
Both of the reviewer's suggestions concern disentangling the contributions of the two components of PlatoLTL. In response, we have run both suggested experiments in FrankaCubesEnv:
We have revised the uploaded manuscript PDF accordingly, and address each point in turn below.
W1: Isolating the benefit of the Plato embedding design
We have added the suggested goal-side baseline, "Shared MLP", which embeds each predicate instance f(xf) as ϕ([ef;xf]), using a learned predicate embedding ef and a single MLP ϕ shared by all predicates. As we note in Appendix N.5, this is equivalent to the Plato embedding module with every weight tied across predicates except a predicate-specific first-layer bias.
With P$^2$BRS, Shared MLP matches Plato (84.4% against 84.3% average success on finite tasks, and 20.9 against 21.4 visits on infinite tasks; Tables 4 and 5), with neither consistently ahead per specification, although Shared MLP trails by up to 13 points mid-training before catching up (Figure 7); without P$^2$BRS, both fail. In FrankaCubesEnv, Plato's gains over the baselines therefore come from conditioning the proposition embeddings on the parameters, i.e., from injecting the parameters into the goal embedding, rather than from having separate networks per predicate. We view this as supporting the central claim of Section 5, with per-predicate MLPs as one simple instantiation of it.
Q1: P$^2$BRS with the other representation baselines
We have trained Discretize, Concatenate, and SIAMS with P$^2$BRS. P$^2$BRS lifts their average success rates from 0.0% to 1.9%, 12.9%, and 14.9%, respectively, against 84.3% for Plato with P$^2$BRS (Table 4). Their successes are concentrated on the two tasks that require carrying a cube to a target position (φ26, φ29), where Concatenate and SIAMS reach 66.4% and 63.1% on φ29, respectively, but with episodes 2-4 times as long as Plato's. On tasks involving orientation targets or placing a cube, no baseline exceeds 14%; none succeeds on the 9-step sequence φ25 (97.1% for Plato), and none improves on infinite-horizon tasks (Table 5). Thus, P$^2$BRS supplies an exploration signal to every representation, but only goal-side parameter conditioning can harness it to achieve high success rates. Neither component suffices alone: Plato without P$^2$BRS averages 2.9%, the baselines with P$^2$BRS at most 14.9%, and the combination 84.3%.
We thank the reviewer again for these suggestions, which we believe have clarified the respective contributions of both components, and hope that they strengthen the reviewer's confidence in the paper.