Entropy, Vol. 25, Pages 188: Maximum Entropy Exploration in Contextual Bandits with Neural Networks and Energy Based Models

Entropy, Vol. 25, Pages 188: Maximum Entropy Exploration in Contextual Bandits with Neural Networks and Energy Based Models

Entropy doi: 10.3390/e25020188

Authors: Adam Elwood Marco Leonardi Ashraf Mohamed Alessandro Rozza

Contextual bandits can solve a huge range of real-world problems. However, current popular algorithms to solve them either rely on linear models or unreliable uncertainty estimation in non-linear models, which are required to deal with the exploration–exploitation trade-off. Inspired by theories of human cognition, we introduce novel techniques that use maximum entropy exploration, relying on neural networks to find optimal policies in settings with both continuous and discrete action spaces. We present two classes of models, one with neural networks as reward estimators, and the other with energy based models, which model the probability of obtaining an optimal reward given an action. We evaluate the performance of these models in static and dynamic contextual bandit simulation environments. We show that both techniques outperform standard baseline algorithms, such as NN HMC, NN Discrete, Upper Confidence Bound, and Thompson Sampling, where energy based models have the best overall performance. This provides practitioners with new techniques that perform well in static and dynamic settings, and are particularly well suited to non-linear scenarios with continuous action spaces.