必应词典为您提供covering-number的释义,un. 覆盖数;
在机器学习中,我们为了研究模型的泛化能力,需要对一个函数类研究它的Uniform Convergence。当函数类中元素有限时,通过Union Bound很容易得到我们需要的结果。但是当函数类中元素有无穷多个时,我们就需要求助于其他的工具,覆盖数(Covering Number)便是其中之一。
1)covering number覆盖数 1.Let γ(G),β(G) and α(G) be the domination number, matching number and covering number of a graph G, respectively.我们分别用γ(G),β(G)和0α(G)表示图G的控制数、匹配数和覆盖数,对任意连通图,有γ(G)≤β(G)≤α(G)成立,1998年,Randerath和Volkmann给出了...
覆盖数N（e,T,d）指的是在一个任意的半度量空间(T,d)中，半径为e的闭球B（x0;e）={y: d(...
其实和generalization的关系都是我瞎推的,我其实还没看真的covering number generalization bound是不是这样的。其实现在的generalization bound还没成型!注意到,在bound里并没有体现 error随着n增加而减小,也就是没有类似1/n,1/sqrt(n)这样的项。我认为想要弄出1/n,肯定是从K里面出来的。不妨拿一个distance试试...
point covering number 英 [pɔɪnt ˈkʌvərɪŋ ˈnʌmbə(r)] 美 [pɔɪnt ˈkʌvərɪŋ ˈnʌmbər]网络 点覆盖数 ...
We give an upper bound for the covering number cn( G ) which is linear in the rank of G , i.e. we give a constant d such that for every noncentral conjugacy class C of G we have C rd = G , where r =rank G .关键词: Conjugacy Class Algebraic Group Regular Element Chevalley ...
The covering number of a group G is the smallest integer k, such that Ck=G for all nonidentity conjugacy classes C of G. If no such integer exists, the covering number is defined to be ω, the smallest infinite ordinal. In this article the frequency of groups with covering number equal...
However, besides its own interest, it serves as a bridge between the kissing number and the covering number. This paper will review the basic problems and the main known results about these three numbers with an emphasis on their connections. In addition, it also contains some new results ...
sample complexity (ε,δ) ≥ log((1-δ) * covering number). 虽然这个bound是log级别的,看起来比较松,但是其证明思想还是很有意思的。为了描述更清楚,我们严谨地说一下notation(文章里的notation用的特别聪明,但是这里我转化成常用的)。 定义们~: ...