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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要聚焦生存分析中的高维预测与模型平均,没有明确研究所列分位数、因果或金融风险方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Baihua He
Shuangge Ma
Xinyu Zhang
Li-Xing Zhu

高维生存数据的秩驱动贪心模型平均

研究问题
面对高维预测变量和未完全观测的生存结局,如何通过模型平均提高风险相关预测,并降低模型误设的影响?
方法与思路
作者以拆分预测变量的变换模型为工作模型,用平滑一致性指数构造候选预测和权重,再通过贪心算法处理高维情形。
材料陈述的贡献
摘要称给出最优权重的渐近误差界;若候选集中包含正确子模型,其总权重依概率趋于一,并报告数值比较。
阅读关注点
应核对删失处理、预测变量拆分和贪心搜索规则,以及权重理论的条件、正确子模型含义与模型误设稳健性的范围。
阅读边界
仅据版本未注明的索引摘要;未说明删失机制、误差界条件或比较数值,这里的生存风险不等同于金融尾部风险。

原文摘要

Model averaging is an effective way to enhance prediction accuracy. However, most previous works focus on low-dimensional settings with completely observed responses. To attain an accurate prediction for the risk effect of survival data with high-dimensional predictors, we propose a novel method: rank-based greedy (RG) model averaging. Specifically, adopting the transformation model with splitting predictors as working models, we doubly use the smooth concordance index function to derive the candidate predictions and optimal model weights. The final prediction is achieved by weighted averaging all the candidates. Our approach is flexible, computationally efficient, and robust against model misspecification, as it neither requires the correctness of a joint model nor involves the estimation of the transformation function. We further adopt the greedy algorithm for high dimensions. Theoretically, we derive an asymptotic error bound for the optimal weights under some mild conditions. In addition, the summation of weights assigned to the correct candidate submodels is proven to approach one in probability when there are correct models included among the candidate submodels. Extensive numerical studies are carried out using both simulated and real datasets to show the proposed approach's robust performance compared to the existing regularization approaches. Supplementary materials for this article are available online.

笔记与分组
相关领域论文