- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes Predictive Temporal Contrastive Representations (PTCR), introducing time-dependent rotations into a shared representation space to model temporal directionality. Maze and tree experiments examine the limitations of symmetric critics, followed by evaluation on five combinatorial planning tasks. The strongest gains appear on Rubik’s Cube and Sokoban.
Critical strengths
S1. The problem is clearly motivated through controlled experiments.
The paper distinguishes dataset directionality from critic symmetry. The maze experiment varies trajectory directionality, while the tree experiment examines increasing depth. These studies help explain when directional representations are useful.
S2. The multi-task evaluation provides positive empirical evidence.
PTCR is competitive across five tasks and improves over CRTR particularly on Rubik’s Cube and Sokoban. Figure 6 reports cumulative solution-length distributions, the main experiments use five seeds, and Appendix G examines different solution budgets.
S3. The method is compact.
PTCR retains a shared encoder and introduces time-dependent asymmetry through structured rotations. This design integrates directly into the existing contrastive learning framework.
Critical weaknesses
W1. The theoretical basis of the latent-prediction interpretation needs clarification.
Appendix C combines strictly bounded representations in Assumption 5 with a nondegenerate Gaussian marginal in Assumption 6. Assumption 7 also applies the transformation to the future state, unlike the objective in Section 5.2. These inconsistencies leave the connection between the proposed objective and the latent-prediction result unclear.
Please state the objective consistently and derive Theorem 8 and Corollary 9 under compatible assumptions, explaining how they apply to the proposed parameterization.
W2. A key comparison is missing to establish the contribution of conditioning on elapsed time.
The experiments compare symmetric critics, separate encoders, and full PTCR. They do not determine whether the gains require time-dependent transformations or can be obtained through a shared encoder with a single asymmetric transformation, as discussed in Section 5.2.
A matched comparison between training with a one-step transformation and training with time-dependent transformations is needed to establish the value of the central design.
W3. The reported 26% reduction in solution length requires a matched comparison.
The Rubik’s Cube means of 460 and 340 steps are computed over each method’s successfully solved instances. Even if CRTR’s solved set is contained in PTCR’s, the two means can reflect different instance difficulty.
Please report paired solution lengths on commonly solved instances, alongside overall success rates and uncertainty estimates for the length difference.
Questions for authors
Q1. Under which compatible assumptions do Theorem 8 and Corollary 9 hold, and how do these results apply to the proposed objective and parameterization?
Q2. How does training with a one-step transformation throughout compare with conditioning the transformation on elapsed time under otherwise identical settings?
Q3. What is the reduction in Rubik’s Cube solution length on instances solved by both methods, and what is the uncertainty of this paired difference?
2 comments
Thank you for clarifying the Rubik’s Cube results. With the 10,000-step budget, both methods solve every instance, so the reduction from 460 to 340 steps is measured on the same set of problems. Together with the standard errors reported across five seeds, this resolves W3 for me.
I also appreciate the new comparison for W2. Applying the same transformation once regardless of the time gap is a useful control, and the results on Sokoban and Digit Jumper support the authors’ interpretation that conditioning on elapsed time contributes to PTCR’s gains.
My remaining concern is W1. The revision clarifies the norm assumption and applies the transformation to the current state, as in the training objective. However, Assumption 7 still uses a positive distance in the exponent, while the objective uses a negative squared distance. As written, I still do not see how Theorem 8 yields the proposed latent-prediction interpretation for the objective used to train PTCR. This is the main reason I am keeping my original rating of weak rejection.
Dear Reviewer,
Thank you for your detailed feedback. We have already improved the paper thanks to it.
W1/Q1. Under which compatible assumptions do Theorem 8 and Corollary 9 hold, and how do these results apply to the proposed objective and parameterization?
Thank you for pointing out the errors in the Appendix C assumptions! We have corrected Assumptions 5 and 7.
Assumption 5: The bound should be imposed in expectation rather than pointwise, making it compatible with the nondegenerate Gaussian marginal in Assumption 6.
Assumption 7: The temporal transformation should be applied to the current-state representation, consistently with our proposed objective.
We agree that the theoretical assumptions are strong and do not claim that they hold exactly in the environments considered. Theorem 8 and Corollary 9 provide an idealized interpretation of the temporal transformation as latent prediction.
We additionally provide empirical support in Appendix D. In Colorful Maze, visualizing trajectory representations using PCA shows that applying the transformation to the current state representation moves it approximately in the direction of the next state.
Q2/W2. How does training with a one-step transformation throughout compare with conditioning the transformation on elapsed time under otherwise identical settings?
We conducted a preliminary controlled experiment comparing the proposed AΔ transformation with applying A independently of the temporal gap, keeping all other hyperparameters fixed. The results are:
In Sokoban, the Single A variant performs similarly to CRTR (0.08 vs. 0.09), while PTCR achieves substantially higher performance (0.24). This suggests that introducing asymmetry alone is insufficient to explain PTCR's improvement.
In Digit Jumper, the Single A variant eventually reaches CRTR's performance (0.91), but learns considerably more slowly, achieving 0.45 at the earlier checkpoint compared with 0.97 for PTCR. PTCR also retains an advantage at the later checkpoint (0.98 vs. 0.91).
Overall, the preliminary results suggest that conditioning the transformation on elapsed time might be providing benefits beyond introducing asymmetry alone, both in final performance and learning speed. These experiments are currently limited to two environments and one seed. We plan to extend the comparison to additional environments and seeds in the revised paper.
Q3/W3. What is the reduction in Rubik’s Cube solution length on instances solved by both methods, and what is the uncertainty of this paired difference?
While the lengths were actually measured on paired sets, we agree that the description we provided in the experimental section did not explicitly say that this was the case.
To be precise, if we increase the Rubik’s Cube budget to 10,000 from 1000, both CRTR and PTCR are able to solve all the problem instances. That is the setup, where we measured the average solution lengths. We updated the paper to be precise about this.
With that budget, the average solution length across 5 seeds of PTCR is 340 with standard error of around 16 and for CRTR is 460 with standard error of around 22.
The relative increase is 26.1% and its standard error is 5.2%.
We would be grateful for a confirmation of whether we have addressed the reviewer’s concerns.