Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2303.08909 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914964842741760 |
|---|---|
| author | Kanazawa, Takuya Gupta, Chetan |
| author_facet | Kanazawa, Takuya Gupta, Chetan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_08909 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Latent-Conditioned Policy Gradient for Multi-Objective Deep Reinforcement Learning Kanazawa, Takuya Gupta, Chetan Machine Learning Robotics 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. |
| title | Latent-Conditioned Policy Gradient for Multi-Objective Deep Reinforcement Learning |
| topic | Machine Learning Robotics |
| url | https://arxiv.org/abs/2303.08909 |