English

Perplexity-free Parametric t-SNE

Machine Learning 2020-10-06 v1 Machine Learning

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.

Keywords

Cite

@article{arxiv.2010.01359,
  title  = {Perplexity-free Parametric t-SNE},
  author = {Francesco Crecchi and Cyril de Bodt and Michel Verleysen and John A. Lee and Davide Bacciu},
  journal= {arXiv preprint arXiv:2010.01359},
  year   = {2020}
}

Comments

ESANN 2020 proceedings, European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. Online event, 2-4 October 2020, i6doc.com publ., ISBN 978-2-87587-074-2. Available from http://www.i6doc.com/en/

R2 v1 2026-06-23T18:59:56.249Z