arXiv AI
Sep 17

Online Robust Reinforcement Learning Through Monte-Carlo Planning

The paper introduces a robust variant of Monte Carlo Tree Search that addresses ambiguities in transition dynamics and reward distributions, bridging the gap between simulation-based planning and real-world deployment. It incorporates a robust power mean backup operator and exploration bonuses to guarantee finite-sample convergence at every node, achieving an ≠O(n−1/2) convergence rate for root value estimation comparable to standard MCTS. Empirical results demonstrate robust performance in planning tasks even under significant model mismatches.

By Tuan Dam, Kishan Panaganti, Brahim Driss, Adam Wierman