Improving a constant in high-dimensional discrepancy estimates
From MaRDI portal
Abstract: For all and there exist sequences in such that the star-discrepancy of these points can be bounded by D_N^*(z_1,ldots,z_N) leq c frac{sqrt{s}}{sqrt{N}}. The best known value for the constant is as has been calculated by Aistleitner in cite{Ais11}. In this paper we improve the bound to .
Recommendations
- An improved estimator of dimension and some comments on providing confidence intervals
- On parameter estimation for high dimensional errors-in-variables models
- Improved Estimation of Generalized Variance and Precision
- Unified improvements in estimation of a normal covariance matrix in high and low dimensions
- Testing constancy of conditional variance in high dimension
- Improving Hoeffding's inequality using higher moments information
- Estimating the error variance in a high-dimensional linear model
- Improvement of some multidimensional estimates by reduction of dimensionality
Cites work
- Analyzing randomized search heuristics: tools from probability theory
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Covering numbers, dyadic chaining and discrepancy
- How high is high-dimensional?
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- The inverse of the star-discrepancy depends linearly on the dimension
Cited in
(12)- Polynomial discrepancy of sequences
- On the inverse of the discrepancy for infinite dimensional infinite sequences
- On the arrangement of point sets in the unit interval
- On the star discrepancy of sequences in the unit interval
- An elementary proof of a lower bound for the inverse of the star discrepancy
- An improved bound for the star discrepancy of sequences in the unit interval
- Improvements on the star discrepancy of (t,s)-sequences
- The hunting of the bump
- A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
- The curse of dimensionality for the \(L_p\)-discrepancy with finite \(p\)
- Covering numbers, dyadic chaining and discrepancy
- Optimal Polynomial Tractability Exponents for the Inverse Star Discrepancy
This page was built for publication: Improving a constant in high-dimensional discrepancy estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985676)