Splitting strategies for post-selection inference
选择后推断中的分割策略AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要聚焦通用稀疏回归的选择后推断,没有提供所列计量应用方向的直接依据。
选择后推断中的分割策略AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary We consider the problem of providing valid inference for a selected parameter in a sparse regression setting. It is well known that classical regression tools can be unreliable in this context because of the bias generated in the selection step. Many approaches have been proposed in recent years to ensure inferential validity. In this article we consider a simple alternative to data splitting based on randomizing the response vector, which allows for higher selection and inferential power than the former, and is applicable with an arbitrary selection rule. We perform a theoretical and empirical comparison of the two methods and derive a central limit theorem for the randomization approach. Our investigations show that the gain in power can be substantial.
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…
凸正则化的谱依赖:右旋转不变设计下的基本极限
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…
从图套索到原子范数:高维模式恢复
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…
自适应 Lasso 解路径单位根检验的自助法改进
We propose sieve wild bootstrap analogues to the adaptive Lasso solution path unit root tests of Arnold and Reinschlüssel (2024) arXiv:2404.06205 to improve finite sample properties and extend their applicability to a generalised framework, allowing for non-stationary volatility. Numerical evidence shows the bootstrap to improve the tests' precision for error processes that promote spurious rejections of the unit root null, depending on the detrending procedure. The…
We show that the activation knot of a potentially non-stationary regressor on the adaptive Lasso solution path in autoregressions can be leveraged for selection-free inference about a unit root. The resulting test has asymptotic power against local alternatives in $1/T$ neighbourhoods, unlike post-selection inference methods based on consistent model selection. Exploiting the information enrichment principle devised by Reinschlüssel and Arnold (arXiv:2402.16580 [stat.ME]) to…
高维线性回归的统一谱分析:去偏与阈值化
We use spectral analysis to establish a unified theory of debiasing, thresholding, and simultaneous inference for high-dimensional linear regression with ill-conditioned designs. The methods include Ridge regression, spectral cut-off, and iterative and dynamical regression procedures. A common debiasing procedure uses two applications of the original linear algorithm with fixed parameters. Spectral analysis shows that debiasing squares the residual, while implementations…