By Topic

Bounds on achievable convergence rates of parameter estimators via universal coding

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
$33 $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)
N. Merhav ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel

Lower bounds on achievable convergence rates of parameter estimators towards the true parameter, are derived via universal coding considerations. It is shown that for a parametric class of sources, if there exists a universal lossless code whose redundancy decays sufficiently rapidly, then it induces a limitation on the fastest achievable convergence rate of any parameter estimator, at any value of the true parameter, with a possible exception of a vanishingly small subset of parameter values

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994