EMPO: A Clustering-Based On-Policy Algorithm for Offline Reinforcement Learing

Published: 19 Jun 2024, Last Modified: 26 Jul 2024ARLET 2024 PosterEveryoneRevisionsBibTeXCC BY 4.0
Keywords: offline reinforcement learning, trajectory clustering, hierarchical reinforcement learning, on-policy reinforcement learning
Abstract: We propose an on-policy algorithm, Expectation–Maximization Policy Optimization (EMPO), for offline reinforcement learning that leverages an EM-based clustering algorithm to recover the behaviour policies used to generate the dataset. By improving each behaviour policy via proximal policy optimization and learning a high-level policy that chooses the optimal cluster at each step, EMPO outperforms existing offline RL algorithms on multiple benchmarks.
Submission Number: 98
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview