---
title: Inverse Star Discrepancy Insights
url: https://www.emergentmind.com/topics/inverse-of-the-star-discrepancy
type: topic
---

# Inverse Star Discrepancy Insights

The inverse of the star discrepancy, denoted $N^*(d, \varepsilon)$, is the minimum number of points in $[0,1]^d$ required to form a set whose star discrepancy does not exceed a specified threshold $\varepsilon$. This concept is fundamental in discrepancy theory, quasi-Monte Carlo methods, and high-dimensional numerical integration, serving as a quantitative gauge of how efficiently uniformity can be achieved. The sharp dependence of $N^*(d, \varepsilon)$ on both $d$ and $\varepsilon$ encapsulates major open questions in the constructive and algorithmic aspects of low-discrepancy point set generation.

## 1. Formal Definition and Problem Statement

Given $P_N = \{x_1, ..., x_N\} \subset [0,1]^d$, the star discrepancy is
\[
D_N^*(P_N) = \sup_{b \in [0,1]^d} \left| \frac{1}{N} \#\{x_n \in [0,b)\} - \prod_{i=1}^d b_i \right|.
\]
Define the minimal star discrepancy for $N$-point sets,
\[
D^*(N, d) = \inf_{P_N \subset [0,1]^d,\,|P_N|=N} D_N^*(P_N),
\]
and the inverse star discrepancy,
\[
N^*(\varepsilon, d) = \min \left\{ N \in \mathbb{N} : D^*(N, d) \leq \varepsilon \right\}.
\]
The central problem is to determine, for fixed $d$ and $\varepsilon$, the asymptotic behavior and explicit constants in $N^*(d, \varepsilon)$ or equivalently, in bounds for $D^*(N,d)$.

## 2. Classical Bounds and Existential Results

The landmark theorem of Heinrich, Novak, Wasilkowski, and Woźniakowski established that for some absolute constant $C$,
\[
N^*(d, \varepsilon) \leq C^2 d \varepsilon^{-2},
\]
with the matching star discrepancy bound $D^*(N, d) \leq C \sqrt{d/N}$ holding for some $N$ and $d$ [1211.2511], [1407.4208], [1211.1058]. The proof utilizes the probabilistic method: uniform random sampling in $[0,1]^d$ ensures, via concentration inequalities and bracketing arguments, that with positive probability a random set attains the required discrepancy bound.

Subsequent refinements (Aistleitner, Gnewuch, Pillichshammer, Wohlmuth) have iteratively reduced the best-known explicit constant $C$. As of 2024, the leading constant is $c=2.4631837$, yielding
\[
N^*(\varepsilon, d) \leq 6.0665\, d\, \varepsilon^{-2}
\]
via explicit probabilistic bracketing constructions involving scrambled Halton sequences and $p$-adic discrepancy theory [2411.10363].

## 3. Lower Bounds and Exponent Gaps

Lower bounds trace primarily to results by Hinrichs and Steinerberger, who applied VC-theory and geometric arguments to yield
\[
N^*(d, \varepsilon) \gtrsim c \frac{d}{\varepsilon},
\]
with $c = 1/40$ (or improved to $1/(9e)$ with refinements) [2207.13471]. These results show that $d/\varepsilon$-growth is unavoidable in the minimal sample size needed for star discrepancy $\leq \varepsilon$, but a polynomial gap persists between the $d/\varepsilon$ lower bound and the $d/\varepsilon^2$ upper bound. The correct exponent of $\varepsilon$ in $N^*(d, \varepsilon)$ remains open.

Random point set lower bounds (Doerr) show that with overwhelming probability,
\[
D^*(P) \geq K \sqrt{d/N},
\]
implying that, for the majority of sets, $N^*(d,\varepsilon)$ cannot be smaller than $\Omega(d/\varepsilon^2)$ [1210.0572].

## 4. Constructive and Algorithmic Advances

Most existential results are non-constructive and do not directly yield point sets. Several algorithmic frameworks have enabled construction of near-optimal sets:

- **Threshold-accepting and genetic algorithms:** Randomized and evolutionary techniques have been developed for explicit pointset optimization, notably for generalized Halton and scrambled digital nets, achieving tight upper bounds for moderate $d$ and $\varepsilon$ [1304.1978].
- **Lacunary sequences and double infinite matrices:** Lacunary and hybrid constructions reduce bit or computational cost while nearly achieving the optimal rate, up to logarithmic terms [1408.2220], [1408.2216].
- **Component-by-component and bracketing number methods:** Recent breakthroughs in bracketing number estimates and interval covers have further improved algorithmically achievable constants, approaching the theoretical best [2411.10363].

Yet, no known deterministic and polynomial-time construction achieves the $O(d\varepsilon^{-2})$ rate without extra logarithmic or polynomial factors.

## 5. Explicit Probabilistic/Structural Constructions

Product-structured sets and hybrid schemes have been proposed to narrow the existence–construction gap:
- **Multiset unions of (digitally shifted) Korobov polynomial lattice point sets:** Both probabilistic and deterministic parameter selection yield star discrepancy,
  \[
  D^*(P) \leq C \frac{d \log N}{\sqrt{N}},
  \]
  with $N^*(\varepsilon,d) = O\bigl((d \log (d/\varepsilon)/\varepsilon)^2\bigr)$ [2601.16571], [2509.15877].
- **Jittered sampling:** Stratified (grid-based) random sampling achieves
  \[
  N^*(\varepsilon,d) = O\bigl((d/\varepsilon^2)^{d/(d+1)}\bigr),
  \]
  an asymptotic improvement in the exponent of $\varepsilon$ for high $d$ and small $\varepsilon$ relative to classical bounds [1510.00251].

These approaches fundamentally reduce the continuous search space for candidate pointsets to finite, structured families, though most still require probabilistic existence arguments or computational post-selection.

## 6. Practical Implications and Applications

Reducing $N^*(d, \varepsilon)$ is central to quasi-Monte Carlo integration, where small star discrepancy guarantees low worst-case integration error by the Koksma–Hlawka inequality. In practice, recent constant improvements directly translate into computational savings in high-dimensional applications (e.g., QMC for PDEs with random input, machine learning).

Algorithmic advances allow, for modest $d$, either construction or stochastic identification of pointsets with nearly optimal $N^*(d, \varepsilon)$. However, NP-hardness of discrepancy computation remains a severe bottleneck for large $d$, and practical implementations must often resort to surrogate or heuristic evaluations [1304.1978], [1211.1058].

## 7. Open Directions and Conjectures

Key unresolved problems include:
- Determining whether $N^*(d, \varepsilon)$ can be achieved with linear dependence in both $d$ and $1/\varepsilon$, thus closing the exponent gap [2207.13471].
- Providing an explicit, deterministic, and polynomial-time construction achieving $N^*(d, \varepsilon) = O(d\varepsilon^{-2})$ without logarithmic inflation [1407.4208], [2411.10363].
- Extending bounds to weighted or non-axis-aligned discrepancy, and tailored constructions adapted to tractable function classes in applied QMC.
- Further reduction of the subleading constants, especially in the leading regime for practical dimensions ($d \lesssim 20$).

The field continues to balance between fundamental probabilistic existence results and ongoing pursuit of explicit, computationally feasible constructions. The asymptotic behavior $N^*(d,\varepsilon) \sim d\,\varepsilon^{-\gamma}$ with $1 < \gamma < 2$ remains a principal focus of theoretical and applied discrepancy research.

Source: https://www.emergentmind.com/topics/inverse-of-the-star-discrepancy