从有混淆偏差的离线数据中自动构建奖励,提升强化学习鲁棒性。
Automatic Reward Shaping from Confounded Offline Data
- 基于DQN改进,通过最坏情况环境建模对抗观测偏差
- 在12个存在混淆的Atari游戏中均优于标准DQN
- 适合处理真实场景中无法排除隐变量干扰的强化学习任务
人工智能中的关键任务是在未知环境中学习有效策略以优化性能。离线强化学习方法(如Q-learning)可基于历史经验做出最优决策。本文研究在复杂高维领域中存在未观测混淆变量时的离线学习问题。基于深度Q网络(DQN),提出一种对混淆偏差鲁棒的新算法:该算法寻找与观测数据兼容的最坏情况环境下的安全策略。在12个存在混淆的Atari游戏上测试,当行为策略与目标策略输入不匹配且存在未观测混淆因素时,该方法在所有游戏中均持续优于标准DQN。
原文摘要 · Abstract (English)
A key task in Artificial Intelligence is learning effective policies for controlling agents in unknown environments to optimize performance measures. Off-policy learning methods, like Q-learning, allow learners to make optimal decisions based on past experiences. This paper studies off-policy learning from biased data in complex and high-dimensional domains where \emph{unobserved confounding} cannot be ruled out a priori. Building on the well-celebrated Deep Q-Network (DQN), we propose a novel deep reinforcement learning algorithm robust to confounding biases in observed data. Specifically, our algorithm attempts to find a safe policy for the worst-case environment compatible with the observations. We apply our method to twelve confounded Atari games, and find that it consistently dominates the standard DQN in all games where the observed input to the behavioral and target policies mismatch and unobserved confounders exist.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。