Cramer-Rao Bound for Estimation After Model Selection and Its Application to Sparse Vector Estimation

被引:10
作者
Meir, Elad [1 ]
Routtenberg, Tirza [1 ]
机构
[1] Ben Gurion Univ Negev, Sch Elect & Comp Engn, IL-84105 Beer Sheva, Israel
基金
以色列科学基金会;
关键词
Estimation; Analytical models; Predictive models; Symmetric matrices; Signal processing; Probability density function; Force; Non-Bayesian selective estimation; selective Cramé r-Rao bound; estimation after model selection; coherence estimation; sparse vector estimation; PARAMETER-ESTIMATION; CONFIDENCE-INTERVALS; FISHER INFORMATION; REGRESSION; INFERENCE; PERFORMANCE; CRITERIA; MATRIX;
D O I
10.1109/TSP.2021.3068356
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In many practical parameter estimation problems, such as coefficient estimation of polynomial regression, the true model is unknown and thus, a model selection step is performed prior to estimation. The data-based model selection step affects the subsequent estimation. In particular, the oracle Cramer-Rao bound (CRB), which is based on knowledge of the true model, is inappropriate for post-model-selection performance analysis and system design outside the asymptotic region. In this paper, we investigate post-model-selection parameter estimation of a vector with an unknown support set, where this support set represents the model. We analyze the estimation performance of coherent estimators that force unselected parameters to zero. We use the mean-squared-selected-error (MSSE) criterion and introduce the concept of selective unbiasedness in the sense of Lehmann unbiasedness. We derive a non-Bayesian Cramer-Rao-type bound on the MSSE and on the mean-squared-error (MSE) of any coherent estimator with a specific selective-bias function in the Lehmann sense. We implement the selective CRB for the special case of sparse vector estimation with an unknown support set. Finally, we demonstrate in simulations that the proposed selective CRB is an informative lower bound on the performance of the maximum selected likelihood estimator for a general linear model with the generalized information criterion and for sparse vector estimation with one step thresholding. It is shown that for these cases the selective CRB outperforms the oracle CRB and Sando-Mitra-Stoica CRB (SMS-CRB) [1].
引用
收藏
页码:2284 / 2301
页数:18
相关论文
共 77 条
[1]   NEW LOOK AT STATISTICAL-MODEL IDENTIFICATION [J].
AKAIKE, H .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (06) :716-723
[2]  
[Anonymous], 2013, Finite Frames
[3]  
[Anonymous], 2012, Introduction to compressed sensing
[4]   Threshold region performance of maximum likelihood direction of arrival estimators [J].
Athley, F .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (04) :1359-1373
[5]   Asymptotic Achievability of the Cramer-Rao Bound for Noisy Compressive Sampling [J].
Babadi, Behtash ;
Kalouptsidis, Nicholas ;
Tarokh, Vahid .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (03) :1233-1236
[6]   LOCALLY BEST UNBIASED ESTIMATES [J].
BARANKIN, EW .
ANNALS OF MATHEMATICAL STATISTICS, 1949, 20 (04) :477-501
[7]   Optimal Two-Stage Search for Sparse Targets Using Convex Criteria [J].
Bashan, Eran ;
Raich, Raviv ;
Hero, Alfred O. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (11) :5389-5402
[8]   The Cramr-Rao Bound for Estimating a Sparse Parameter Vector [J].
Ben-Haim, Zvika ;
Eldar, Yonina C. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (06) :3384-3389
[9]   False discovery rate-adjusted multiple confidence intervals for selected parameters [J].
Benjamini, Y ;
Yekutieli, D .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2005, 100 (469) :71-81
[10]   Empirical Non-Parametric Estimation of the Fisher Information [J].
Berisha, Visar ;
Hero, Alfred O. .
IEEE SIGNAL PROCESSING LETTERS, 2015, 22 (07) :988-992