“…Options on how to mitigate the computational cost are using approximate Jacobian determinants [8], identifying the Riemannian metric [22,23], or learning embeddings of Riemannian manifolds directly [17]. In our previous work [10], we highlighted that the Jacobian determinant of the embedding is always equal to one if the encoding is performed via PCA, i.e., the PDF in Equation ( 4) is invariant to a PCA encoding. In the following, we extend this finding to isometric embeddings, in general.…”