scientific article; zbMATH DE number 7559257
From MaRDI portal
Publication:5088989
DOI10.4230/LIPIcs.SoCG.2019.57MaRDI QIDQ5088989
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1903.06617
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal partition trees
- Relative \((p,\varepsilon )\)-approximations in geometry
- Rates of growth and sample moduli for weighted empirical processes indexed by sets
- \(\epsilon\)-nets and simplex range queries
- Almost tight bounds for \(\epsilon\)-nets
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Efficient partition trees
- When are epsilon-nets small?
- New Lower Bounds for ϵ-nets
- Sampling Statistics
- Learnability and the Vapnik-Chervonenkis dimension
- Product Range Spaces, Sensitive Sampling, and Derandomization
- Theory of Disagreement-Based Active Learning
- Small-size relative ( p ,ε)-approximations for well-behaved range spaces
- Tight lower bounds for the size of epsilon-nets
- Improved bounds on the sample complexity of learning
