Mechanism works
2026
Conjugacy-Regularized Latent Dynamics
Replace orthogonal Procrustes alignment between two latent dynamical systems with a learned bijection h that makes their transitions commute: h(f(z)) approximately equals g(h(z)). Parameterize h as an invertible affine map or coupling flow, allowing the correspondence to be non-orthogonal while retaining an exact inverse. The same constraint can be applied over multiple rollout steps, encouraging two models to represent the same computation even when their latent coordinates differ…
Paper: Beyond DSA: Conjugacy-based Comparison of Dynamical Systems
arXiv:2607.04493