首页> 外文期刊>Journal of the American Mathematical Society >Tight lower bounds for the size of epsilon-nets
【24h】

Tight lower bounds for the size of epsilon-nets

机译:epsilon网络的大小的严格下限

获取原文
获取原文并翻译 | 示例
       

摘要

According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an ε-net of size. Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range spaces of VC-dimension 2, for which the above bound is sharp. The only known range spaces of small VC-dimension, in which the ranges are geometric objects in some Euclidean space and the size of the smallest ε-nets is superlinear in 1/ε, were found by Alon (2010). In his examples, every ε-net is of size, where g is an extremely slowly growing function, related to the inverse Ackermann function. We show that there exist geometrically defined range spaces, already of VC-dimension, in which the size of the smallest ε-nets is. We also construct range spaces induced by axis-parallel rectangles in the plane, in which the size of the smallest ε-nets is. By a theorem of Aronov, Ezra, and Sharir (2010), this bound is tight.
机译:根据Haussler和Welzl(1987)的一个众所周知的定理,有界VC维的任何范围空间都允许一个ε-net大小。 Pach和Woeginger(1990)使用概率技术显示,存在VC维2的范围空间,对于该范围空间,上述界限很明显。 Alon(2010)发现,只有已知的小VC维范围空间,其中范围是某些欧几里得空间中的几何对象,最小ε-网络的大小是1 /ε的超线性。在他的示例中,每个ε-net的大小都是一定的,其中g是一个极其缓慢增长的函数,与阿克曼逆函数有关。我们表明,已经存在VC尺寸的几何定义范围空间,其中最小的ε-网络的大小为。我们还构造了由平面中的轴平行矩形诱导的范围空间,其中最小ε-net的大小为。根据Aronov,Ezra和Sharir(2010)的定理,这个界限很严格。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号