Plug and Play, Model-Based Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Sample-efficient generalisation of reinforcement learning approaches have always been a challenge, especially, for complex scenes with many components. In this work, we introduce Plug and Play Markov Decision Processes, an object-based representation that allows zero-shot integration of new objects from known object classes. This is achieved by representing the global transition dynamics as a union of local transition functions, each with respect to one active object in the scene. Transition dynamics from an object class can be pre-learnt and thus would be ready to use in a new environment. Each active object is also endowed with its reward function. Since there is no central reward function, addition or removal of objects can be handled efficiently by only updating the reward functions of objects involved. A new transfer learning mechanism is also proposed to adapt reward function in such cases. Experiments show that our representation can achieve sample-efficiency in a variety of set-ups.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 13 references that are in the map. First posted on arXiv 20 Aug 2021.
Builds on
8 of 13 references.
References · 8
- 2016Interaction Networks for Learning about Objects, Relations and Physicscited by 509
- 2019Deep Lagrangian Networks: Using Physics as Model Prior for Deep Learningcited by 212
- 2019PHYRE: A New Benchmark for Physical Reasoningcited by 137
- 2017Schema Networks: Zero-shot Transfer with a Generative Causal Model of Intuitive Physicscited by 58
- 2019COBRA: Data-Efficient Model-Based RL through Unsupervised Object Discovery and Curiosity-Driven Explorationcited by 57
- 2016Towards Deep Symbolic Reinforcement Learningcited by 42
- 2015Blocks and Fuel: Frameworks for deep learningcited by 3
- 2020Model-based Multi-Agent Reinforcement Learning with Cooperative Prioritized Sweepingcited by 2
Built on by
Not cited yet.