Tight upper bounds for the discrepancy of half-spaces
From MaRDI portal
Publication:1892434
DOI10.1007/BF02574066zbMATH Open0826.68127OpenAlexW2024611484MaRDI QIDQ1892434FDOQ1892434
Publication date: 2 July 1995
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131384
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- \(\epsilon\)-nets and simplex range queries
- Six Standard Deviations Suffice
- Discrepancy and approximations for bounded VC-dimension
- Quasi-optimal range searching in spaces of finite VC-dimension
- Scale-sensitive dimensions, uniform convergence, and learnability
- Geometric methods in the study of irregularities of distribution
- Roth's estimate of the discrepancy of integer sequences is nearly sharp
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- Boosting simple learners
- Discrepancy, chaining and subgaussian processes
- On discrepancy bounds via dual shatter function
- The structure and number of global roundings of a graph
- Typical rounding problems
- An elementary approach to lower bounds in geometric discrepancy
- A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension
- Two proofs for shallow packings
- One-Sided Epsilon-Approximants
- The determinant bound for discrepancy is almost tight
- Improved upper bounds for approximation by zonotopes
- Lower and upper bounds for the waists of different spaces
- Vapnik-Chervonenkis density in some theories without the independence property. I
- Title not available (Why is that?)
- Discrepancy and sparsity
- Non-independent randomized rounding and coloring
- Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks
- Uniform approximation rates and metric entropy of shallow neural networks
- A note on optimal point distributions in \([0,1)^{s}\)
- Extending the centerpoint theorem to multiple points
- The Communication Complexity of Distributed epsilon-Approximations
- Subsampling in Smoothed Range Spaces
- On the gap between hereditary discrepancy and the determinant lower bound
- Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) ๐ ๐
- A half-discrete Hilbert's inequality ๐ ๐
- On half-discrete Hilbert's inequality ๐ ๐
- A generalization of a half-discrete Hilbert's inequality ๐ ๐
- On a more accurate half-discrete Hilbert's inequality ๐ ๐
- A more accurate half-discrete Hilbert-type inequality in the whole plane and the reverses ๐ ๐
- On a half-discrete Mulholland-type inequality ๐ ๐
- An L1estimate for half-space discrepancy ๐ ๐
- Upper Bounds in Classical Discrepancy Theory ๐ ๐
- Upper Bounds in Discrepancy Theory ๐ ๐
This page was built for publication: Tight upper bounds for the discrepancy of half-spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892434)
