Discovering Multiple Solutions from a Single Task in Offline Reinforcement Learning
Abstract
Recent studies on online reinforcement learning (RL) have demonstrated the advantages of learning multiple behaviors from a single task, as in the case of few-shot adaptation to a new environment. Although this approach is expected to yield similar benefits in offline RL, appropriate methods for learning multiple solutions have not been fully investigated in previous studies. In this study, we therefore addressed the problem of finding multiple solutions from a single task in offline RL. We propose algorithms that can learn multiple solutions in offline RL, and empirically investigate their performance. Our experimental results show that the proposed algorithm learns multiple qualitatively and quantitatively distinctive solutions in offline RL.
Cite
Text
Osa and Harada. "Discovering Multiple Solutions from a Single Task in Offline Reinforcement Learning." International Conference on Machine Learning, 2024.Markdown
[Osa and Harada. "Discovering Multiple Solutions from a Single Task in Offline Reinforcement Learning." International Conference on Machine Learning, 2024.](https://mlanthology.org/icml/2024/osa2024icml-discovering/)BibTeX
@inproceedings{osa2024icml-discovering,
title = {{Discovering Multiple Solutions from a Single Task in Offline Reinforcement Learning}},
author = {Osa, Takayuki and Harada, Tatsuya},
booktitle = {International Conference on Machine Learning},
year = {2024},
pages = {38864-38884},
volume = {235},
url = {https://mlanthology.org/icml/2024/osa2024icml-discovering/}
}