English

Provable Zero-Shot Generalization in Offline Reinforcement Learning

Machine Learning 2025-03-12 v1 Artificial Intelligence

Abstract

In this work, we study offline reinforcement learning (RL) with zero-shot generalization property (ZSG), where the agent has access to an offline dataset including experiences from different environments, and the goal of the agent is to train a policy over the training environments which performs well on test environments without further interaction. Existing work showed that classical offline RL fails to generalize to new, unseen environments. We propose pessimistic empirical risk minimization (PERM) and pessimistic proximal policy optimization (PPPO), which leverage pessimistic policy evaluation to guide policy learning and enhance generalization. We show that both PERM and PPPO are capable of finding a near-optimal policy with ZSG. Our result serves as a first step in understanding the foundation of the generalization phenomenon in offline reinforcement learning.

Keywords

Cite

@article{arxiv.2503.07988,
  title  = {Provable Zero-Shot Generalization in Offline Reinforcement Learning},
  author = {Zhiyong Wang and Chen Yang and John C. S. Lui and Dongruo Zhou},
  journal= {arXiv preprint arXiv:2503.07988},
  year   = {2025}
}

Comments

30 pages, 1 figure, 1 table

R2 v1 2026-06-28T22:15:08.390Z