跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要以因果界、工具变量和未观测混杂下的个体化处理决策为核心。

反馈分类问题

Partial Identification Learning with Categorical Treatments for Individualized Treatment Rules

分类处理下个体化处理规则的部分识别学习

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Johannes Hruza
Paweł Morzywołek
Jakob Zeitler
Samir Bhatt
Michael C Sachs

分类处理下个体化处理规则的部分识别学习

研究问题
当未观测混杂使处理效应只能部分识别时,如何在多个离散处理选项中学习个体化规则,并限制最坏情形决策损失?
方法与思路
作者利用因果界构造广义极小极大损失,将处理映射至正则单纯形顶点,再以可微加权替代风险学习决策规则。
材料陈述的贡献
摘要称,该框架扩展至分类处理、结果和工具变量,建立替代风险与原问题的联系,并给出有限样本预言机不等式。
阅读关注点
核对各因果结构下界的构造、替代风险与原决策目标的对应条件,以及核实现满足收敛条件的具体要求。
阅读边界
所据为 arXiv 预印本,同行评审或期刊接收未经核实;部分识别仍需因果假设,摘要未列全,也未报告比较数值。

原文摘要

We develop a partial identification learning framework for individualized treatment rules (ITRs) with categorical treatments, outcomes, and instrumental variables. Rather than relying on strong causal assumptions required for point identification, our framework leverages causal bounds to characterize the optimal treatment decision. Existing methods for ITR optimization under partial identification are largely restricted to binary treatment settings and the bounds derived by Balke and Pearl under the canonical instrumental variable design. We extend this framework to accommodate a broader class of causal structures as well as scenarios with categorical treatment, outcome, and instrumental variables. We introduce a generalized minimax loss criterion for treatment selection from among more than two options, which minimizes the maximum possible difference between the chosen and the optimal treatment based on partial identification bounds. To construct the ITR, we use a symmetric embedding strategy that maps discrete treatments to the vertices of a regular simplex, avoiding the geometric inconsistencies of standard one-vs-rest approaches. We derive a differentiable, weighted surrogate risk function and show that optimizing it solves the original problem. Furthermore, we provide finite sample convergence rates via an oracle inequality under general regularity conditions, which we show are satisfied by a kernel based implementation. Numerical experiments demonstrate that the framework yields ITRs significantly closer to the oracle ITR compared to existing alternatives in settings with unmeasured confounding.

笔记与分组