Nearly Minimax Discrete Distribution Estimation in Kullback-Leibler Divergence with High Probability

We consider the fundamental problem of estimating a discrete distribution on a domain of size K with high probability in Kullback-Leibler divergence. We provide upper and lower bounds on the minimax estimation rate, which show that the optimal rate is between big(K + ln(K)ln(1/δ)big) /n and big(Klnln(K) + ln(K)ln(1/δ)big) /n at error probability δ and sample size n, which pins down the rate up to the doubly logarithmic factor ln ln K that multiplies K. Our upper bound uses techniques from online learning to construct a novel estimator via online-to-batch conversion. Perhaps surprisingly, the tail behavior of the minimax rate is worse than for the squared total variation and squared Hellinger distance, for which it is big(K + ln(1/δ)big) /n, i.e. without the ln K multiplying ln (1/δ). As a consequence, we cannot obtain a fully tight lower bound from the usual reduction to these smaller distances. Moreover, we show that this lower bound cannot be achieved by the standard lower bound approach based on a reduction to hypothesis testing, and instead we need to introduce a new reduction to what we call weak hypothesis testing. We investigate the source of the gap with other divergences further in refined results, which show that the total variation rate is achievable for Kullback-Leibler divergence after all (in fact by he maximum likelihood estimator) if we rule out outcome probabilities smaller than O(ln(K/δ) / n), which is a vanishing set as n increases for fixed K and δ. This explains why minimax Kullback-Leibler estimation is more difficult than asymptotic estimation.