(Upcoming) Constraint-Driven Diffusion Maps for Automatic Reduced-Space Learning
Conference Presentation, SIAM Computational Science and Engineering, 2027, Pittsburgh, PA, USA
The Diffusion Maps (DMaps) algorithm is a manifold discovery technique that provides latent space coordinates for reduced-order models (ROMs) via spectral decomposition of a local kernel graph Laplacian which approximates the continuous Laplace-Beltrami operator. However, this method suffers from challenges inherent to kernel methods and harmonic analysis. First, success depends heavily on tuning the kernel width parameter. Second, the algorithm frequently discovers duplicate higher-frequency modes before uncovering coordinates that span new dimensions, meaning Laplacian spectral properties do not reliably indicate the data's intrinsic dimensionality. These issues are further exacerbated in real-world datasets that are highly nonlinear, noisy, sparse, or have varying point densities.
