Skip to content
aiqbench takeMachine Learning

aiqbench analysis

ibUMAP introduces a coherent field-based approach to dimensionality reduction that replaces stochastic negative sampling with synchronous evaluation, significantly improving run-to-run stability and offering substantial speedups on both CPU and GPU. By leveraging interpolation-based FFT schemes, this method avoids explicit all-pairs computations while maintaining high fidelity in embedding quality across large-scale datasets. The research highlights a critical trade-off between optimization dynamics and local-global fidelity, providing researchers with a more deterministic alternative to standard UMAP implementations.
Sources coveringarXiv, AI Alignment Forum, Quantum Zeitgeist, AWS
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

ibUMAP: Coherent and Scalable Field Evaluation for UMAP Optimization

arXiv2 min read

arXiv:2610.01445v1 Announce Type: new 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.

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.

35 pages, 11 figures, 18 tables. Under review at ICLR 2027. Code: this https URL

Machine Learning (cs.LG); Human-Computer Interaction (cs.HC)

arXiv:2610.01445 [cs.LG]

(or arXiv:2610.01445v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2610.01445 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 280 words

Related coverage