2021
DOI: 10.1609/aaai.v35i1.16118
|View full text |Cite
|
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...
2
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 46 publications
0
6
0
Order By: Relevance
“…Uniform Manifold Approximation and Projection (UMAP) is a dimension reduction algorithm that creates low-dimensional representations of complex, nonlinear data while preserving its global structure . It has been applied across various fields including biology, computer science, and economics. UMAP creates a fuzzy topological structure, called a “simplicial complex,” of the high-dimensional data set to encode relationships between points . It builds the simplicial complex by adding high-dimensional simplices to a k-nearest neighbor graph using a k-d tree algorithm .…”
Section: Methodsmentioning
confidence: 99%
“…Uniform Manifold Approximation and Projection (UMAP) is a dimension reduction algorithm that creates low-dimensional representations of complex, nonlinear data while preserving its global structure . It has been applied across various fields including biology, computer science, and economics. UMAP creates a fuzzy topological structure, called a “simplicial complex,” of the high-dimensional data set to encode relationships between points . It builds the simplicial complex by adding high-dimensional simplices to a k-nearest neighbor graph using a k-d tree algorithm .…”
Section: Methodsmentioning
confidence: 99%
“…The dimensionality reduction was done using principal component analysis (PCA). The neighborhood graph and UMAP embedding were computed using the rapids implementation of the UMAP algorithm 77 for 10 neighbors and the first 10 principal components (n_neighbors = 10, n_PC = 10). Unsupervised clustering was performed using the rapids implementation of the Louvain algorithm.…”
Section: Single-cell Immune Profilingmentioning
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, as implemented in the RAPIDS cuML Python library, was used to reduce the high-dimensional data for each type of descriptors to only two dimensions for visualization purposes (e.g., the 20-dimensional metal-center RAC descriptors were reduced to two dimensions using UMAP). Each set of descriptors was stacked into a feature vector as the input for the dimensionality reduction without any scaling.…”
Section: Methodsmentioning
confidence: 99%