Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2020
DOI: 10.48550/arxiv.2008.00325
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Bringing UMAP Closer to the Speed of Light with GPU Acceleration

Abstract: The Uniform Manifold Approximation and Projection (UMAP) algorithm has become widely popular for its ease of use, quality of results, and support for exploratory, unsupervised, supervised, and semi-supervised learning. While many algorithms can be ported to a GPU in a simple and direct fashion, such efforts have resulted in inefficent and inaccurate versions of UMAP. We show a number of techniques that can be used to make a faster and more faithful GPU version of UMAP, and obtain speedups of up to 100x in prac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
1
1
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 36 publications
0
3
0
Order By: Relevance
“…The approximate NN search makes the algorithm fast, but it also includes the possibility of small mistakes in the determination of nearest neighbors. Even though exact solutions exist, for example, the graphics processing unit (GPU)-accelerated UMAP implementation provides such an option (Nolet et al, 2020), and approximate NN-search within the original UMAP-learn python implementation (McInnes et al, 2018) provides enough accuracy for the typical fs-LIMS tasks. Furthermore, in the second stage, the algorithm weighs the nearest neighbors and forms the weighted NN-graph using smoothing kernels that adapt to the local neighborhood.…”
Section: Sample and Methodsmentioning
confidence: 99%
“…The approximate NN search makes the algorithm fast, but it also includes the possibility of small mistakes in the determination of nearest neighbors. Even though exact solutions exist, for example, the graphics processing unit (GPU)-accelerated UMAP implementation provides such an option (Nolet et al, 2020), and approximate NN-search within the original UMAP-learn python implementation (McInnes et al, 2018) provides enough accuracy for the typical fs-LIMS tasks. Furthermore, in the second stage, the algorithm weighs the nearest neighbors and forms the weighted NN-graph using smoothing kernels that adapt to the local neighborhood.…”
Section: Sample and Methodsmentioning
confidence: 99%
“…For these reasons, a depth of three was chosen for all RAC descriptors used in this analysis. The Uniform Manifold Approximation and Projection (UMAP) technique 65 as implemented in the RAPIDS cuML Python library 66 was used to reduce the high dimensional data for each type of descriptor to only two dimensions for visualization purposes (e.g., the 20-dimensional metal-centre RAC descriptors were reduced to two dimensions using UMAP). Hyperparameters used for the generation of these plots are given in the supporting material.…”
Section: Diversity Analysismentioning
confidence: 99%
“…Another topic modeling project used a different data source to analyze the discussions of COVID-19. Ordun et al [20] utilized LDA, UMAP [15,18], and other approaches to visualize the COVID-19 related posts on Twitter.…”
Section: Related Workmentioning
confidence: 99%