English

Reward Dimension Reduction for Scalable Multi-Objective Reinforcement Learning

Machine Learning 2025-03-03 v1

Abstract

In this paper, we introduce a simple yet effective reward dimension reduction method to tackle the scalability challenges of multi-objective reinforcement learning algorithms. While most existing approaches focus on optimizing two to four objectives, their abilities to scale to environments with more objectives remain uncertain. Our method uses a dimension reduction approach to enhance learning efficiency and policy performance in multi-objective settings. While most traditional dimension reduction methods are designed for static datasets, our approach is tailored for online learning and preserves Pareto-optimality after transformation. We propose a new training and evaluation framework for reward dimension reduction in multi-objective reinforcement learning and demonstrate the superiority of our method in environments including one with sixteen objectives, significantly outperforming existing online dimension reduction methods.

Keywords

Cite

@article{arxiv.2502.20957,
  title  = {Reward Dimension Reduction for Scalable Multi-Objective Reinforcement Learning},
  author = {Giseung Park and Youngchul Sung},
  journal= {arXiv preprint arXiv:2502.20957},
  year   = {2025}
}

Comments

Accepted to ICLR 2025

R2 v1 2026-06-28T22:01:40.884Z