vix.ing · top · new · best · stats · spec

Parametric UMAP embeddings for representation and semi-supervised\n learning

2020/09/27 by Tim Sainburg, Sainburg, Tim, Leland McInnes +3 · 25 citations
Computer Science · #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

paper · pdf · doi:10.48550/arxiv.2009.12981

openalex publication_date 2020/09/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02

Abstract

UMAP is a non-parametric graph-based dimensionality reduction algorithm using\napplied Riemannian geometry and algebraic topology to find low-dimensional\nembeddings of structured data. The UMAP algorithm consists of two steps: (1)\nCompute a graphical representation of a dataset (fuzzy simplicial complex), and\n(2) Through stochastic gradient descent, optimize a low-dimensional embedding\nof the graph. Here, we extend the second step of UMAP to a parametric\noptimization over neural network weights, learning a parametric relationship\nbetween data and embedding. We first demonstrate that Parametric UMAP performs\ncomparably to its non-parametric counterpart while conferring the benefit of a\nlearned parametric mapping (e.g. fast online embeddings for new data). We then\nexplore UMAP as a regularization, constraining the latent distribution of\nautoencoders, parametrically varying global structure preservation, and\nimproving classifier accuracy for semi-supervised learning by capturing\nstructure in unlabeled data. Google Colab walkthrough:\nhttps://colab.research.google.com/drive/1WkXVZ5pnMrm17m0YgmtoNjMXHdnE5Vp?usp=sharing\n

Citations

Cited by

Related