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

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmic Learning Theory

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

Dietrich Braess, Jürgen Forster, Tomas Sauer, Hans-Ulrich Simon

Journal Title: Algorithmic Learning Theory

Date: 2002

For further information about this item go to:

http://link.springer.de/link/service/series/0558/bibs/2533/25330380.htm

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12