UMAP is faster than t-SNE

t-SNE preserves local structure

Can we see the hidden patterns in a cloud of data points?

approximation algorithms guarantee: solution within factor α of optimal

Can we always find the best solution quickly?

cosine similarity is preferred over dot product for normalized embeddings

Why do we need a special way to measure similarity in high-dimensional spaces?

batch size affects generalization: larger batches find sharper minima

Larger batch sizes lead to sharper minima, enhancing generalization by providing more accurate gradient estimates

O(n log n) is the lower bound for comparison-based sorting

Ever wonder why sorting can't be faster than a certain point?

Locality-sensitive hashing

Locality-sensitive hashing (LSH) hashes similar items into the same buckets