pith. sign in

arxiv: 2010.01359 · v1 · pith:2IAVUYAPnew · submitted 2020-10-03 · 💻 cs.LG · stat.ML

Perplexity-free Parametric t-SNE

classification 💻 cs.LG stat.ML
keywords parametricperplexityt-snemulti-scaleperplexity-freeadjustmentsalgorithmapproaches
0
0 comments X
read the original abstract

The t-distributed Stochastic Neighbor Embedding (t-SNE) algorithm is a ubiquitously employed dimensionality reduction (DR) method. Its non-parametric nature and impressive efficacy motivated its parametric extension. It is however bounded to a user-defined perplexity parameter, restricting its DR quality compared to recently developed multi-scale perplexity-free approaches. This paper hence proposes a multi-scale parametric t-SNE scheme, relieved from the perplexity tuning and with a deep neural network implementing the mapping. It produces reliable embeddings with out-of-sample extensions, competitive with the best perplexity adjustments in terms of neighborhood preservation on multiple data sets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.