arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.13053math.PRmath.STstat.MLstat.TH
收藏

降维的概率图耦合视角

A Probabilistic Graph Coupling View of Dimension Reduction

Hugues Van Assel, Thibault Espinasse, Julien Chiquet, Franck Picard

AI总结:

本文提出基于隐图交叉熵耦合的概率统计框架,统一解释 t-SNE、UMAP 等成对相似性降维方法,揭示其粗粒度依赖保持缺陷,并通过扩展模型加以改进。

摘要:

大多数流行的降维(DR)方法(如 t-SNE 和 UMAP)都基于最小化输入空间与潜在空间中成对相似性之间的代价。尽管这些方法应用广泛,却缺乏清晰的概率基础,难以让人充分理解其性质与局限。为此,我们提出一种基于隐图耦合并使用交叉熵的统一统计框架。这些图在输入空间和潜在空间的观测之间诱导出 Markov 随机场依赖结构。我们表明,通过为图选择特定先验,现有成对相似性 DR 方法都可由该框架恢复。此外,这揭示出这些方法存在一种统计缺陷,解释了它们在保持粗粒度依赖关系时性能较差的原因。我们利用并扩展所提模型来解决该问题,同时建立了其与 Laplacian eigenmaps 和 PCA 之间的新联系。

英文摘要:

Most popular dimension reduction (DR) methods like t-SNE and UMAP are based on minimizing a cost between input and latent pairwise similarities. Though widely used, these approaches lack clear probabilistic foundations to enable a full understanding of their properties and limitations. To that extent, we introduce a unifying statistical framework based on the coupling of hidden graphs using cross entropy. These graphs induce a Markov random field dependency structure among the observations in both input and latent spaces. We show that existing pairwise similarity DR methods can be retrieved from our framework with particular choices of priors for the graphs. Moreover this reveals that these methods suffer from a statistical deficiency that explains poor performances in conserving coarse-grain dependencies. Our model is leveraged and extended to address this issue while new links are drawn with Laplacian eigenmaps and PCA.

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

↑