A Bandit Framework For Optimal Selection Of Reinforcement Learning Agents

Abstract

Deep Reinforcement Learning has been shown to be very successful in complex games, e.g. Atari or Go. These games have clearly defined rules, and hence allow simulation. In many practical applications, however, interactions with the environment are costly and a good simulator of the environment is not available. Further, as environments differ by application, the optimal inductive bias (architecture, hyperparameters, etc.) of a reinforcement agent depends on the application. In this work, we propose a multi-arm bandit framework that selects from a set of different reinforcement learning agents to choose the one with the best inductive bias. To alleviate the problem of sparse rewards, the reinforcement learning agents are augmented with surrogate rewards. This helps the bandit framework to select the best agents early, since these rewards are smoother and less sparse than the environment reward. The bandit has the double objective of maximizing the reward while the agents are learning an

Stats

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

Related papers

• Adapting Behaviour For Learning Progress (2019)0.00
• Unified Models Of Human Behavioral Agents In Bandits, Contextual Bandits And RL (2020)8.35
• Near-optimal Collaborative Learning In Bandits (2022)0.00
• Principal-agent Bandit Games With Self-interested And Exploratory Learning Agents (2024)0.00
• Adaptive Action Duration With Contextual Bandits For Deep Reinforcement Learning In Dynamic Environments (2025)0.00
• Bayesian Bandits: Balancing The Exploration-exploitation Tradeoff Via Double Sampling (2017)0.00
• Fitting Reinforcement Learning Model To Behavioral Data Under Bandits (2025)0.00
• Coordinated Exploration Via Intrinsic Rewards For Multi-agent Reinforcement Learning (2019)0.00