Domain Adaptation for Offline Reinforcement Learning with Limited Samples
<|reference_start|>Domain Adaptation for Offline Reinforcement Learning with Limited Samples: Offline reinforcement learning (RL) learns effective policies from a static target dataset. Despite state-of-the-art (SOTA) offline RL algorithms being promising, they highly rely on the quality of the target dataset. The performance of SOTA algorithms can degrade in scenarios with limited samples in the target dataset, which is often the case in real-world applications. To address this issue, domain adaptation that leverages auxiliary samples from related source datasets (such as simulators) can be beneficial. In this context, determining the optimal way to trade off the source and target datasets remains a critical challenge in offline RL. To the best of our knowledge, this paper proposes the first framework that theoretically and experimentally explores how the weight assigned to each dataset affects the performance of offline RL. We establish the performance bounds and convergence neighborhood of our framework, both of which depend on the selection of the weight. Furthermore, we identify the existence of an optimal weight for balancing the two datasets. All theoretical guarantees and optimal weight depend on the quality of the source dataset and the size of the target dataset. Our empirical results on the well-known Procgen Benchmark substantiate our theoretical contributions.<|reference_end|>
@article{chen2024domain,
    title={Domain Adaptation for Offline Reinforcement Learning with Limited
  Samples},
    author={Weiqin Chen, Sandipan Mishra and Santiago Paternain},
    journal={arXiv preprint arXiv:2408.12136},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.12136},
    primaryClass={cs.LG stat.ML}
}