[3E1-GS-2] Machine learning

[3E1-GS-2-01] Improved Regret Approximation for Min-Max Regret Optimization in Reinforcement Learning

〇Keita Saito^1,2, Takumi Tanabe^1,2, Youhei Akimoto^1,2 (1. Univ. of Tsukuba, 2. RIKEN AIP)

Keywords:Reinforcement Learning, Generalization

In the field of reinforcement learning, there are cases in which the environment parameter at evaluation time is inaccessible during training. Several approaches aim to minimize the worst-case regret in terms of the environment parameter. As true regret can be rarely obtained during training, regret is calculated using approximated optimal policy under each environment parameter. However, when using approximated regret for training, inaccuracy of the approximation can cause the minimax regret optimization to fail. In this paper, we propose an approach that improves the accuracy of the approximation of optimal policies, which consequently improves the regret approximation. Our experiments show that our approach is effective in accurately approximating regret, which leads to higher performance in minimizing worst-case regret.