How to achieve minimax expected Kullback-Leibler distance from an unknown finite distribution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2533, Issue , 2002, Pages 380-394

  Braess, Dietrich ^a   Forster, Jürgen ^a   Sauer, Tomas ^b   Simon, Hans U ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYMPTOTICS; BAYES ERROR; FINITE DISTRIBUTION; KULLBACK LEIBLER DIVERGENCE; KULLBACK-LEIBLER DISTANCE; LOWER BOUNDS; ONE-RULE; PARTIAL INFORMATION;

INFORMATION THEORY;

EID: 34547636257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36169-3_30     Document Type: Conference Paper

References (10)

1. T. M. Cover. Admissibility properties of Gilbert’s encoding for unknown source probabilities. IEEE Transactions on Information Theory, 18:216–217, 1971.
2. Jürgen Forster and Manfred Warmuth. Relative expected instantaneous loss bounds. Journal of Computer and System Sciences. To appear.
3. J¨urgen Forster and Manfred Warmuth. Relative expected instantaneous loss bounds. In Proceedings of the 13th Annual Conference on Computational Learning Theory, pages 90–99. Morgan Kaufmann, 2000.
4. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics. Addison Wesley, 1989.
5. D. A. Huffman. A method for the construction of minimum redundancy codes. Proc.IRE, 40(10):1098–1101, 1952.
6. Rafail E. Krichevskiy. Universal Compression and Retrieval. Kluwer Academic Publishers, 1994.
7. Rafail E. Krichevskiy. Laplace’s law of succession and universal encoding. IEEE Transactions on Information Theory, 44(1):296–303, 1998.
8. Claude E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, 27:379–423,623–656, 1948.
9. Qun Xie and Andrew R. Barron. Minimax redundancy for the class of memoryless sources. IEEE Transactions on Information Theory, 43(2):646–657, 1997.
10. Qun Xie and Andrew R. Barron. Asymptotic minimax regret for data compression, gambling, and prediction. IEEE Transactions on Information Theory, 46(2):431–445, 2000