arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.03464stat.MEmath.STstat.TH
收藏

贝叶斯 $L_{\frac{1}{2}}$ 回归

Bayesian $L_{\frac{1}{2}}$ regression

Xiongwen Ke, Yanan Fan

AI总结:

针对高维下贝叶斯 Bridge 回归计算成本高的问题,提出闭式 $L_{\frac{1}{2}}$ 先验及高效部分坍缩 Gibbs 采样与坐标下降算法,并证明其收敛性与 oracle 性质。

摘要:

众所周知,与传统 LASSO 相比,Bridge regression 具有更优越的理论性质。然而,其贝叶斯对应方法基于指数幂先验的当前潜变量表示,在较高维度下计算成本很高。在本文中,我们证明了指数幂先验对于 $α=(\frac{1}{2})^γ, γ\in \{1, 2,\ldots\}$ 具有闭式正态尺度混合分解。我们将这类先验简称为 $L_{\frac{1}{2}}$ 先验。我们开发了一种使用 $L_{\frac{1}{2}}$ 先验进行计算的高效部分坍缩 Gibbs sampling 方案,并研究了当 $p>n$ 时的理论性质。此外,我们引入了一种受完全贝叶斯公式启发的不可分 Bridge 惩罚函数,以及一种新颖且高效的坐标下降算法。我们证明了该算法的收敛性,并表明我们的优化算法得到的局部极小值具有 oracle 性质。最后,进行了模拟研究以说明新算法的性能。本文的补充材料可在线获取。

英文摘要:

It is well known that Bridge regression enjoys superior theoretical properties when compared to traditional LASSO. However, the current latent variable representation of its Bayesian counterpart, based on the exponential power prior, is computationally expensive in higher dimensions. In this paper, we show that the exponential power prior has a closed form scale mixture of normal decomposition for $α=(\frac{1}{2})^γ, γ\in \{1, 2,\ldots\}$. We call these types of priors $L_{\frac{1}{2}}$ prior for short. We develop an efficient partially collapsed Gibbs sampling scheme for computation using the $L_{\frac{1}{2}}$ prior and study theoretical properties when $p>n$. In addition, we introduce a non-separable Bridge penalty function inspired by the fully Bayesian formulation and a novel, efficient coordinate descent algorithm. We prove the algorithm's convergence and show that the local minimizer from our optimisation algorithm has an oracle property. Finally, simulation studies were carried out to illustrate the performance of the new algorithms. Supplementary materials for this article are available online.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑