A New View on Planning in Online Reinforcement Learning
<|reference_start|>A New View on Planning in Online Reinforcement Learning: This paper investigates a new approach to model-based reinforcement learning using background planning: mixing (approximate) dynamic programming updates and model-free updates, similar to the Dyna architecture. Background planning with learned models is often worse than model-free alternatives, such as Double DQN, even though the former uses significantly more memory and computation. The fundamental problem is that learned models can be inaccurate and often generate invalid states, especially when iterated many steps. In this paper, we avoid this limitation by constraining background planning to a set of (abstract) subgoals and learning only local, subgoal-conditioned models. This goal-space planning (GSP) approach is more computationally efficient, naturally incorporates temporal abstraction for faster long-horizon planning and avoids learning the transition dynamics entirely. We show that our GSP algorithm can propagate value from an abstract space in a manner that helps a variety of base learners learn significantly faster in different domains.<|reference_end|>
@article{roice2024a,
    title={A New View on Planning in Online Reinforcement Learning},
    author={Kevin Roice, Parham Mohammad Panahi, Scott M. Jordan, Adam White,
  Martha White},
    journal={arXiv preprint arXiv:2406.01562},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.01562},
    primaryClass={cs.LG cs.AI}
}