๐ค AI Summary
This study addresses the embedding instability and run-to-run inconsistency in UMAP caused by random negative sampling. We propose a synchronous optimization framework based on coherent fields, which replaces stochastic sampling with a shared snapshot to uniformly evaluate attractive and repulsive forces. The method introduces a degree-weighted repulsion field and third-order moment representations, combined with interpolated FFT for efficient computation, thereby avoiding explicit all-pairs operations while enabling synchronous updates. Evaluated on million-scale datasets, our approach achieves up to 5.79ร CPU acceleration, substantially improves runtime stability, and effectively optimizes the trade-off between local and global structural fidelity.
๐ Abstract
UMAP achieves scalable layout optimization through stochastic negative sampling. However, this stochasticity can lead to unstable embeddings across reruns and downstream reuse, as the estimated repulsive forces depend on the ordering of sampling events. We present ibUMAP, a coherent field-based alternative that evaluates attraction and repulsion from a shared embedding snapshot and applies them synchronously. Its degree-weighted repulsive field is motivated by the conditional expectation of negative sampling for a fixed embedding and represented by three scalar moments, which are evaluated efficiently on CPUs and GPUs using an interpolation-based FFT scheme. This formulation avoids explicit all-pairs computations while inducing optimization dynamics that differ from those of standard online UMAP. Controlled experiments show that synchrony and kernel capping alter the local-global fidelity trade-off, whereas FFT evaluation produces small average changes in final quality. End-to-end benchmarks show median speedups of 3.29x unseeded and 5.79x seeded over umap-learn on CPU, and 1.44x over cuML on million-scale datasets under unseeded GPU execution. These gains accompany greater run-to-run stability and measurable fidelity trade-offs.