ibUMAP: Coherent and Scalable Field Evaluation for UMAP Optimization
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 53 references that are in the map. First posted on arXiv 1 Oct 2026.
Builds on
15 of 53 references.
References · 15
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2018ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithmscited by 130
- 2017Efficient Algorithms for t-distributed Stochastic Neighborhood Embeddingcited by 75
- 2020Attraction-Repulsion Spectrum in Neighbor Embeddingscited by 41
- 2021On UMAP's true loss functioncited by 32
- 2022From t-SNE to UMAP with contrastive learningcited by 28
- 2020Bringing UMAP Closer to the Speed of Light with GPU Accelerationcited by 18
- 2021The Fast Kernel Transformcited by 8
- 2023Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distributioncited by 5
- 2025The Shape of Attraction in UMAP: Exploring the Embedding Forces in Dimensionality Reductioncited by 5
3 more
Built on by
Not cited yet.