RAPID-RL: A Reconfigurable Architecture with Preemptive-Exits for Efficient Deep-Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Present-day Deep Reinforcement Learning (RL) systems show great promise towards building intelligent agents surpassing human-level performance. However, the computational complexity associated with the underlying deep neural networks (DNNs) leads to power-hungry implementations. This makes deep RL systems unsuitable for deployment on resource-constrained edge devices. To address this challenge, we propose a reconfigurable architecture with preemptive exits for efficient deep RL (RAPID-RL). RAPID-RL enables conditional activation of DNN layers based on the difficulty level of inputs. This allows to dynamically adjust the compute effort during inference while maintaining competitive performance. We achieve this by augmenting a deep Q-network (DQN) with side-branches capable of generating intermediate predictions along with an associated confidence score. We also propose a novel training methodology for learning the actions and branch confidence scores in a dynamic RL setting. Our experiments evaluate the proposed framework for Atari 2600 gaming tasks and a realistic Drone navigation task on an open-source drone simulator (PEDRA). We show that RAPID-RL incurs 0.34x (0.25x) number of operations (OPS) while maintaining performance above 0.88x (0.91x) on Atari (Drone navigation) tasks, compared to a baseline-DQN without any side-branches. The reduction in OPS leads to fast and efficient inference, proving to be highly beneficial for the resource-constrained edge where making quick decisions with minimal compute is essential.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 28 references that are in the map. First posted on arXiv 16 Sep 2021.
Builds on
19 of 28 references.
References · 19
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2015Trust Region Policy Optimizationcited by 2,580
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
- 2015Prioritized Experience Replaycited by 1,099
- 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 849
- 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 786
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 785
- 2017A Distributional Perspective on Reinforcement Learningcited by 765
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
- 2017AirSim: High-Fidelity Visual and Physical Simulation for Autonomous Vehiclescited by 523
7 more
- 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 434
- 2015Understanding Neural Networks Through Deep Visualizationcited by 334
- 2017Noisy Networks for Explorationcited by 266
- 2017Distributed Deep Neural Networks over the Cloud, the Edge and End Devicescited by 120
- 2016Binarized Neural Networks: Training Deep Neural Networks with Weights and Activations Constrained to +1 or -1cited by 105
- 2015Conditional Deep Learning for Energy-Efficient and Enhanced Pattern Recognitioncited by 67
- 2019Autonomous Navigation via Deep Reinforcement Learning for Resource Constraint Edge Nodes using Transfer Learningcited by 19
Built on by
Citing papers per year: 2022: 1.
1 paper.