Reward Dimension Reduction for Scalable Multi-Objective Reinforcement Learning

Giseung Park, Youngchul Sung
2/28/2025
cs.LG

No official code found. Best implementation: Giseung-Park/Dimension-Reduction-MORL (0 stars, last commit 2026-01-05).

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.

View on arXivView PDF

Code Implementations(1)

Sourcecode for the paper "Reward Dimension Reduction for Scalable Multi-Objective Reinforcement Learning" (ICLR 25)

00PythonFeb 28, 20259 months ago

Cite this paper

@article{park2025reward,
  title  = {Reward Dimension Reduction for Scalable Multi-Objective Reinforcement Learning},
  author = {Giseung Park and Youngchul Sung},
  year   = {2025},
  eprint = {2502.20957},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.20957v1},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.20957.svg)](https://codeofpaper.com/paper/2502.20957)

Discussion