PROXIMAL ESTIMATION AND INFERENCE
近端估计与推断AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论惩罚估计量的凸分析框架与渐近推断理论,未涉及因果推断、面板、离散选择、时间序列或金融等具体应用领域,故不选任何细分方向。
近端估计与推断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 framework to linear regression with irregular designs, including singular and nearly-singular cases. In this setting, where the coefficient vector need not be point identified, we motivate the Ridgeless estimand as the inferential target, construct a n $\sqrt {n}$ StartRoot n EndRoot -consistent modified Ridgeless benchmark estimator, and combine it with adaptive proximal penalization to obtain, to the best of our knowledge, the first penalized estimator achieving the oracle property under both regular and irregular designs.