https://github.com/mamba413/room
Robust Offline Reinforcement Learning with Heavy-Tailed Rewards
https://github.com/mamba413/room
heavy-tailed-distributions off-policy-evaluation offline-reinforcement-learning robust-statistics
Last synced: about 1 year ago
JSON representation
Robust Offline Reinforcement Learning with Heavy-Tailed Rewards
- Host: GitHub
- URL: https://github.com/mamba413/room
- Owner: Mamba413
- Created: 2024-02-03T19:39:08.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-08-02T13:44:45.000Z (almost 2 years ago)
- Last Synced: 2025-03-24T11:07:49.689Z (about 1 year ago)
- Topics: heavy-tailed-distributions, off-policy-evaluation, offline-reinforcement-learning, robust-statistics
- Language: Python
- Homepage:
- Size: 958 KB
- Stars: 4
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Robust Offline Reinforcement Learning with Heavy-Tailed Rewards
---------------
Reproducible code for the paper: [Robust Offline Reinforcement Learning with Heavy-Tailed Rewards](https://arxiv.org/abs/2310.18715)
### Summary of the paper
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 (OPE) and offline policy optimization (OPO), respectively. Central to our frameworks is the median-of-means (MM) method. Our key insight is that employing MoM to offline RL does more than just tackle heavy-tailed rewards—it offers valid uncertainty quantification to address insufficient coverage issue in offline RL as well.
Below it is the numerical performance of our proposal (ROOM-VM & P-ROOM-VM) on the d4rl benchmarked dataset:

### File structure
1. `requirement.txt`: prerequisite python libraries
2. `Cartpole` directory: code for reproducing results in Figures 3, 4, 6
- `_density` directory: functions for estimating the density ratio in marginalize importance sampling based methods
- `_RL` directory: employ MM in the TD update in fitted Q-iteration/evaluation based algorithms (Algorithms 4-5)
- `_MM_OPE.py`: Algorithm 1 and its variant (ROAM-variant)
- `_MM_OPE.py`: Algorithm 2 and its pessimistic variant (P-ROOM)
- `_PB_OPO.py`: Bootstrap based variant for OPE.
- `eval_cartpole.py`: reproduce Figures 3(a), 4, 6
- `optimize_cartpole.py`: reproduce Figures 3(b)
3. `SQL`:
- `src` directory: implement the sparse Q-learning (SQL) for
- `main_SQL.py`: the main file for conducting numerical studies for SQL. (reproduce Figure 5)
4. `SAC-N`:
- `SACN.py` directory: implement the soft-actor critic (SAC) of $N$ ensemble.
- `main_SACN.py`: the main file for conducting numerical studies for SACN. (reproduce Figure A3)
### Citation
```tex
@InProceedings{zhu2024robust,
title = {Robust Offline Reinforcement Learning with Heavy-Tailed Rewards},
author = {Zhu, Jin and Wan, Runzhe and Qi, Zhengling and Luo, Shikai and Shi, Chengchun},
booktitle = {Proceedings of The 27th International Conference on Artificial Intelligence and Statistics},
pages = {541--549},
year = {2024},
editor = {Dasgupta, Sanjoy and Mandt, Stephan and Li, Yingzhen},
volume = {238},
series = {Proceedings of Machine Learning Research},
month = {02--04 May},
publisher = {PMLR}
}
```
### Reference
- Offline RL with No OOD Actions: In-Sample Learning via Implicit Value Regularization, ICLR (2023)
- Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble, NeurIPS (2021)