How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
| Authored By: | Dietrich Braess, Jürgen Forster, Tomas Sauer and Hans U. Simon |
| Paper Title: | How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution |
| Book/Journal Title: | Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany November 2002, Proceedings |
| Vol. 2533 | |
| Publisher: | Springer |
| Publication Date: | 2002 |
| Pages: | 380-394 |
BibTeX Record:
@InProceedings{bfss-amekduf-02,
booktitle = "Algorithmic Learning Theory, 13th International Conference, ALT 2002, L{"u}beck, Germany November 2002, Proceedings",
title = "How to Achieve Minimax Expected {K}ullback-{L}eibler Distance from an Unknown Finite Distribution",
author = "Dietrich Braess and J{"u}rgen Forster and Tomas Sauer and Hans U. Simon",
series = "Lecture Notes in Artificial Intelligence",
volume = "2533",
publisher = "Springer",
year = "2002",
pages = "380--394",
}
Hide BibTeX Record
@InProceedings{bfss-amekduf-02,
booktitle = "Algorithmic Learning Theory, 13th International Conference, ALT 2002, L{"u}beck, Germany November 2002, Proceedings",
title = "How to Achieve Minimax Expected {K}ullback-{L}eibler Distance from an Unknown Finite Distribution",
author = "Dietrich Braess and J{"u}rgen Forster and Tomas Sauer and Hans U. Simon",
series = "Lecture Notes in Artificial Intelligence",
volume = "2533",
publisher = "Springer",
year = "2002",
pages = "380--394",
}