Latent-Conditioned Policy Gradient for Multi-Objective Deep Reinforcement Learning

Takuya Kanazawa, Chetan Gupta
3/15/2023
cs.LGcs.RO

No confident code implementation found for this paper.

Abstract

Sequential decision making in the real world often requires finding a good balance of conflicting objectives. In general, there exist a plethora of Pareto-optimal policies that embody different patterns of compromises between objectives, and it is technically challenging to obtain them exhaustively using deep neural networks. In this work, we propose a novel multi-objective reinforcement learning (MORL) algorithm that trains a single neural network via policy gradient to approximately obtain the entire Pareto set in a single run of training, without relying on linear scalarization of objectives. The proposed method works in both continuous and discrete action spaces with no design change of the policy network. Numerical experiments in benchmark environments demonstrate the practicality and efficacy of our approach in comparison to standard MORL baselines.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kanazawa2023latentconditioned,
  title  = {Latent-Conditioned Policy Gradient for Multi-Objective Deep Reinforcement Learning},
  author = {Takuya Kanazawa and Chetan Gupta},
  year   = {2023},
  eprint = {2303.08909},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.08909v2}
}

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/2303.08909.svg)](https://codeofpaper.com/paper/2303.08909)

Discussion