平衡划分森林用于因果加权
Balancing Partition Forest for Causal Weighting
Felipe Angelim · Alessandro Leite
中文摘要
在观察性因果推断中,平衡权重用于构建一个处理与观察到的预处理协变量相互独立的总体。理想权重是协变量边际分布与处理边际分布之积同其联合分布之比,对二元和连续处理均适用。提出平衡划分树(Balancing Partition Tree, BPT)与平衡划分森林(Balancing Partition Forest, BPF),在学到的协变量—处理空间矩形划分上估计该比值。每次分裂最大化由联合计数与边际计数计算出的 Bregman 散度增益。两种散度选择分别得到最大化划分所捕获互信息或降低权重平方误差的准则。证明两种准则的总体残差均能界定使用总体划分权重的逆概率加权与双稳健响应估计器的偏差。在 17 个合成与半合成设置及三个响应估计器上,BPF 在七种权重估计器中取得最低平均 RMSE 排名,单棵树在 16,512 个观测上拟合耗时 0.14 秒。
关键要点
- 01平衡权重需估计协变量与处理边际乘积同联合分布之比,二元与连续处理通用
- 02BPT/BPF 在学习到的矩形划分上估计该比值,分裂最大化 Bregman 散度增益
- 03两种散度准则分别最大化互信息或降低权重平方误差,总体残差可界定估计器偏差
- 0417 个设置三个估计器下 BPF 平均 RMSE 排名最低,单树 16,512 观测拟合 0.14 秒
解读
尚无解读。
原始英文摘要
arXiv:2611.23524v1 Announce Type: cross Abstract: Balancing weights are used in observational causal inference to construct a population in which the treatment is independent of observed pretreatment covariates. The ideal weight is the ratio between the product of the covariate and treatment marginals and their joint distribution, for binary and continuous treatments alike. We propose Balancing Partition Tree (BPT) and Balancing Partition Forest (BPF), which estimate this ratio on a learned rectangular partition of covariate--treatment space. Each split maximizes the gain in a Bregman divergence computed from joint and marginal counts. Two choices of divergence yield criteria that maximize the mutual information captured by the partition or reduce the squared error of the weights. We show that the population residual of either criterion bounds the bias of inverse-probability-weighted and doubly robust response estimators that use the population partition weights. Across 17 synthetic and semi-synthetic settings and three response estimators, BPF obtains the lowest mean RMSE rank among seven weight estimators, and a single tree fits in 0.14 seconds on 16,512 observations.