English

Robust Offline Reinforcement learning with Heavy-Tailed Rewards

Machine Learning 2024-04-02 v2 Artificial Intelligence Machine Learning

Abstract

This paper endeavors to augment the robustness of offline reinforcement learning (RL) in scenarios laden with heavy-tailed rewards, a prevalent circumstance in real-world applications. We propose two algorithmic frameworks, ROAM and ROOM, for robust off-policy evaluation and offline policy optimization (OPO), respectively. Central to our frameworks is the strategic incorporation of the median-of-means method with offline RL, enabling straightforward uncertainty estimation for the value function estimator. This not only adheres to the principle of pessimism in OPO but also adeptly manages heavy-tailed rewards. Theoretical results and extensive experiments demonstrate that our two frameworks outperform existing methods on the logged dataset exhibits heavy-tailed reward distributions. The implementation of the proposal is available at https://github.com/Mamba413/ROOM.

Keywords

Cite

@article{arxiv.2310.18715,
  title  = {Robust Offline Reinforcement learning with Heavy-Tailed Rewards},
  author = {Jin Zhu and Runzhe Wan and Zhengling Qi and Shikai Luo and Chengchun Shi},
  journal= {arXiv preprint arXiv:2310.18715},
  year   = {2024}
}

Comments

23 pages, 6 figures. Proceedings of the 27th International Conference on Artificial Intelligence and Statistics (AISTATS) 2024

R2 v1 2026-06-28T13:04:39.875Z