MATH · IN · MODELS
methods / Representation Alignment / Functional-map spectral alignment

Functional-map spectral alignment

Techniqueadvanced

Builds a k-nearest-neighbor graph over shared samples in each of two independently-trained representation spaces, computes the graph Laplacian eigenbasis of each (a spectral analogue of PCA restricted to a similarity graph rather than raw coordinates), then fits a linear operator C between the two truncated spectral bases and decomposes cross-modal compatibility into two independent diagnostics: whether the eigenvalue spectra match (shared manifold complexity) and whether C is diagonal/orthogonal (shared eigenvector orientation).