SCIENCE@home

Redundancy of exchangeable estimators

N. Santhanam,A. Sarwate,J. Woo

Published 2010 in Allerton Conference on Communication, Control, and Computing

ABSTRACT

Exchangeable random partition processes provide a framework for statistical inference in large alphabet scenarios from a Bayesian perspective. On the other hand, the notion of the pattern of a sequence provides a framework for data compression in large alphabet scenarios. Owing to the relationship between data compression and parameter estimation, both these approaches are related. Motivated by the possibilities of cross-fertilization, we examine the redundancy of Bayes estimators (specifically those that emerge from the “Chinese restaurant processes”) in the setting of unknown discrete alphabets from a universal compression point of view. In particular, we identify relations between alphabet sizes and sample sizes where the redundancy is small- and hence, characterize useful regimes for these estimators.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-46 of 46 references · Page 1 of 1

CITED BY