From Penalization to Over-Parameterization: Achieving Implicit Regularization for High-Dimensional Linear Errors-in-Variables Models
从惩罚到过参数化:高维线性变量误差模型的隐式正则化AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于通用高维回归与测量误差方法,未提供足以对应所列应用领域细分的证据。
从惩罚到过参数化:高维线性变量误差模型的隐式正则化AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Regularization methods are crucial for the analysis of high-dimensional data, with most methods adding a penalty term to the loss function explicitly. In this paper, we introduce an implicit regularization technique through over-parameterization and propose a calibrated penalty-free (CPF) estimation method for high-dimensional linear errors-in-variables models. This method calibrates the bias caused by measurement errors while avoiding the bias introduced by penalty terms. We use the gradient descent algorithm to minimize the over-parameterized calibrated loss function without penalties, resulting in a sparse estimate of regression coefficients and thus achieving implicit regularization. Furthermore, a novel bootstrap methodology is introduced to address the challenge posed by the unknown covariance matrix of measurement errors. The oracle inequality for estimation error is established under certain regularity conditions. Extensive simulation studies and a real data analysis illustrate the competitive finite sample performance of the proposed method.