Skip to content
Unsupervised Dimensionality Reduction: UMAP vs t-SNE episode artwork

EPISODE · Jan 13, 2020 · 29 MIN

Unsupervised Dimensionality Reduction: UMAP vs t-SNE

from Linear Digressions · host Katie Malone

Dimensionality reduction redux: this episode covers UMAP, an unsupervised algorithm designed to make high-dimensional data easier to visualize, cluster, etc. It’s similar to t-SNE but has some advantages. This episode gives a quick recap of t-SNE, especially the connection it shares with information theory, then gets into how UMAP is different (many say better). Between the time we recorded and released this episode, an interesting argument made the rounds on the internet that UMAP’s advantages largely stem from good initialization, not from advantages inherent in the algorithm. We don’t cover that argument here obviously, because it wasn’t out there when we were recording, but you can find a link to the paper below. Relevant links: https://pair-code.github.io/understanding-umap/ https://www.biorxiv.org/content/10.1101/2019.12.19.877522v1

Episode metadata supplied by the publisher feed · Published Jan 13, 2020

Embed this episode

Ready to play

Unsupervised Dimensionality Reduction: UMAP vs t-SNE

0:00 29:34

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Linear Digressions?

This episode is 29 minutes long.

When was this Linear Digressions episode published?

This episode was published on January 13, 2020.

Can I download this Linear Digressions episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!