Estimation of a sparse group of sparse vectors
From MaRDI portal
Abstract: We consider a problem of estimating a sparse group of sparse normal mean vectors. The proposed approach is based on penalized likelihood estimation with complexity penalties on the number of nonzero mean vectors and the numbers of their "significant" components, and can be performed by a computationally fast algorithm. The resulting estimators are developed within Bayesian framework and can be viewed as MAP estimators. We establish their adaptive minimaxity over a wide range of sparse and dense settings. The presented short simulation study demonstrates the efficiency of the proposed approach that successfully competes with the recently developed sparse group lasso estimator.
Recommendations
- Adaptive estimation of the sparsity in the Gaussian vector model
- Reconstruction of sparse vectors in white Gaussian noise
- Asymptotically minimax empirical Bayes estimation of a sparse normal mean vector
- Nonparametric empirical Bayes and compound decision approaches to estimation of a high-dimensional vector of normal means
- The horseshoe estimator for sparse signals
Cited in
(5)
This page was built for publication: Estimation of a sparse group of sparse vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411039)
