Asymptotic Optimality of the Fast Randomized Versions of GCV and $C_L$ in Ridge Regression and Regularization

Ridge regression is a well-known technique to estimate the coefficients of a linear model. The method of regularization is a similar approach commonly used to solve underdetermined linear equations with discrete noisy data. When applying such a technique, the choice of the smoothing (or regularization) parameter $h$ is crucial. Generalized cross-validation (GCV) and Mallows' $C_L$ are two popular methods for estimating a good value for $h,$ from the data. Their asymptotic properties, such as consistency and asymptotic optimality, have been largely studied [Craven and Wahba (1979); Golub, Heath and Wahba (1979); Speckman (1985)]. Very interesting convergence results for the actual (random) parameter given by GCV and $C_L$ have been shown by Li (1985, 1986). Recently, Girard (1987, 1989) has proposed fast randomized versions of GCV and $C_L.$ The purpose of this paper is to show that the above convergence results also hold for these new methods.Ridge regression is a well-known technique to estimate the coefficients of a linear model. The method of regularization is a similar approach commonly used to solve underdetermined linear equations with discrete noisy data. When applying such a technique, the choice of the smoothing (or regularization) parameter $h$ is crucial. Generalized cross-validation (GCV) and Mallows' $C_L$ are two popular methods for estimating a good value for $h,$ from the data. Their asymptotic properties, such as consistency and asymptotic optimality, have been largely studied [Craven and Wahba (1979); Golub, Heath and Wahba (1979); Speckman (1985)]. Very interesting convergence results for the actual (random) parameter given by GCV and $C_L$ have been shown by Li (1985, 1986). Recently, Girard (1987, 1989) has proposed fast randomized versions of GCV and $C_L.$ The purpose of this paper is to show that the above convergence results also hold for these new methods.

摘要来源：OpenAlex 索引摘要（稿件版本未注明）

笔记与分组

同方向的基础文献

相关领域论文

共同方法：高维与机器学习、检验与推断、一般估计、正则化与变量选择

Controlling the false discovery rate in high-dimensional linear models using model-X knockoffs and $p$-values

Jinyuan Chang · Chenlong Li · Cheng Yong Tang · Zhengtian Zhu首次提交 2025-05-22 · 修订 2026-10-14 · v3arXiv预印本

结合 model-X knockoffs 与 p 值的高维线性模型 FDR 控制AI 解读

We propose a novel multiple testing methodology for controlling the false discovery rate (FDR) in high-dimensional linear models that integrates model-X knockoff techniques with debiased penalized regression estimators. At the foundation of our methodology, we construct and study two sets of naturally paired high-dimensional test statistics and the associated $p$-values for evaluating the same null hypotheses. The first set is shown to be asymptotically mutually independent,…

多重检验与同时推断正则化与变量选择

关联记录被引 0 次 ↗OpenAlex · 核验 2026-10-14

AI 解读阅读原文 ↗BibTeX ↓

共同方法：高维与机器学习、检验与推断、一般估计、正则化与变量选择

Improved Forecasting for Multivariate Time Series using GNAR models with General Inverse Distance Weights

Hengxu Liu · Guy P. Nason · Sourav Das · Stephen Grebby首次提交 2026-10-14 · 修订 2026-10-14 · v1arXiv预印本

基于广义逆距离权重的GNAR模型改进多元时间序列预测AI 解读

Many multivariate time series arise on networks where relationships between variables depend on physical or more general distances. Standard vector autoregressive models struggle in such settings due to their quadratic parameter growth, while generalised network autoregressive (GNAR) models offer a parsimonious alternative by explicitly incorporating network structures. Existing GNAR formulations assume fixed weights, typically uniform or reciprocal distances, which may not…

微观 · 网络与干扰 VAR 与局部投影正则化与变量选择

被引：暂无数据

AI 解读阅读原文 ↗BibTeX ↓

共同方法：高维与机器学习、检验与推断、一般估计、正则化与变量选择

PROXIMAL ESTIMATION AND INFERENCE

Alberto Quaini · Fabio Trojani上线 2026-10-14Econometric Theory在线待刊

近端估计与推断AI 解读

Abstract We develop a convex-analytic framework for constructing and analyzing a broad class of penalized estimators. Our method defines penalized estimators by applying proximal operators to benchmark estimators, rather than by penalizing the benchmark criterion itself. We establish general finite-sample properties, derive unified asymptotic distribution results, and provide tractable conditions for oracle selection and oracle asymptotic efficiency. We then apply the…

正则化与变量选择

被引：暂无数据

AI 解读阅读原文 ↗BibTeX ↓

共同方法：高维与机器学习、检验与推断、一般估计、正则化与变量选择

Robust inference for risk heterogeneity under group imbalance

Mengqi Xu · Subha Maity · Joel Dubin首次提交 2026-05-30 · 修订 2026-10-13 · v2arXiv预印本

组间不平衡下的风险异质性稳健推断AI 解读

Population-level heterogeneity is ubiquitous in biomedical data, where differences across demographic or clinical subgroups can substantially alter risk patterns. For example, in intensive care unit (ICU) studies, the mortality risk associated with specific admission diagnoses can vary across ethnic groups. Existing approaches for detecting risk heterogeneity are often sensitive to baseline model misspecification and regularization bias, both of which commonly arise in…

微观 · 因果推断正则化与变量选择微观 · 分位数与分布效应

关联记录被引 0 次 ↗OpenAlex · 核验 2026-10-12

AI 解读阅读原文 ↗BibTeX ↓

共同方法：高维与机器学习、检验与推断、一般估计、正则化与变量选择

Spectral Dependence of Convex Regularization: Fundamental Limits under Right-Rotationally Invariant Designs

Baichen Tan · Audrey Yang · Cynthia Rush首次提交 2026-08-07 · 修订 2026-10-12 · v2arXiv预印本

凸正则化的谱依赖：右旋转不变设计下的基本极限AI 解读

We study the fundamental limits of convex-regularized estimation in high-dimensional linear regression with right-rotationally invariant design matrices. We show that the asymptotic risks of convex-penalized least squares estimators are lower bounded by the risk of an approximate message passing algorithm known as Bayes VAMP, and we further characterize when the lower bound is attainable. As a technical ingredient in the proof of our lower bound theorem, we characterize the…

正则化与变量选择贝叶斯

被引：暂无数据

AI 解读阅读原文 ↗BibTeX ↓

共同方法：高维与机器学习、检验与推断、一般估计、正则化与变量选择

From Graphical Lasso to Atomic Norms: High-Dimensional Pattern Recovery

Piotr Graczyk · Bartosz Kołodziejek · Hideto Nakashima · Maciej Wilczyński首次提交 2025-06-16 · 修订 2026-10-12 · v3arXiv预印本

从图套索到原子范数：高维模式恢复AI 解读

We study high-dimensional precision-matrix estimation with polyhedral atomic-norm penalties on the off-diagonal entries. This framework covers the graphical lasso, $\ell_\infty$-type penalties, SLOPE/OWL penalties, and penalties motivated by colored graphical models. We define the target pattern through the subdifferential face of the dual ball and derive sufficient conditions for exact pattern recovery from the sample covariance matrix. Our analysis introduces two geometric…

正则化与变量选择

关联记录被引 0 次 ↗OpenAlex · 核验 2026-10-14

AI 解读阅读原文 ↗BibTeX ↓

分类依据与纠错

Asymptotic Optimality of the Fast Randomized Versions of GCV and CLC_LCL​ in Ridge Regression and RegularizationAsymptotic Optimality of the Fast Randomized Versions of GCV and $C_L$ in Ridge Regression and Regularization

代码、数据与补充材料

原文摘要

同方向的基础文献

相关领域论文

同方向的基础文献

相关领域论文

Asymptotic Optimality of the Fast Randomized Versions of GCV and $C_L$ in Ridge Regression and RegularizationAsymptotic Optimality of the Fast Randomized Versions of GCV and $C_L$ in Ridge Regression and Regularization