arXiv Machine Learning

How smoothing the affinity matrix affects neighborhood preservation in t-SNE

The paper investigates how adjusting the sharpness of t‑SNE’s affinity matrix influences neighborhood preservation across scales. By applying a row‑wise power transform parameterized by γ, the authors can smooth or sharpen each row while keeping sparsity and rank order intact, effectively rescaling the Gaussian bandwidth and altering local perplexities. Experiments show that sharpening enhances the retention of the very nearest neighbors, whereas smoothing improves the preservation of broader local neighborhoods, outperforming existing multiscale affinity methods in the mid‑local range.

arXiv Machine Learning
Sep 7

On the Abundance of Critical Points of the t-SNE Energy

The paper investigates the energy landscape of the t‑SNE algorithm, highlighting its non‑convexity and the resulting difficulty in understanding its behavior. It demonstrates that for a broad class of t‑SNE‑related energies and symmetric data densities, there exist infinite families of distinct critical points that preserve discrete symmetries in both feature and embedding spaces. These critical configurations explain empirical observations such as topology breaking and spurious clustering, and the authors support their claims with numerical and analytical examples.

By Nakul Haridas, Ryan Murray
arXiv Machine Learning
Jun 4

On Out-of-sample Embedding in UMAP

arXiv:2606. 04451v1 Announce Type: new Abstract: Neighbor embedding algorithms reveal correlations in high-dimensional data by constructing an equivalent graph representation in a lower-dimensional space.

By Mohammad Tariqul Islam, Jason W. Fleischer