Learning discrete distributions with infinite support
Doron Cohen, Aryeh Kontorovich, Geoffrey Wolfer
Abstract
We present a novel approach to estimating discrete distributions with (potentially) infinite support in the total variation metric. In a departure from the established paradigm, we make no structural assumptions whatsoever on the sampling distribution. In such a setting, distribution-free risk bounds are impossible, and the best one could hope for is a fully empirical data-dependent bound. We derive precisely such bounds, and demonstrate that these are, in a well-defined sense, the best possible. Our main discovery is that the half-norm of the empirical distribution provides tight upper and lower estimates on the empirical risk. Furthermore, this quantity decays at a nearly optimal rate as a function of the true distribution. The optimality follows from a minimax result, of possible independent interest. Additional structural results are provided, including an exact Rademacher complexity calculation and apparently a first connection between the total variation risk and the missing mass.
BibTeX
@inproceedings{NEURIPS2020_291dbc18,
author = {Cohen, Doron and Kontorovich, Aryeh and Wolfer, Geoffrey},
booktitle = {Advances in Neural Information Processing Systems},
editor = {H. Larochelle and M. Ranzato and R. Hadsell and M.F. Balcan and H. Lin},
pages = {3942--3951},
publisher = {Curran Associates, Inc.},
title = {Learning discrete distributions with infinite support},
url = {https://proceedings.neurips.cc/paper_files/paper/2020/file/291dbc18539ba7e19b8abb7d85aa204e-Paper.pdf},
volume = {33},
year = {2020}
}