How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution

Braess et al. "How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution." International Conference on Algorithmic Learning Theory, 2002. doi:10.1007/3-540-36169-3_30

[Braess et al. "How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution." International Conference on Algorithmic Learning Theory, 2002.](https://mlanthology.org/alt/2002/braess2002alt-achieve/) doi:10.1007/3-540-36169-3_30

@inproceedings{braess2002alt-achieve,
  title     = {{How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution}},
  author    = {Braess, Dietrich and Forster, Jürgen and Sauer, Tomas and Simon, Hans Ulrich},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2002},
  pages     = {380-394},
  doi       = {10.1007/3-540-36169-3_30},
  url       = {https://mlanthology.org/alt/2002/braess2002alt-achieve/}
}