arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.05260econ.EM
收藏

罕见结局下的策略学习

Policy Learning with Rare Outcomes

Julia Hatamyar, Noemi Kreif

AI总结:

该研究针对现实政策评估中策略学习算法表现信息不足的问题,通过合成数据对比多种算法的有限样本表现,发现基于CATE的策略树等方法更优,并将其应用于印尼婴儿死亡率相关的医保补贴分配案例。

摘要:

机器学习(ML)对条件平均处理效应(CATE)的估计可用于指导政策决策,既可以针对CATE估计值显示受益的个体制定靶向政策,也可作为优化整体结局的决策树的输入。目前关于这些算法在现实政策评估场景中的表现,可用信息十分有限。我们利用合成数据,对比了不同策略学习算法、其学习阶段采用的机器学习技术,以及呈现估计策略值的方法的有限样本表现。对于每种算法,我们通过衡量其产生的处理分配与理想(“神谕”)策略的偏差来评估效果。主要发现是,基于估计CATE的策略树表现优于用双稳健得分学习的树。在所有设置中,Causal Forests(因果森林)和Normalised Double-Robust Learner(归一化双稳健学习器)表现始终优异,而Bayesian Additive Regression Trees(贝叶斯加性回归树)表现较差。随后这些方法被应用于一项靶向分配补贴健康保险的案例研究,旨在降低印度尼西亚的婴儿死亡率。

英文摘要:

Machine learning (ML) estimates of conditional average treatment effects (CATE) can guide policy decisions, either by allowing targeting of individuals with beneficial CATE estimates, or as inputs to decision trees that optimise overall outcomes. There is limited information available regarding how well these algorithms perform in real-world policy evaluation scenarios. Using synthetic data, we compare the finite sample performance of different policy learning algorithms, machine learning techniques employed during their learning phases, and methods for presenting estimated policy values. For each algorithm, we assess the resulting treatment allocation by measuring deviation from the ideal ("oracle") policy. Our main finding is that policy trees based on estimated CATEs outperform trees learned from doubly-robust scores. Across settings, Causal Forests and the Normalised Double-Robust Learner perform consistently well, while Bayesian Additive Regression Trees perform poorly. These methods are then applied to a case study targeting optimal allocation of subsidised health insurance, with the goal of reducing infant mortality in Indonesia.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑