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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要明确研究未测量混杂,并通过近端因果推断识别策略价值和学习决策规则。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Jiayi Wang
Chengchun Shi
Zhengling Qi

人机交互的收益:混杂环境中的超级策略学习

研究问题
在存在未测量混杂的序贯决策中,如何利用人类或 AI 已采取的行动所含信息,学习具有更强决策基准的策略?
方法与思路
作者把观察到的行动纳入策略输入,在近端因果推断框架下建立识别结果,并据此设计批量数据策略学习算法。
材料陈述的贡献
摘要称超级策略在其框架下优于标准最优策略与行为策略,并给出非参数识别结果和有限样本遗憾保证。
阅读关注点
应核对行动信息在实际决策时的可获得性、近端识别条件、策略比较所用信息集,以及遗憾界的适用范围。
阅读边界
摘要未列明代理变量与识别假设,也未提供优势幅度;策略优越性须置于作者定义的信息结构和理论条件中理解。

原文摘要

As AI becomes more prevalent throughout society, effective methods of integrating humans and AI systems that leverage their respective strengths and mitigate risk have become an important priority. In this article, we introduce the paradigm of super policy learning that takes advantage of Human-AI interaction for data driven sequential decision making. This approach uses the observed action, either from AI or humans, as input for achieving a stronger oracle in policy learning for the decision maker (humans or AI). In the decision process with unmeasured confounding, the actions taken by past agents can offer valuable insights into undisclosed information. By including this information for the policy search in a novel and legitimate manner, the proposed super policy learning will yield a super-policy that is guaranteed to outperform both the standard optimal policy and the behavior one (e.g., past agents’ actions). We call this stronger oracle a blessing from human-AI interaction. Furthermore, to address the issue of unmeasured confounding in finding super-policies using the batch data, a number of nonparametric and causal identifications are established under the framework of proximal causal inference. Building upon on these novel identification results, we develop several super-policy learning algorithms and systematically study their theoretical properties such as finite-sample regret guarantee. Finally, we illustrate the effectiveness of our proposal through extensive simulations and real-world applications. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.

笔记与分组
相关领域论文