An Overview on Regularized Regression for Multiple Imputation in High‐Dimensional Data: Concepts, Methods, and Practical Guidance

Bugra Varol, Fulden Cantas Turkis
{"title":"An Overview on Regularized Regression for Multiple Imputation in High‐Dimensional Data: Concepts, Methods, and Practical Guidance","authors":"Bugra Varol, Fulden Cantas Turkis","doi":"10.1002/widm.70100","DOIUrl":null,"url":null,"abstract":"High‐dimensional datasets with missing values present substantial challenges for statistical modeling and inference because conventional multiple imputation (MI) methods may become unstable or nonidentifiable under severe dimensional imbalance. Regularized regression techniques, including lasso, ridge, and related Bayesian formulations, offer a promising way to improve feasibility by enabling variable selection and stabilizing estimation in high‐dimensional settings. This overview provides a structured synthesis of regularized regression‐based MI methods, organized into direct and indirect integration strategies, Bayesian sparsity‐inducing approaches, optimization‐based and sequential penalization methods, and post‐imputation resampling or adjustment techniques. For each category, we summarize the underlying methodological logic, review empirical findings from simulation studies, and highlight practical considerations for implementation. Particular attention is given to methods developed for missing not at random (MNAR) and to the inferential challenges that arise after variable selection. Overall, this overview aims to help researchers choose regularized imputation strategies that are methodologically appropriate, practically feasible, and aligned with the analytical goals of high‐dimensional incomplete‐data studies. This article is categorized under: <jats:list list-type=\"simple\"> <jats:list-item> Technologies &gt; Machine Learning </jats:list-item> <jats:list-item> Algorithmic Development &gt; Statistics </jats:list-item> </jats:list>","PeriodicalId":501013,"journal":{"name":"WIREs Data Mining and Knowledge Discovery","volume":"16 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2026-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"WIREs Data Mining and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/widm.70100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

High‐dimensional datasets with missing values present substantial challenges for statistical modeling and inference because conventional multiple imputation (MI) methods may become unstable or nonidentifiable under severe dimensional imbalance. Regularized regression techniques, including lasso, ridge, and related Bayesian formulations, offer a promising way to improve feasibility by enabling variable selection and stabilizing estimation in high‐dimensional settings. This overview provides a structured synthesis of regularized regression‐based MI methods, organized into direct and indirect integration strategies, Bayesian sparsity‐inducing approaches, optimization‐based and sequential penalization methods, and post‐imputation resampling or adjustment techniques. For each category, we summarize the underlying methodological logic, review empirical findings from simulation studies, and highlight practical considerations for implementation. Particular attention is given to methods developed for missing not at random (MNAR) and to the inferential challenges that arise after variable selection. Overall, this overview aims to help researchers choose regularized imputation strategies that are methodologically appropriate, practically feasible, and aligned with the analytical goals of high‐dimensional incomplete‐data studies. This article is categorized under: Technologies > Machine Learning Algorithmic Development > Statistics
高维数据中多元归算的正则化回归综述:概念、方法和实践指导
具有缺失值的高维数据集对统计建模和推理提出了重大挑战,因为传统的多重输入(MI)方法可能在严重的维数不平衡下变得不稳定或无法识别。正则化回归技术,包括lasso、ridge和相关的贝叶斯公式,通过在高维环境中实现变量选择和稳定估计,提供了一种有希望的方法来提高可行性。本综述提供了基于正则化回归的MI方法的结构化综合,组织为直接和间接集成策略,贝叶斯稀疏性诱导方法,基于优化和顺序惩罚方法,以及imputation后重采样或调整技术。对于每个类别,我们总结了潜在的方法逻辑,回顾了模拟研究的实证结果,并强调了实施的实际考虑。特别关注的是为非随机缺失(MNAR)开发的方法,以及变量选择后出现的推理挑战。总体而言,本综述旨在帮助研究人员选择方法上适当的、实际可行的、并与高维不完整数据研究的分析目标一致的正则化归算策略。本文分类如下:技术;机器学习;算法开发;统计
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书