Less is more -- the Dispatcher/ Executor principle for multi-task Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Humans instinctively know how to neglect details when it comes to solve complex decision making problems in environments with unforeseeable variations. This abstraction process seems to be a vital property for most biological systems and helps to 'abstract away' unnecessary details and boost generalisation. In this work we introduce the dispatcher/ executor principle for the design of multi-task Reinforcement Learning controllers. It suggests to partition the controller in two entities, one that understands the task (the dispatcher) and one that computes the controls for the specific device (the executor) - and to connect these two by a strongly regularizing communication channel. The core rationale behind this position paper is that changes in structure and design principles can improve generalisation properties and drastically enforce data-efficiency. It is in some sense a 'yes, and ...' response to the current trend of using large neural networks trained on vast amounts of data and bet on emerging generalisation properties. While we agree on the power of scaling - in the sense of Sutton's 'bitter lesson' - we will give some evidence, that considering structure and adding design principles can be a valuable and critical component in particular when data is not abundant and infinite, but is a precious resource.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 15 of its 25 references that are in the map. First posted on arXiv 14 Dec 2023.
Builds on
15 of 25 references.
References · 15
- 2017Attention Is All You Needcited by 59,932
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
- 2023RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Controlcited by 2,993
- 2022RT-1: Robotics Transformer for Real-World Control at Scalecited by 2,007
- 2015End-to-End Training of Deep Visuomotor Policiescited by 847
- 2022A Generalist Agentcited by 802
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 436
- 2018Maximum a Posteriori Policy Optimisationcited by 318
- 2018Learning by Playing - Solving Sparse Reward Tasks from Scratchcited by 164
- 2021Beyond Pick-and-Place: Tackling Robotic Stacking of Diverse Shapescited by 70
- 2021Hierarchical Task Learning from Language Instructions with Unified Transformers and Self-Monitoringcited by 53
- 2021Collect & Infer -- a fresh look at data-efficient Reinforcement Learningcited by 17
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.