k-距离近似的下界
Lower bounds for k-distance approximation
摘要:
考虑维数为$d-1$的单位球面上的N个随机点的集合P,以及对称化集合S = P并(-P)。S的二分多面体定义为S中N个不同点的形心集的凸包。我们证明了适当的重新缩放后,这个减半多面体是豪斯多夫接近单位球的概率很高,只要点的数量增长像$Omega(d log(d))$。从这个结果中,我们推导出概率下界的复杂性的近似的距离的经验措施的点集的距离函数。
英文摘要:
Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that after appropriate rescaling this halving polyhedron is Hausdorff close to the unit ball with high probability, as soon as the number of points grows like $Omega(d log(d))$. From this result, we deduce probabilistic lower bounds on the complexity of approximations of the distance to the empirical measure on the point set by distance-like functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。