t-SNE复杂度的自动选择
Automatic Selection of t-SNE Perplexity
摘要:
t-分布随机邻域嵌入(t-SNE)是数据可视化中应用最广泛的降维方法之一,但其超参数复杂,需要人工选择。在实践中,t-SNE困惑的适当调整需要用户理解该方法的内部工作以及具有实践经验。我们提出了一个模型选择目标的t-SNE的困惑,需要微不足道的额外计算以外的t-SNE本身。我们的经验验证,我们的方法发现的困惑设置是一致的,从人类专家在许多数据集的偏好。我们的方法贝叶斯信息准则(BIC)和最小描述长度(MDL)的相似性进行了分析。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。