The Risk-Unbiased Crér–Rao Bound for Non-Bayesian Multivariate Parameter Estimation

How accurately can one estimate a deterministic parameter subject to other unknown deterministic model nuisance parameters? The most popular answer to this question is given by the Crér–Rao bound (CRB). The main assumption behind the derivation of the CRB is local unbiased estimation of all model pa...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on signal processing Vol. 66; no. 18; p. 4920
Main Authors Bar, Shahar, Tabrikian, Joseph
Format Journal Article
LanguageEnglish
Published New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.01.2018
Subjects
Online AccessGet full text
ISSN1053-587X
1941-0476
DOI10.1109/TSP.2018.2863663

Cover

Loading…
More Information
Summary:How accurately can one estimate a deterministic parameter subject to other unknown deterministic model nuisance parameters? The most popular answer to this question is given by the Crér–Rao bound (CRB). The main assumption behind the derivation of the CRB is local unbiased estimation of all model parameters. The foundations of this paper rely on doubting this assumption. Generally, in multivariate parameter estimation, each parameter in its turn can be treated as a single parameter of interest, whereas the other model parameters are treated as nuisance, as their misknowledge interferes with the estimation of the parameter of interest. This approach is utilized in this paper to provide a fresh look at deterministic parameter estimation. A new Crér–Rao (CR) type bound is derived without assuming unbiased estimation of the nuisance parameters. Rather than that, we apply Lehmann's concept of unbiasedness for a risk that measures the distance between the estimator and the locally best unbiased estimator, which assumes perfect knowledge of the nuisance parameters. The proposed risk-unbiased CRB (RUCRB) is proven to be asymptotically attainable by the maximum likelihood estimator while being tighter than the conventional CRB. Furthermore, simulations verify the asymptotic achievability of the RUCRB by the maximum likelihood estimator for an array processing problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2018.2863663