Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set Systems - HAL Accéder directement au contenu
Chapitre d'ouvrage Année : 2017

Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set Systems

Résumé

Following groundbreaking work by Haussler and Welzl (1987), the use of small-nets has become a standard technique for solving algorithmic and extremal problems in geometry and learning theory. Two significant recent developments are: (i) an upper bound on the size of the smallest-nets for set systems, as a function of their so-called shallow-cell complexity (Chan, Grant, Könemann, and Sharpe); and (ii) the construction of a set system whose members can be obtained by intersecting a point set in R 4 by a family of half-spaces such that the size of any-net for them is Ω(1 log 1) (Pach and Tardos). The present paper completes both of these avenues of research. We (i) give a lower bound, matching the result of Chan et al., and (ii) generalize the construction of Pach and Tardos to half-spaces in R d , for any d ≥ 4, to show that the general upper bound, O(d log 1), of Haussler and Welzl for the size of the smallest-nets is tight.
Fichier principal
Vignette du fichier
epsnetslowerbounds012717.pdf ( 440.26 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01468669, version 1 (15-02-2017)

Identifiants

  • HAL Id : hal-01468669 , version 1

Citer

Andrey Kupavskii, Nabil Mustafa, János Pach. Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set Systems. A Journey Through Discrete Mathematics: A Tribute to Jirí Matousek, 2017, 978-3-319-44479-6. ⟨hal-01468669⟩
256 Consultations
263 Téléchargements
Dernière date de mise à jour le 26/06/2024
comment ces indicateurs sont-ils produits

Partager

Gmail Facebook Twitter LinkedIn Plus