Cramer-Rao Bound for Constrained Parameter Estimation Using Lehmann-Unbiasedness
Eyal Nitzan, Tirza Routtenberg, and Joseph Tabrikian

TL;DR
This paper introduces a new, less restrictive unbiasedness concept called C-unbiasedness for constrained parameter estimation, along with a derived Lehmann-unbiased CCRB (LU-CCRB) that provides a more accurate lower bound on estimation error in non-asymptotic scenarios.
Contribution
The paper proposes C-unbiasedness based on Lehmann-unbiasedness with weighted MSE, and derives the LU-CCRB, a more informative lower bound applicable in non-asymptotic constrained estimation.
Findings
LU-CCRB is a valid lower bound where CCRB is not
C-unbiasedness is less restrictive than CCRB unbiasedness
Simulations show LU-CCRB outperforms CCRB in non-asymptotic cases
Abstract
The constrained Cramer-Rao bound (CCRB) is a lower bound on the mean-squared-error (MSE) of estimators that satisfy some unbiasedness conditions. Although the CCRB unbiasedness conditions are satisfied asymptotically by the constrained maximum likelihood (CML) estimator, in the non-asymptotic region these conditions are usually too strict and the commonly-used estimators, such as the CML estimator, do not satisfy them. Therefore, the CCRB may not be a lower bound on the MSE matrix of such estimators. In this paper, we propose a new definition for unbiasedness under constraints, denoted by C-unbiasedness, which is based on using Lehmann-unbiasedness with a weighted MSE (WMSE) risk and taking into account the parametric constraints. In addition to C-unbiasedness, a Cramer-Rao-type bound on the WMSE of C-unbiased estimators, denoted as Lehmann-unbiased CCRB (LU-CCRB), is derived. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
