arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.12272cond-mat.stat-mechcond-mat.dis-nn
收藏

高维随机几何图

Random geometric graphs in high dimension

Vittorio Erba, Sebastiano Ariosto, Marco Gherardi, Pietro Rotondo

摘要:

许多用于降维和流形学习的机器学习算法利用数据集每个点的最近邻居的计算来执行它们的任务。这些邻近关系定义了一个所谓的几何图,其中两个节点如果彼此足够接近则被链接。随机几何图,其中节点的位置在$\mathbb{R}^{d}$的子集中随机生成,提供了一个空模型来研究数据集和机器学习算法的典型属性。到目前为止,大多数文献都集中在低维随机几何图的特征化上,而机器学习中感兴趣的典型数据集生活在高维空间($d \gg 10^{2}$)中。在这项工作中,我们考虑的无限维限制的硬和软随机几何图,我们展示了如何计算的平均数的子图的给定有限大小$k$,例如平均数的$k$ -团。该分析强调了局部可观测量根据所选择的集合显示不同的行为:具有连续激活函数的软随机几何图收敛到Erdös-Rényi图提供的朴素无限维极限,而硬随机几何图可以显示出与之系统性的偏差。我们提出的数值证据表明,我们的分析见解,在无限维中是精确的,也为尺寸$d\gtrsim10$提供了良好的近似值。

英文摘要:

Many machine learning algorithms used for dimensional reduction and manifold learning leverage on the computation of the nearest neighbours to each point of a dataset to perform their tasks. These proximity relations define a so-called geometric graph, where two nodes are linked if they are sufficiently close to each other. Random geometric graphs, where the positions of nodes are randomly generated in a subset of $\mathbb{R}^{d}$, offer a null model to study typical properties of datasets and of machine learning algorithms. Up to now, most of the literature focused on the characterization of low-dimensional random geometric graphs whereas typical datasets of interest in machine learning live in high-dimensional spaces ($d \gg 10^{2}$). In this work, we consider the infinite dimensions limit of hard and soft random geometric graphs and we show how to compute the average number of subgraphs of given finite size $k$, e.g. the average number of $k$-cliques. This analysis highlights that local observables display different behaviors depending on the chosen ensemble: soft random geometric graphs with continuous activation functions converge to the naive infinite dimensional limit provided by Erdös-Rényi graphs, whereas hard random geometric graphs can show systematic deviations from it. We present numerical evidence that our analytical insights, exact in infinite dimensions, provide a good approximation also for dimension $d\gtrsim10$.

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

↑