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

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

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

本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要讨论高维线性回归的变量选择与渐近理论,属于高维统计方法研究,未涉及所给领域细分中的因果推断、面板、时间序列、金融等方向,故不选择任何细分。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Lina Hidmi
Asaf Weinstein

AMP框架下基于Lasso统计量的经验贝叶斯变量选择

研究问题
摘要称,本文研究在高维线性回归的AMP渐近框架下,如何在以Lasso估计的某个一元函数对变量排序的这类选择程序中,找到在I类错误与功效权衡上最优的变量选择方法。
方法与思路
作者提出将Lasso估计的渐近模型归约为两组模型(two-groups model),据此构造基于局部错误发现率估计的经验贝叶斯选择程序;并在AMP框架下扩展已有结果,给出该程序I类错误与功效渐近权衡曲线的精确预测,同时证明最优λ为渐近均方误差的最小化者,故建议用交叉验证估计λ。
材料陈述的贡献
摘要称其贡献在于:在给定排序类中刻画最优选择程序,给出该经验贝叶斯程序渐近权衡的精确预测,证明最优正则化参数为渐近均方误差最小化者,并通过不同设定下的数值研究确认功效提升可能相当可观。
阅读关注点
阅读全文时应核对:两组模型归约所依赖的渐近条件与识别假设、AMP精确预测的适用前提、最优λ等价于渐近均方误差最小化者的证明条件,以及交叉验证估计λ的实际表现与数值实验设定。
阅读边界
仅凭摘要无法判断证明细节、假设强度、有限样本表现与相对已有方法的实际优劣;摘要未说明具体模拟设计、数据生成方式与数值结果数值。该文为arXiv预印本,未经同行评审验证,不能据此声称已被期刊接收。

原文摘要

The Lasso is one of the most ubiquitous methods for variable selection in high-dimensional linear regression and has been studied extensively under different regimes. In a particular asymptotic setup entailing $n/p\to \text{constant}$, an i.i.d.~Gaussian $X$ matrix and linear sparsity, \citet{su2017false} analyzed the Lasso selection path and presented negative results, showing that maintaining small levels of the false discovery proportion comes at a substantial cost in power. Followup work by \citet{wang2020bridge} used the same framework to study the tradeoff between type I error and power for thresholded-Lasso selection, which ranks the variables based on the magnitude of the Lasso estimate instead of the order of appearance on the Lasso path, and demonstrated that significant improvements are possible if the regularization parameter is chosen appropriately. We take this line of research a step further, seeking an {\em optimal} selection procedure in the AMP framework among procedures that order the variables by some univariate function of the Lasso estimate at a fixed value $λ$ of the regularization term. Observing that the model for the Lasso estimates effectively reduces asymptotically to a version of the well-studied two-groups model, we propose an empirical Bayes variable selection procedure based on an estimate of the local false discovery rate. We extend existing results in the AMP framework to obtain exact predictions for the curve describing the asymptotic tradeoff between type I error and power of this procedure. Additionally, we prove that the optimal $λ$ is the minimizer of the asymptotic mean squared error, and accordingly propose to use the empirical Bayes procedure with $λ$ estimated by cross-validation. The theoretical predictions imply that the gains in power can be substantial, and we confirm this by numerical studies under different settings.

笔记与分组
相关领域论文