Strong oracle guarantees for partial penalized tests of high-dimensional generalized linear models
高维广义线性模型部分惩罚检验的强 Oracle 保证AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用高维广义线性模型检验,没有足够证据归入给定应用细分领域。
高维广义线性模型部分惩罚检验的强 Oracle 保证AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Abstract Partial penalized tests provide flexible approaches to testing linear hypotheses in high-dimensional generalized linear models. However, because the estimators used in these tests are local minimizers of potentially nonconvex folded-concave penalized objectives, the solutions one computes in practice may not coincide with the unknown local minima for which we have nice theoretical guarantees. To close this gap between theory and computation, we introduce local linear approximation (LLA) algorithms to compute the full and reduced model estimators for these tests and develop a theory specifically for the LLA solutions. We prove that our LLA algorithms converge to oracle estimators for the full and reduced models in two steps with overwhelming probability. We then leverage this strong oracle result and the asymptotic properties of the oracle estimators to show that the partial penalized test statistics evaluated at the LLA solutions are approximately chi-square in large samples, giving us guarantees for the tests using specific computed solutions and thereby closing the theoretical gap. In simulations, we find that our LLA tests closely agree with the oracle tests and compare favourably with alternative high-dimensional inference procedures. We demonstrate the flexibility of our LLA tests with two high-dimensional data applications.