MAP model selection in Gaussian regression

被引:18
|
作者
Abramovich, Felix [1 ]
Grinshtein, Vadim [2 ]
机构
[1] Tel Aviv Univ, Dept Stat & Operat Res, IL-69978 Tel Aviv, Israel
[2] Open Univ Israel, Dept Math, IL-43107 Raanana, Israel
来源
基金
以色列科学基金会;
关键词
Adaptivity; complexity penalty; Gaussian linear regression; maximum a posteriori rule; minimax estimation; model selection; oracle inequality; sparsity; STATISTICAL ESTIMATION; BAYESIAN TESTIMATION;
D O I
10.1214/10-EJS573
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We consider a Bayesian approach to model selection in Gaussian linear regression, where the number of predictors might be much larger than the number of observations. From a frequentist view, the proposed procedure results in the penalized least squares estimation with a complexity penalty associated with a prior on the model size. We investigate the optimality properties of the resulting model selector. We establish the oracle inequality and specify conditions on the prior that imply its asymptotic minimaxity within a wider range of sparse and dense settings for "nearly-orthogonal" and "multicollinear" designs.
引用
收藏
页码:932 / 949
页数:18
相关论文
共 50 条