Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong

Details Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong

2010-02-03

arxiv.org/abs/1002.0757v1

Computer Science

Information Theory

Scientific paper

We analyse the prequential plug-in codes relative to one-parameter exponential families M. We show that if data are sampled i.i.d. from some distribution outside M, then the redundancy of any plug-in prequential code grows at rate larger than 1/2 ln(n) in the worst case. This means that plug-in codes, such as the Rissanen-Dawid ML code, may behave inferior to other important universal codes such as the 2-part MDL, Shtarkov and Bayes codes, for which the redundancy is always 1/2 ln(n) + O(1). However, we also show that a slight modification of the ML plug-in code, "almost" in the model, does achieve the optimal redundancy even if the the true distribution is outside M.

Affiliated with

Also associated with

No associations

Rating

Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602221