Information criteria for sparse methods in causal inference
因果推断稀疏方法的信息准则AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要以倾向评分、逆概率加权和双重稳健稀疏估计为对象,直接对应因果推断方向。
因果推断稀疏方法的信息准则AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
For propensity score analysis and sparse estimation, we develop an information criterion for determining the regularization parameters needed in variable selection. First, for Gaussian distribution-based causal inference models, we extend Stein's unbiased risk estimation theory, which leads to a generalized Cp criterion that has almost no weakness in conventional sparse estimation, and derive an inverse-probability-weighted sparse estimation version of the criterion without resorting to asymptotics. Next, for general causal inference models that are not necessarily Gaussian distribution-based, we extend the asymptotic theory on LASSO for propensity score analysis, with the intention of implementing doubly robust sparse estimation. From the asymptotic theory, an AIC-type information criterion for inverse-probability-weighted sparse estimation is given, and then a criterion with double robustness in itself is derived for doubly robust sparse estimation. Numerical experiments compare the proposed criterion with the existing criterion derived from a formal argument and verify that the proposed criterion is superior in almost all cases, that the difference is not negligible in many cases, and that the results of variable selection differ significantly. Real data analysis confirms that the difference between variable selection and estimation by these criteria is actually large. Finally, generalizations to general sparse estimation using group LASSO, elastic net, and non-convex regularization are made in order to indicate that the proposed criterion is highly extensible.