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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要主要是通用高维变量组选择及基因组应用,不直接属于所列经济或金融细分领域。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Damian Brzyski
Alexej Gossmann
Weijie Su
Małgorzata Bogdan

Group SLOPE:预测变量组的自适应选择

研究问题
在稀疏高维回归中,如何按组选择解释变量,控制组层面的错误发现,并适应未知稀疏程度与不同组间相关结构?
方法与思路
作者把SLOPE扩展为组级凸优化问题,提出求解算法与组错误发现率,并为正交组和独立非正交组设计调节序列。
材料陈述的贡献
摘要称正交组下可证明控制组错误发现率,并对各组解释响应方差比例的估计给出自适应渐近极小极大性质。
阅读关注点
应核对组大小与权重、错误发现的定义、正交条件及极小极大损失函数,并区分非正交情形的模拟证据与理论保证。
阅读边界
材料为稿件版本未注明的OpenAlex索引摘要;错误发现率保证明确依赖组间正交,不能据独立非正交组的模拟扩展到一般相关设计。

原文摘要

Damian Brzyskiab*, Alexej Gossmannc, Weijie Sud & Małgorzata Bogdanea Department of Epidemiology and Biostatistics, Indiana University, Bloomington, INb Institute of Mathematics, Jagiellonian University, Cracow, Polandc Bioinnovation PhD Program, Tulane University, New Orleans, LAd Department of Statistics, University of Pennsylvania, Philadelphia, PAe Institute of Mathematics, University of Wroclaw, Wroclaw, PolandCONTACT Damian Brzyski dbrzyski@iu.edu Department of Epidemiology and Biostatistics, Indiana University, Bloomington, IN 47405Color versions of one or more of the figures in the article can be found online at www.tandfonline.com/r/JASA.Supplementary materials for this article are available online. Please go to www.tandfonline.com/r/JASA.ABSTRACTSorted L-One Penalized Estimation (SLOPE; Bogdan et al. 2013, 2015) is a relatively new convex optimization procedure, which allows for adaptive selection of regressors under sparse high-dimensional designs. Here, we extend the idea of SLOPE to deal with the situation when one aims at selecting whole groups of explanatory variables instead of single regressors. Such groups can be formed by clustering strongly correlated predictors or groups of dummy variables corresponding to different levels of the same qualitative predictor. We formulate the respective convex optimization problem, group SLOPE (gSLOPE), and propose an efficient algorithm for its solution. We also define a notion of the group false discovery rate (gFDR) and provide a choice of the sequence of tuning parameters for gSLOPE so that gFDR is provably controlled at a prespecified level if the groups of variables are orthogonal to each other. Moreover, we prove that the resulting procedure adapts to unknown sparsity and is asymptotically minimax with respect to the estimation of the proportions of variance of the response variable explained by regressors from different groups. We also provide a method for the choice of the regularizing sequence when variables in different groups are not orthogonal but statistically independent and illustrate its good properties with computer simulations. Finally, we illustrate the advantages of gSLOPE in the context of Genome Wide Association Studies. R package grpSLOPE with an implementation of our method is available on The Comprehensive R Archive Network.

笔记与分组
相关领域论文