- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
In this paper, the authors introduce the strategy of compressing diffusion latents into a low-dimensional space using contrastive learning methods. They demonstrate that under the equivalence class of permutations and componentwise invertible scalar transformations, structural causal models are preserved, and show the possibility that their approach can recover that transition model. They validate their approach across three datasets, comparing the quality of recovery of their latent states and of the true environmental dynamics. They compare to several recent conditional representation learning methods, showing that their approach is comparable to and outperforms many of those methods.
Critical strengths
The main strength of this paper is the set of experimental results. It seems as if their approach is effective at learning a consistent set of latents, especially when using TCL/GCL.
Critical weaknesses
I have one major concern and one main weakness. The primary concern is with respect to section 3, where a portion of the work (in particular theorem 1 and lemma 1) are presented as work from the authors without proper attribution in the main text. Some of the proper attribution is done in the appendix for theorem 1, but should be done in the main text as well. Lemma 1 is also remarkably similar to prior results (e.g. noise-contrastive estimation Gutman & Hyv"arinen 2010, contrastive predictive coding van den Oord et al. 2019), without reference to those results in the lemma.
The weakness is with respect to the results. It is not clear what these results add to our understanding of diffusion models or contrastive learning, or what the benefits of this approach are over just running GCL/TCL/CEBRA on the data, rather than diffusion latents. These experiments should be done to demonstrate some kind of benefit of this approach over existing methods.
Questions for authors
For the diffusion latents, what diffusion timestep is used as input for contrastive learning? Does the timestep used impact the results?
Response to Reviewer jqwb
We thank the reviewer for raising the attribution issue and asking for a direct pixel comparison. We should have credited the nonlinear ICA and density-ratio results more explicitly where we stated them. We have now corrected this in Section 3. We also ran the comparison you requested. On Physical Fall, direct pixel TCL and diffusion-latent TCL recovered the state equally well. The new Figure 6 shows why one might still want to learn coordinates in a pretrained generator. We can change a robot’s command, predict its motion in the learned coordinates, render that prediction, and compare it with what the robot actually does in the simulator.
W1. Attribution of Theorem 1 and Lemma 1
Revised Theorem 1 now credits Hyvärinen et al. (2019, Theorem 3) for identification of sufficient statistics up to invertible affine mixing and cites the related TCL and iVAE results. Revised Theorem 2 credits Hyvärinen et al. (2019, Theorem 1) for the stronger coordinatewise result and states the assumptions needed to apply it to a frozen representation. Lemma 1 now cites Gutmann and Hyvärinen for the density-ratio argument and van den Oord et al. for its use in contrastive predictive coding.
Our theoretical contribution concerns what follows for the dynamics. A linear mixing can preserve enough information to reconstruct the physical state while changing which variables appear to influence one another. Under coordinatewise identification, the lagged parent sets are preserved. New Proposition 1 addresses the practical question of how to detect those dependencies in a fitted transition model. With state-independent additive noise in the physical coordinates and the stated regularity conditions, the forward conditional-mean Jacobian preserves the zero pattern of the physical transition Jacobian. Under derivative faithfulness, that pattern identifies the lagged graph.
W2. What does diffusion add over direct TCL?
We trained the new direct TCL baseline on the original Physical Fall videos. Both rows use the same evaluation. Values are means ± SD across five seeds.
On Physical Fall, the 4,096-dimensional diffusion representation retained enough state information to match TCL trained directly on 256×256 RGB frames. The exact graph scores in both rows use supervised state alignment and known parent counts.
The reason to learn coordinates in a pretrained generator is that it already knows how to render the system to realistic video. ConDA keeps that capability and learns a small map into coordinates where we can model the dynamics. We can then ask what a change in command would do, predict its effect in those coordinates, and render the motion that follows, all without retraining the diffusion generator.
The new Figure 6 in Appendix A.12.1 shows this in Microduck. Starting from the same robot state, we change the forwrd velocity command from zero to -0.25 m/s and render the next second of predicted motion. We show it alongside MuJoCo rollouts under both commands, so the predicted change can be compared with the change the command actually caused. We also measured the velocity response separately over 100 matched rollouts. At one second, the learned dynamics predicted the correct direction and about a third of the magnitude of the backward response (-0.0042 versus -0.0129 m/s in MuJoCo).
Q1. Diffusion timestep and sensitivity
We use the final latent returned by the eight-step Rex-RK4 inversion. On Physical Fall, we varied the number of integration steps from 2 to 20. Eight steps gave the highest mean reconstruction PSNR, though two steps gave a similar result (39.68 versus 39.55 dB). This sweep tested reconstruction sensitivity to the solver step count. We did not compare latents extracted at different diffusion times, so their effect on state and graph recovery remains open.