Estimating the Penalty Level of ℓ1\ell_{1}-minimization via Two Gaussian Approximation Methods

preprint2020arXivOpen access

Abstract

In this paper, we aim to give a theoretical approximation for the penalty level of ℓ1\ell_{1}-regularization problems. This can save much time in practice compared with the traditional methods, such as cross-validation. To achieve this goal, we develop two Gaussian approximation methods, which are based on a moderate deviation theorem and Stein's method respectively. Both of them give efficient approximations and have good performances in simulations. We apply the two Gaussian approximation methods into three types of ultra-high dimensional ℓ1\ell_{1} penalized regressions: lasso, square-root lasso, and weighted ℓ1\ell_{1} penalized Poisson regression. The numerical results indicate that our two ways to estimate the penalty levels achieve high computational efficiency. Besides, our prediction errors outperform that based on the 10-fold cross-validation.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.