Ensemble And Auxiliary Tasks For Data-efficient Deep Reinforcement Learning

Abstract

Ensemble and auxiliary tasks are both well known to improve the performance of machine learning models when data is limited. However, the interaction between these two methods is not well studied, particularly in the context of deep reinforcement learning. In this paper, we study the effects of ensemble and auxiliary tasks when combined with the deep Q-learning algorithm. We perform a case study on ATARI games under limited data constraint. Moreover, we derive a refined bias-variance-covariance decomposition to analyze the different ways of learning ensembles and using auxiliary tasks, and use the analysis to help provide some understanding of the case study. Our code is open source and available at https://github.com/NUS-LID/RENAULT.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keymaulana2021ensemble

Code

• NUS-LID/RENAULT—

Related papers

• Improving Reinforcement Learning Efficiency With Auxiliary Tasks In Non-visual Environments: A Comparison (2023)2.26
• On The Effect Of Auxiliary Tasks On Representation Dynamics (2021)0.00
• Return-based Contrastive Representation Learning For Reinforcement Learning (2021)12.17
• Auxiliary Task Discovery Through Generate-and-test (2022)0.00
• Importance Of Using Appropriate Baselines For Evaluation Of Data-efficiency In Deep Reinforcement Learning For Atari (2020)0.00
• When Does Self-prediction Help? Understanding Auxiliary Tasks In Reinforcement Learning (2024)0.00
• Proto-value Networks: Scaling Representation Learning With Auxiliary Tasks (2023)0.00
• DEFT: Diverse Ensembles For Fast Transfer In Reinforcement Learning (2022)0.00