CTWM restores commute-time-faithful embeddings via a log-determinant regularizer, matching or beating LeWM on continuous goal-reaching benchmarks with half the parameters
The work shows that existing self-supervised methods, which commonly enforce isotropic representations to prevent collapse, tend to degrade the eigenvalue-dependent scaling required by the graph Laplacian spectral embedding and thus misrepresent commute times; it introduces Commute-Time-Preserving World Models (CTWMs), combining a latent displacement predictor with a log-determinant regularizer, which provably recover the correctly scaled Laplacian representation under reversible deterministic dynamics and at the predictor's fixed point, and in numerical simulations matches or outperforms LeWM, a task-agnostic baseline, on several complex continuous goal-reaching benchmarks while using half the parameters.