2020/09/27 by Tim Sainburg, Sainburg, Tim, Leland McInnes +4 · 34 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Advanced Graph Neural Networks #Computational Geometry (cs.CG) #Domain Adaptation and Few-Shot Learning #FOS: Biological sciences #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Quantitative Methods (q-bio.QM) #Topological and Geometric Data Analysis #cs.CG #cs.LG #q-bio.QM #stat.ML
paper · pdf · doi:10.48550/arxiv.2009.12981
openalex publication_date 2020/09/27 · arxiv created 2021/08/29 · arxiv updated 2021/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02
UMAP is a non-parametric graph-based dimensionality reduction algorithm using applied Riemannian geometry and algebraic topology to find low-dimensional embeddings of structured data. The UMAP algorithm consists of two steps: (1) Compute a graphical representation of a dataset (fuzzy simplicial complex), and (2) Through stochastic gradient descent, optimize a low-dimensional embedding of the graph. Here, we extend the second step of UMAP to a parametric optimization over neural network weights, learning a parametric relationship between data and embedding. We first demonstrate that Parametric UMAP performs comparably to its non-parametric counterpart while conferring the benefit of a learned parametric mapping (e.g. fast online embeddings for new data). We then explore UMAP as a regularization, constraining the latent distribution of autoencoders, parametrically varying global structure preservation, and improving classifier accuracy for semi-supervised learning by capturing structure in unlabeled data. Google Colab walkthrough: https://colab.research.google.com/drive/1WkXVZ5pnMrm17m0YgmtoNjMXHdnE5Vp?usp=sharing