pith. sign in

arxiv: 1708.03229 · v1 · pith:NWPU7WEQnew · submitted 2017-08-10 · 💻 cs.AI · cs.LG· stat.AP· stat.ML

Automatic Selection of t-SNE Perplexity

classification 💻 cs.AI cs.LGstat.APstat.ML
keywords perplexityt-snerequiresselectionapproachacrossanalyzedautomatic
0
0 comments X
read the original abstract

t-Distributed Stochastic Neighbor Embedding (t-SNE) is one of the most widely used dimensionality reduction methods for data visualization, but it has a perplexity hyperparameter that requires manual selection. In practice, proper tuning of t-SNE perplexity requires users to understand the inner working of the method as well as to have hands-on experience. We propose a model selection objective for t-SNE perplexity that requires negligible extra computation beyond that of the t-SNE itself. We empirically validate that the perplexity settings found by our approach are consistent with preferences elicited from human experts across a number of datasets. The similarities of our approach to Bayesian information criteria (BIC) and minimum description length (MDL) are also analyzed.

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.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. MEDAL: Manifold Embedding Distillation via Autoencoder Learning

    stat.ML 2026-05 unverdicted novelty 6.0

    MEDAL distills manifold embeddings into autoencoders to enable out-of-sample extension and held-out validation of dimension reduction methods.