The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Parametric UMAP Embeddings for Representation and Semisupervised Learning
Open accessAbstract
UMAP is a nonparametric 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) computing a graphical representation of a data set (fuzzy simplicial complex) and (2) through stochastic gradient descent, optimizing 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 nonparametric 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 semisupervised learning by capturing structure in unlabeled data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2008) · Journal of Machine Learning Research · Cited by 33,051
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
Silhouettes: A graphical aid to the interpretation and validation of cluster analysis
Rousseeuw, P. J. (1987) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(87)90125-7 · Cited by 21,392
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Auto-Encoding Variational Bayes
Kingma, D. P., & Welling, M. (2013) · arXiv · doi:10.48550/arxiv.1312.6114 · Cited by 20,067
Unsupervised representation learning with deep convolutional generative adversarial networks
Radford, A., Metz, L., & Chintala, S. (2015) · arXiv · doi:10.48550/arxiv.1511.06434 · Cited by 12,235
UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction
McInnes, L., Healy, J., & Melville, J. (2018) · arXiv · doi:10.48550/arxiv.1802.03426 · Cited by 7,101
Self-citationFashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms
Xiao, H., Rasul, K., & Vollgraf, R. (2017) · arXiv · doi:10.48550/arxiv.1708.07747 · Cited by 6,108
Dimensionality reduction for visualizing single-cell data using UMAP
Becht, E., McInnes, L., Healy, J., Dutertre, C.-A., Kwok, I. W. H., Ng, L. G., Ginhoux, F., & Newell, E. W. (2019) · Nature Biotechnology · doi:10.1038/nbt.4314 · Cited by 5,358
Self-citationFixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence
Sohn, K., Berthelot, D., Li, C.-L., Zhang, Z., Carlini, N., Cubuk, E. D., Kurakin, A., Zhang, H., & Raffel, C. (2020) · arXiv · doi:10.48550/arxiv.2001.07685 · Cited by 2,892
Accelerating t-SNE using tree-based algorithms
van der Maaten, L. (2014) · doi:10.5555/2627435.2697068 · Cited by 2,226
Visualizing structure and transitions in high-dimensional biological data
Moon, K. R., van Dijk, D., Wang, Z., Gigante, S., Burkhardt, D. B., Chen, W. S., Yim, K., Elzen, A. V. D., Hirn, M. J., Coifman, R. R., et al. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0336-3 · Cited by 1,065
Global Versus Local Methods in Nonlinear Dimensionality Reduction
de Silva, V., & Tenenbaum, J. B. (2002) · Cited by 787
Inferring single-trial neural population dynamics using sequential auto-encoders
Pandarinath, C., O’Shea, D. J., Collins, J., Jozefowicz, R., Stavisky, S. D., Kao, J. C., Trautmann, E. M., Kaufman, M. T., Ryu, S. I., Hochberg, L. R., et al. (2018) · Nature Methods · doi:10.1038/s41592-018-0109-9 · Cited by 686
Efficient k-nearest neighbor graph construction for generic similarity measures
Dong, W., Moses, C., & Li, K. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963487 · Cited by 673
ReMixMatch: Semi-Supervised Learning with Distribution Matching and Augmentation AnchoringPreprint
Berthelot, D., Carlini, N., Cubuk, E. D., Kurakin, A., Sohn, K., Zhang, H., & Raffel, C. (2020) · arXiv (Cornell University) · Cited by 600
Fast interpolation-based t-SNE for improved visualization of single-cell RNA-seq data
Linderman, G. C., Rachh, M., Hoskins, J. G., Steinerberger, S., & Kluger, Y. (2019) · Nature Methods · doi:10.1038/s41592-018-0308-4 · Cited by 534
Learning a Parametric Embedding by Preserving Local Structure
van der Maaten, L. J. P. (2009) · International Conference on Artificial Intelligence and Statistics · Cited by 464
Initialization is critical for preserving global data structure in both t-SNE and UMAP
Kobak, D., & Linderman, G. C. (2021) · Nature Biotechnology · doi:10.1038/s41587-020-00809-z · Cited by 365
Interpretable dimensionality reduction of single cell transcriptome data with deep generative models
Ding, J., Condon, A., & Shah, S. P. (2018) · Nature Communications · doi:10.1038/s41467-018-04368-5 · Cited by 337
Quality assessment of dimensionality reduction: Rank-based criteria
Lee, J. A., & Verleysen, M. (2009) · Neurocomputing · doi:10.1016/j.neucom.2008.12.017 · Cited by 292
Parametric nonlinear dimensionality reduction using kernel t-SNE
Gisbrecht, A., Schulz, A., & Hammer, B. (2015) · Neurocomputing · doi:10.1016/j.neucom.2013.11.045 · Cited by 268
Local multidimensional scaling
Venna, J., & Kaski, S. (2006) · Neural Networks · doi:10.1016/j.neunet.2006.05.014 · Cited by 239
Ethology as a physical science
Brown, A. E. X., & de Bivort, B. (2018) · Nature Physics · doi:10.1038/s41567-018-0093-0 · Cited by 174
Efficient Algorithms for t-distributed Stochastic Neighborhood EmbeddingPreprint
Linderman, G. C., Rachh, M., Hoskins, J. G., Steinerberger, S., & Kluger, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.09005 · Cited by 172
openTSNE: a modular Python library for t-SNE dimensionality reduction and embeddingPreprint
Poličar, P. G., Stražar, M., & Zupan, B. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/731877 · Cited by 155
Carter, S., Armstrong, Z., Schubert, L., Johnson, I., & Olah, C. (2019) · Distill · doi:10.23915/distill.00015 · Cited by 147
White, T. (2020) · Open Access Victoria University of Wellington | Te Herenga Waka (Figshare) · doi:10.26686/wgtn.12585362.v1 · Cited by 94
Lee, J. A., Peluffo-Ordóñez, D. H., & Verleysen, M. (2015) · Neurocomputing · doi:10.1016/j.neucom.2014.12.095 · Cited by 93
Sainburg, T., Thielk, M., Theilman, B. H., Migliori, B. J., & Gentner, T. Q. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.06650 · Cited by 62
Self-citationDIMAL: Deep Isometric Manifold Learning Using Sparse Geodesic Sampling
Pai, G., Talmon, R., Bronstein, A. M., & Kimmel, R. (2019) · IEEE Winter Conference on Applications of Computer Vision · doi:10.1109/wacv.2019.00092 · Cited by 52
Composition and sequential organization of song repertoires in Cassin’s Vireo (Vireo cassinii)
Hedley, R. W. (2015) · Journal für Ornithologie · doi:10.1007/s10336-015-1238-x · Cited by 44
Schulz, A., Hinder, F., & Hammer, B. (2020) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 27
Extendable and invertible manifold learning with geometry regularized autoencoders
Duque, A. F., Morin, S., Wolf, G., & Moon, K. R. (2020) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata50022.2020.9378049 · Cited by 25
Hedley, R. W. (2016) · PLoS ONE · doi:10.1371/journal.pone.0150822 · Cited by 22
Interpretable Visualizations with Differentiating Embedding NetworksPreprint
Robinson, I. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.06640 · Cited by 4
Cited by
MatSciBERT: A materials domain language model for text mining and information extraction
Gupta, T., Zaki, M., Krishnan, N. M. A., & Mausam (2022) · npj Computational Materials · doi:10.1038/s41524-022-00784-w · Cited by 342
Schøyen, V., Pettersen, M. B., Holzhausen, K., Fyhn, M., Malthe-Sørenssen, A., & Lepperød, M. E. (2023) · iScience · doi:10.1016/j.isci.2023.108102 · Cited by 28
Schøyen (2022) · doi:10.1101/2022.08.18.504379 · Cited by 27
Fine-tuning protein language models unlocks the potential of underrepresented viral proteomes
Sawhney, R., Ferrell, B. D., Dejean, T., Schreiber, Z., Harrigan, W., Polson, S. W., Wommack, K. E., & Belcaid, M. (2025) · PeerJ · doi:10.7717/peerj.19919 · Cited by 14
Amino acid sequence encodes protein abundance shaped by protein stability at reduced synthesis cost
(2024) · doi:10.1002/pro.5239 · Cited by 12
Metadata
- Authors
- Sainburg, T., McInnes, L., & Gentner, T. Q.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2021-08-30
- Volume
- 33
- Issue
- 11
- Pages
- 1-27
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W3150406472
- Cited by
- 270
- References
- 36
- FWCI
- 14.81
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.