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

平衡几何和密度:高维数据上的路径距离

Balancing Geometry and Density: Path Distances on High-Dimensional Data

University of Utah(犹他大学);UCLA(加州大学洛杉矶分校);Tufts University(塔夫茨大学)

Anna Little, Daniel McKenzie, James Murphy

摘要:

新的几何和计算分析的功率加权最短路径距离(PWSPD)。通过阐明这些指标在底层数据中平衡密度和几何形状的方式,我们澄清了它们的关键参数,并讨论了在实践中如何选择它们。与相关的数据驱动的指标进行比较,说明密度在基于内核的无监督和半监督机器学习中的更广泛的作用。在计算上,我们与PWSPD在完整的加权图上的加权最近邻图的类似物,提供高概率的保证,他们的等价性是接近最佳的。与渗流理论的连接建立在有限样本设置的PWSPD的偏差和方差的估计。理论结果得到了说明性实验的支持,证明了PWSPD的多功能性,广泛的数据设置。在整个文件中,我们的结果只需要底层数据是从一个低维流形采样,并依赖于这个流形的内在尺寸,而不是它的环境尺寸至关重要。

英文摘要:

New geometric and computational analyses of power-weighted shortest-path distances (PWSPDs) are presented. By illuminating the way these metrics balance density and geometry in the underlying data, we clarify their key parameters and discuss how they may be chosen in practice. Comparisons are made with related data-driven metrics, which illustrate the broader role of density in kernel-based unsupervised and semi-supervised machine learning. Computationally, we relate PWSPDs on complete weighted graphs to their analogues on weighted nearest neighbor graphs, providing high probability guarantees on their equivalence that are near-optimal. Connections with percolation theory are developed to establish estimates on the bias and variance of PWSPDs in the finite sample setting. The theoretical results are bolstered by illustrative experiments, demonstrating the versatility of PWSPDs for a wide range of data settings. Throughout the paper, our results require only that the underlying data is sampled from a low-dimensional manifold, and depend crucially on the intrinsic dimension of this manifold, rather than its ambient dimension.

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

↑