Bounds on achievable convergence rates of parameter estimators via universal coding

DOI10.1109/18.335954zbMath0810.62010OpenAlexW2159605735MaRDI QIDQ4324184

Neri Merhav

Publication date: 1 March 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.335954

zbMATH Keywords

lower boundsBayesian estimationfastest achievable convergence rateparametric class of finite-alphabet information sourcesuniversal lossless code

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Bayesian inference (62F15) Statistical aspects of information-theoretic topics (62B10) Source coding (94A29)

This page was built for publication: Bounds on achievable convergence rates of parameter estimators via universal coding