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

基于球面投影的测地距离估计

Geodesic Distance Estimation with Spherelets

Didong Li, David B Dunson

摘要:

许多统计和机器学习方法依赖于数据点之间的成对距离。距离度量的选择对这些过程的性能具有根本性影响,从而引发了关于如何适当计算距离的问题。当数据点是实值向量时,到目前为止最常见的选择是欧几里得距离。这篇文章的重点是如何更好地计算距离的问题,考虑到数据的内在几何,假设数据集中在一个未知的子空间或流形附近。适当的几何距离对应于沿着流形的最短路径的长度,这是测地线距离。当流形未知时,精确地近似测地线距离是具有挑战性的。当前的算法要么是高度复杂的,并且因此常常不切实际地实现,要么是基于可能具有不足的准确度的简单局部线性逼近和最短路径算法。我们提出了一个简单和一般的替代方案,它使用的领域,或sphetroquets,局部近似未知的子空间,从而估计通过路径的球面上的测地线距离。理论的发展显示出较低的误差,许多流形,在聚类,条件密度估计和平均回归的应用。通过多个仿真实例和实际数据集支持了这一结论。

英文摘要:

Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately calculate distances. When data points are real-valued vectors, by far the most common choice is the Euclidean distance. This article is focused on the problem of how to better calculate distances taking into account the intrinsic geometry of the data, assuming data are concentrated near an unknown subspace or manifold. The appropriate geometric distance corresponds to the length of the shortest path along the manifold, which is the geodesic distance. When the manifold is unknown, it is challenging to accurately approximate the geodesic distance. Current algorithms are either highly complex, and hence often impractical to implement, or based on simple local linear approximations and shortest path algorithms that may have inadequate accuracy. We propose a simple and general alternative, which uses pieces of spheres, or spherelets, to locally approximate the unknown subspace and thereby estimate the geodesic distance through paths over spheres. Theory is developed showing lower error for many manifolds, with applications in clustering, conditional density estimation and mean regression. The conclusion is supported through multiple simulation examples and real data sets.

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

↑