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.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyosa2024discovering

Related papers

• Finetuning From Offline Reinforcement Learning: Challenges, Trade-offs And Practical Solutions (2023)0.00
• Conservative Equilibrium Discovery In Offline Game-theoretic Multiagent Reinforcement Learning (2026)0.00
• Behavior Estimation From Multi-source Data For Offline Reinforcement Learning (2022)2.26
• One Solution Is Not All You Need: Few-shot Extrapolation Via Structured Maxent RL (2020)0.00
• Leveraging Offline Data In Online Reinforcement Learning (2022)0.00
• Pessimistic Value Iteration For Multi-task Data Sharing In Offline Reinforcement Learning (2024)9.33
• Ensemble Successor Representations For Task Generalization In Offline-to-online Reinforcement Learning (2024)2.26
• Bridging The Gap Between Offline And Online Reinforcement Learning Evaluation Methodologies (2022)0.00