Some upper bounds for the rate of convergence of penalized likelihood context tree estimators

Details Some upper bounds for the rate of convergence of penalized likelihood context tree estimators Some upper bounds for the rate of convergence of penalized likelihood context tree estimators

2007-01-28

arxiv.org/abs/math/0701810v5

Mathematics

Statistics Theory

13 pages, some changes in the organization of the paper from previous version

Scientific paper

We find upper bounds for the probability of underestimation and overestimation errors in penalized likelihood context tree estimation. The bounds are explicit and applies to processes of not necessarily finite memory. We allow for general penalizing terms and we give conditions over the maximal depth of the estimated trees in order to get strongly consistent estimates. This generalizes previous results obtained in the case of estimation of the order of a Markov chain.

Affiliated with

Also associated with

No associations

Rating

Some upper bounds for the rate of convergence of penalized likelihood context tree estimators 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 Some upper bounds for the rate of convergence of penalized likelihood context tree estimators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some upper bounds for the rate of convergence of penalized likelihood context tree estimators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-197218