English

Sharp Lower Bound on the Minimax Risk for Multinomial Uniformity Testing via a Conditional Central Limit Theorem

Statistics Theory 2026-07-06 v1 Information Theory

Abstract

We study minimax goodness-of-fit testing for uniformity from nn multinomial observations over NN categories against p\ell_p departures of size ϵn\epsilon_n. Writing un:=ϵn2nN3/22/p/2u_n:=\epsilon_n^2 n\,N^{3/2-2/p}/\sqrt{2} for the associated signal-to-noise ratio, we focus on the intermediate regime N=o(n2)N=o(n^2) with unu(0,)u_n\to u^*\in(0,\infty), in which the minimax risk converges to a nontrivial constant. In the Poissonized version of the problem this constant equals 2Φ(u/2)2\Phi(-u^*/2) \cite{Kipnis2025minimax}, yielding an upper bound on the multinomial minimax risk. Here we prove the matching lower bound. The key step is a conditional central limit theorem for weighted sums under a Poisson mixture prior, conditioned on the total count. Together with the upper bound in \cite{Kipnis2025minimax}, this gives an exact sharp-constant characterization of the multinomial minimax risk in the intermediate regime.

Cite

@article{arxiv.2607.05223,
  title  = {Sharp Lower Bound on the Minimax Risk for Multinomial Uniformity Testing via a Conditional Central Limit Theorem},
  author = {Alon Kipnis},
  journal= {arXiv preprint arXiv:2607.05223},
  year   = {2026}
}

Comments

Companion note to doi: 10.1109/TIT.2025.3646804