基于非凸优化的欧氏距离样本高效几何重构
Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization
AI总结:
本文研究仅用最少欧氏距离样本进行几何重构的问题,提出基于非凸秩最小化的IRLS变体并给出局部收敛保证,同时建立切空间受限等距性质,实验证明其数据效率优于现有方法。
摘要:
仅给定点对之间的欧氏距离信息来寻找合适的点嵌入或几何配置,这一问题在多种机器学习应用中既作为核心任务出现,也作为子问题出现。本文旨在以最少数量的距离样本解决该问题。为此,我们利用该问题的连续非凸秩最小化形式,并为迭代重加权最小二乘法(IRLS)的一个变体建立了局部收敛保证,该保证在提供最小随机观测距离集合时成立。作为技术工具,我们在给定随机欧氏距离测量的情况下,建立了限制在对称秩-$r$矩阵流形切空间上的受限等距性质(RIP),这对其他非凸方法的分析可能具有独立的研究价值。此外,我们通过模拟数据和真实世界数据的数值实验,评估了不同重构算法的数据效率、可扩展性和泛化能力,结果表明所提算法相比现有最先进方法能够从更少的距离样本中识别底层几何结构。
英文摘要:
The problem of finding suitable point embedding or geometric configurations given only Euclidean distance information of point pairs arises both as a core task and as a sub-problem in a variety of machine learning applications. In this paper, we aim to solve this problem given a minimal number of distance samples. To this end, we leverage continuous and non-convex rank minimization formulations of the problem and establish a local convergence guarantee for a variant of iteratively reweighted least squares (IRLS), which applies if a minimal random set of observed distances is provided. As a technical tool, we establish a restricted isometry property (RIP) restricted to a tangent space of the manifold of symmetric rank-$r$ matrices given random Euclidean distance measurements, which might be of independent interest for the analysis of other non-convex approaches. Furthermore, we assess data efficiency, scalability and generalizability of different reconstruction algorithms through numerical experiments with simulated data as well as real-world data, demonstrating the proposed algorithm's ability to identify the underlying geometry from fewer distance samples compared to the state-of-the-art.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。