By Topic

Estimating a binomial parameter with finite memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

This article treats the asymptotic theory of estimating a binomial parameterpwith time-invariant finite memory. The approach taken to this problem is as follows. A decision rule is a pair(t,a)in whichtfixes the transition function of a finite automaton, andais a vector of estimates ofp. Attention is restricted to automata whose transition functions allow transitions only between adjacent states. Rules(t,a)for whichtsatisfies this restriction are termed tridiagonal. For the class of prior distributions on [0,1] which have continuous density functions, we study the performance of a corresponding class of tridiagonal rules{ (t^{ast},a^{ast}) }relative to quadratic loss functions. These rules display sensitivity to the shape of the prior, and have the advantage that the Bayes estimatea^{ast}(givent^{ast}) is easily computed. Within the class of all tridiagonal rules, a particular rule(t^{ast},a^{ast})is shown, for memory size up to 30, to be locally admissible and minimax as well as locally Bayes with respect to the uniform prior.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 5 )