Offline Reinforcement Learning for Human-Guided Human-Machine Interaction with Private Information

强化学习 钢筋 计算机科学 私人信息检索 人工智能 人机交互 机器学习 知识管理 心理学 计算机安全 社会心理学
作者
Zuyue Fu,Zhengling Qi,Zhuoran Yang,Zhaoran Wang,Lan Wang
出处
期刊:Management Science [Institute for Operations Research and the Management Sciences]
卷期号:72 (1): 646-666 被引量:2
标识
DOI:10.1287/mnsc.2022.04112
摘要

Motivated by the human-machine interaction such as recommending videos for improving customer engagement, we study human-guided human-machine interaction for decision making with private information. We model this interaction as a two-player turn-based game, where one player (Bob, a human) guides the other player (Alice, a machine) toward a common goal. Specifically, we focus on offline reinforcement learning (RL) in this game, where the goal is to find a policy pair for Alice and Bob that maximizes their expected total rewards based on an offline data set collected a priori. The offline setting presents two challenges: (i) We cannot collect Bob’s private information, leading to a confounding bias when using standard RL methods, and (ii) there is a distributional mismatch between the behavior policy used to collect data and the desired optimal policy we aim to learn. To tackle the confounding bias, we treat Bob’s previous action as an instrumental variable for Alice’s current decision making to adjust for the unmeasured confounding. We establish a novel identification result and propose a new off-policy evaluation (OPE) method for evaluating policy pairs in this two-player turn-based game. To tackle the distributional mismatch, we leverage the idea of pessimism and use our OPE method to develop an off-policy policy learning algorithm for finding a desirable policy pair for both Alice and Bob. Moreover, we prove that under some technical assumptions, the policy pair obtained through our method converges to the optimal one at a satisfactory rate. Finally, we conduct a simulation study to demonstrate the performance of the proposed method. This paper was accepted by Nicolas Stier, Special Issue on the Human-Algorithm Connection. Funding: L. Wang’s research is partially supported by the National Science Foundation [Grant FRGMS-1952373]. Supplemental Material: The online appendices and data files are available at https://doi.org/10.1287/mnsc.2022.04112 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
Joanna完成签到 ,获得积分10
刚刚
不安的从霜完成签到,获得积分10
1秒前
Ava的应助被lilac采纳,获得10
1秒前
Orange的应助被lilac采纳,获得10
2秒前
领导范儿的应助被lilac采纳,获得10
2秒前
清脆代桃完成签到 ,获得积分10
2秒前
bkagyin的应助被lilac采纳,获得10
2秒前
英姑的应助被lilac采纳,获得10
2秒前
今后的应助被lilac采纳,获得10
2秒前
在水一方的应助被lilac采纳,获得10
2秒前
酷波er的应助被lilac采纳,获得10
3秒前
ding的应助被lilac采纳,获得10
3秒前
科研通AI6.2的应助被han采纳,获得10
3秒前
bkagyin的应助被lilac采纳,获得10
3秒前
5秒前
5秒前
5秒前
6秒前
林霖发布了新的文献求助10
6秒前
小鹿完成签到,获得积分10
7秒前
小南瓜发布了新的文献求助10
7秒前
Lll完成签到,获得积分20
7秒前
YuJue的应助被koko采纳,获得30
7秒前
拉长的尔白的应助被koko采纳,获得10
7秒前
星辰大海的应助被koko采纳,获得30
8秒前
乐观柚子完成签到,获得积分10
8秒前
8秒前
8秒前
Jasper的应助被lilac采纳,获得10
9秒前
bkagyin的应助被lilac采纳,获得10
9秒前
aaaa的应助被xiaolizi采纳,获得20
9秒前
大模型的应助被lilac采纳,获得10
9秒前
科研通AI6.4的应助被喜喜采纳,获得10
9秒前
FashionBoy的应助被lilac采纳,获得10
9秒前
9秒前
dbz的应助被lilac采纳,获得10
9秒前
Akim的应助被lilac采纳,获得10
10秒前
英俊的铭的应助被lilac采纳,获得10
10秒前
星辰大海的应助被lilac采纳,获得10
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Les Mantodea De Guyane 2000
Guidelines for fracture-safe and fatigue-reliable design of steel structures 600
The Basics of Practical Optimization, Second Edition 600
Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization 600
Organizational Behavior 510
Atelier, 2nd edition 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 7991783
求助须知:如何正确求助?哪些是违规求助? 9447498
关于积分的说明 21112478
捐赠科研通 7564920
什么是DOI,文献DOI怎么找? 3378604
关于科研通互助平台的介绍 2512497
邀请新用户注册赠送积分活动 2412173