3
votes
Accepted
How to find the size of an ϵ-net of a vector space?
Note that $\mathcal{W}_{\epsilon}$ is an epsilon-net in the parametrization space, which is just $p$-dimensional Euclidean space. (So there is no need to think about covering numbers in e.g. spaces of ...
2
votes
Accepted
Empirical Rademacher averages versus Hoeffdings bound
The answer depends on whether you want a bound for a single, fixed $Q\subseteq M$ or uniformly over all such $Q$. For a single, fixed $Q$, the Chernoff-Hoeffding bound is essentially the best you can ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
epsilon-nets × 9co.combinatorics × 4
cg.comp-geom × 4
vc-dimension × 3
ds.algorithms × 2
pr.probability × 2
lg.learning × 2
metrics × 2
reference-request × 1
graph-theory × 1
machine-learning × 1
approximation-hardness × 1
set-cover × 1
max-cut × 1
hypergraphs × 1
high-dimensional-geometry × 1