跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要讨论通用 lasso 计算与收缩理论,未提供因果、金融预测或其他所列细分方向的直接依据。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Bala Rajaratnam
Steven Roberts
Doug Sparks
Onkar Dalal

Lasso 回归:通过 Gibbs 抽样的极限实现估计与收缩

研究问题
当回归系数不够稀疏且预测变量高度共线时,如何更有效地计算 lasso 解,并解释估计量所体现的收缩机制?
方法与思路
作者从 Bayesian lasso 的极限形式构造确定性算法,分析其收敛性及与其他算法的联系,并用模拟和真实数据展示表现。
材料陈述的贡献
摘要称算法收敛到 lasso 解,所得表示揭示同时存在两类收缩;在非稀疏、高共线设定下可较坐标算法明显提速。
阅读关注点
应核对极限操作、迭代更新和收敛条件,区分解的性质与计算速度,并检查比较算法的实现、停止准则和数据设定。
阅读边界
仅据 Crossref 摘要;具体算法、收敛条件及提速数值未说明,所述计算优势限于摘要强调的设定,不能视为普遍优势。

原文摘要

Summary The application of the lasso is espoused in high dimensional settings where only a small number of the regression coefficients are believed to be non-zero (i.e. the solution is sparse). Moreover, statistical properties of high dimensional lasso estimators are often proved under the assumption that the correlation between the predictors is bounded. In this vein, co-ordinatewise methods, which are the most common means of computing the lasso solution, naturally work well in the presence of low-to-moderate multicollinearity. The computational speed of co-ordinatewise algorithms, although excellent for sparse and low-to-moderate multicollinearity settings, degrades as sparsity decreases and multicollinearity increases. Though lack of sparsity and high multicollinearity can be quite common in contemporary applications, model selection is still a necessity in such settings. Motivated by the limitations of co-ordinatewise algorithms in such ‘non-sparse’ and ‘high multicollinearity’ settings, we propose the novel ‘deterministic Bayesian lasso’ algorithm for computing the lasso solution. This algorithm is developed by considering a limiting version of the Bayesian lasso. In contrast with co-ordinatewise algorithms, the performance of the deterministic Bayesian lasso improves as sparsity decreases and multicollinearity increases. Importantly, in non-sparse and high multicollinearity settings the algorithm proposed can offer substantial increases in computational speed over co-ordinatewise algorithms. A rigorous theoretical analysis demonstrates that the deterministic Bayesian lasso algorithm converges to the lasso solution and it leads to a representation of the lasso estimator which shows how it achieves both l1- and l2-types of shrinkage simultaneously. Connections between the deterministic Bayesian lasso and other algorithms are also provided. The benefits of the deterministic Bayesian lasso algorithm are then illustrated on simulated and real data.

笔记与分组
相关领域论文