arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1707.05381math.COcs.CGcs.DM
收藏

关于弱$ε$ -网和Radon数

On weak $ε$-nets and the Radon number

Shay Moran, Amir Yehudayoff

摘要:

我们表明,Radon数的特征存在的弱网可分凸空间(一个抽象的欧几里德概念的凸性)。当Radon数为有限时,弱网的构造是基于Helly的性质和VC类的度量性质。当Radon数较大时,弱网的规模下界依赖于Kneser图的色数。作为应用,我们证明了弱$ε$ -网的一个Boosting型结果。

英文摘要:

We show that the Radon number characterizes the existence of weak nets in separable convexity spaces (an abstraction of the euclidean notion of convexity). The construction of weak nets when the Radon number is finite is based on Helly's property and on metric properties of VC classes. The lower bound on the size of weak nets when the Radon number is large relies on the chromatic number of the Kneser graph. As an application, we prove a boosting-type result for weak $ε$-nets.

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

↑