arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.01889stat.MLcs.LG
收藏

软最近邻丢失表示法的分析与改进

Analyzing and Improving Representations with the Soft Nearest Neighbor Loss

Google Brain(谷歌大脑(Google Brain))

Nicholas Frosst, Nicolas Papernot, Geoffrey Hinton

摘要:

我们探索并扩展了$\textit{Soft Nearest Neighbor Loss}$来度量表示空间中类流形的$\textit{entanglement}$:即,来自同一类的点对相对于来自不同类的点对的接近程度。我们展示了损失的几个用例。作为一种分析工具,它提供了深入了解学习过程中类相似性结构的演变。令人惊讶的是,我们发现,$\textit{maximizing}$的纠缠表示的隐藏层中的不同类是有益的歧视在最后一层,可能是因为它鼓励表示,以确定类独立的相似性结构。最大化隐藏层中的软最近邻损失不仅可以提高泛化能力,还可以更好地校准离群数据的不确定性估计。不是来自训练分布的数据可以通过观察在隐藏层中,它具有少于预测类的正常数量的邻居来识别。

英文摘要:

We explore and expand the $\textit{Soft Nearest Neighbor Loss}$ to measure the $\textit{entanglement}$ of class manifolds in representation space: i.e., how close pairs of points from the same class are relative to pairs of points from different classes. We demonstrate several use cases of the loss. As an analytical tool, it provides insights into the evolution of class similarity structures during learning. Surprisingly, we find that $\textit{maximizing}$ the entanglement of representations of different classes in the hidden layers is beneficial for discrimination in the final layer, possibly because it encourages representations to identify class-independent similarity structures. Maximizing the soft nearest neighbor loss in the hidden layers leads not only to improved generalization but also to better-calibrated estimates of uncertainty on outlier data. Data that is not from the training distribution can be recognized by observing that in the hidden layers, it has fewer than the normal number of neighbors from the predicted class.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑