Two proofs for shallow packings
type: Item
instance of: scholarly article
title: Two proofs for shallow packings
zbMATH Open document ID: 1352.05047
author: Kunal Dutta
author: Esther Ezra
author: Arijit Ghosh
published in: Discrete \& Computational Geometry
publication date: 2016-12-20T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5149/
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 52C17
Mathematics Subject Classification ID: 52C45
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 6666308
zbMATH Keywords: packing lemma
zbMATH Keywords: shallow packing lemma
zbMATH Keywords: set systems of finite VC-dimension
zbMATH Keywords: primal shatter function
zbMATH Keywords: Clarkson-Shor property
MaRDI profile type: Publication
OpenAlex ID: W2525451309
Wikidata QID: Q113905014
cites work: Q3503433
cites work: Q5306039
cites work: Using the doubling dimension to analyze the generalization of learning algorithms
cites work: A simple proof of the shallow packing lemma
cites work: Quasi-optimal range searching in spaces of finite VC-dimension
cites work: Applications of random sampling in computational geometry. II
cites work: Central limit theorems for empirical measures
cites work: Two Proofs for Shallow Packings
cites work: A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension
cites work: VC bounds on the cardinality of nearly orthogonal function classes
cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications
cites work: Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points
cites work: Q3010463
cites work: Relative \((p,\varepsilon )\)-approximations in geometry
cites work: \(\epsilon\)-nets and simplex range queries
cites work: Improved bounds on the sample complexity of learning
cites work: Constructive Discrepancy Minimization by Walking on the Edges
cites work: Reporting points in halfspaces
cites work: Tight upper bounds for the discrepancy of half-spaces
cites work: Geometric discrepancy. An illustrated guide
cites work: Q4530626
cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
cites work: Convergence of stochastic processes
cites work: On the density of families of sets
cites work: Q4325546
cites work: A combinatorial problem; stability and order for models and theories in infinitary languages
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
DOI: 10.1007/S00454-016-9824-0
description: scientific article; zbMATH DE number 6666308