Math 2.0

Convex and discrete geometry Concept

Epsilon-net of a set system

Summary

An ε\varepsilon-net of a family of sets is a subset of the ground set that meets every large member of the family. Here large means that the member holds at least an ε\varepsilon fraction of the points. It is a small sample that is guaranteed to hit every heavy range. The ε\varepsilon-net theorem of Haussler and Welzl says that families of VC dimension dd have ε\varepsilon-nets of size O(dεlog⁡dε)O\big(\frac{d}{\varepsilon} \log \frac{d}{\varepsilon}\big), independent of the number of points. This makes ε\varepsilon-nets a central tool in computational geometry and learning theory.

Further reading

  1. Web https://en.wikipedia.org/wiki/Ε-net_(computational_geometry)
About this page
TagV2SBN1FNQV
URIm2://V2SBN1FNQV
Kindconcept
WritingW0 stub
MSC52C45, 68U05, 05D05
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions