mlsanityData to 7 Oct 2026

Approximate Thompson Sampling via Epistemic Neural Networks

arXiv 2302.09205 ↗First posted 18 Feb 2023cs.LG cs.AIcited by 31

Not on the map. Why?

Abstract (arXiv)

Thompson sampling (TS) is a popular heuristic for action selection, but it requires sampling from a posterior distribution. Unfortunately, this can become computationally intractable in complex environments, such as those modeled using neural networks. Approximate posterior samples can produce effective actions, but only if they reasonably approximate joint predictive distributions of outputs across inputs. Notably, accuracy of marginal predictive distributions does not suffice. Epistemic neural networks (ENNs) are designed to produce accurate joint predictive distributions. We compare a range of ENNs through computational experiments that assess their performance in approximating TS across bandit and reinforcement learning environments. The results indicate that ENNs serve this purpose well and illustrate how the quality of joint predictive distributions drives performance. Further, we demonstrate that the textitepinet -- a small additive network that estimates uncertainty -- matches the performance of large ensembles at orders of magnitude lower computational cost. This enables effective application of TS with computation that scales gracefully to complex environments.

Key facts. Cited by 31 papers in the map (data through 7 Oct 2026). Builds on 23 of its 33 references that are in the map. First posted on arXiv 18 Feb 2023.

Builds on

23 of 33 references.

References · 23

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  3. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  4. 2015Weight Uncertainty in Neural Networkscited by 554
  5. 2016Deep Exploration via Bootstrapped DQNcited by 518
  6. 2017A Tutorial on Thompson Samplingcited by 420
  7. 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 307
  8. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  9. 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 218
  10. 2014Learning to Optimize via Information-Directed Samplingcited by 168
  11. 2017Deep Exploration via Randomized Value Functionscited by 155
  12. 2020Acme: A Research Framework for Distributed Reinforcement Learningcited by 146
11 more
  1. 2019Behaviour Suite for Reinforcement Learningcited by 129
  2. 2020Neural Thompson Samplingcited by 127
  3. 2021Epistemic Neural Networkscited by 120
  4. 2014Model-based Reinforcement Learning and the Eluder Dimensioncited by 116
  5. 2021Reinforcement Learning, Bit by Bitcited by 59
  6. 2014Near-optimal Reinforcement Learning in Factored MDPscited by 41
  7. 2015Bootstrapped Thompson Sampling and Deep Explorationcited by 40
  8. 2020Hypermodels for Explorationcited by 37
  9. 2021From Predictions to Decisions: The Importance of Joint Predictive Distributionscited by 28
  10. 2022Sample-Then-Optimize Batch Neural Thompson Samplingcited by 25
  11. 2021The Neural Testbed: Evaluating Joint Predictionscited by 22

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 5; 2024: 12; 2025: 7; 2026: 7.

31 papers.

Sort:

By area:

  1. 2023Supervised Pretraining Can Learn In-Context Reinforcement Learningcited by 137
  2. 2024Self-Exploring Language Models: Active Preference Elicitation for Online Alignmentcited by 63
  3. 2024Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AIcited by 60
  4. 2023Making RL with Preference-based Feedback Efficient via Randomizationcited by 46
  5. 2024Efficient Exploration for LLMscited by 44
  6. 2025Toward Efficient Exploration by Large Language Model Agentscited by 15
  7. 2023Pearl: A Production-ready Reinforcement Learning Agentcited by 9
  8. 2024On the Importance of Uncertainty in Decision-Making with Large Language Modelscited by 9
  9. 2023Shattering the Agent-Environment Interface for Fine-Tuning Inclusive Language Modelscited by 8
  10. 2023Neural Exploitation and Exploration of Contextual Banditscited by 7
  11. 2025Adaptive Elicitation of Latent Information Using Natural Languagecited by 7
  12. 2024Q-Star Meets Scalable Posterior Sampling: Bridging Theory and Practice via HyperAgentcited by 6
19 more
  1. 2025Contextual Thompson Sampling via Generation of Missing Datacited by 5
  2. 2025IL-SOAR : Imitation Learning with Soft Optimistic Actor cRiticcited by 5
  3. 2026Emergence of Exploration in Policy Gradient Reinforcement Learning via Retryingcited by 5
  4. 2024Satisficing Exploration for Deep Reinforcement Learningcited by 4
  5. 2024Simple, unified analysis of Johnson-Lindenstrauss with applicationscited by 1
  6. 2024Sequential Decision Making with Expert Demonstrations under Unobserved Heterogeneitycited by 1
  7. 2024A Bayesian Approach to Online Planningcited by 1
  8. 2024Isoperimetry is All We Need: Langevin Posterior Sampling for RL with Sublinear Regretcited by 1
  9. 2025Improved Exploration in GFlownets via Enhanced Epistemic Neural Networkscited by 1
  10. 2026BFTS: Thompson Sampling with Bayesian Additive Regression Treescited by 1
  11. 2026Value Bonuses using Ensemble Errors for Exploration in Reinforcement Learningcited by 1
  12. 2026Retry Policy Gradients in Continuous Action Spacescited by 1
  13. 2024Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Banditscited by 0
  14. 2024BOTS: Batch Bayesian Optimization of Extended Thompson Sampling for Severely Episode-Limited RL Settingscited by 0
  15. 2025Thompson Sampling in Online RLHF with General Function Approximationcited by 0
  16. 2025LAVA: Language Driven Scalable and Versatile Traffic Video Analyticscited by 0
  17. 2026Provably avoiding over-optimization in Direct Preference Optimization without knowing the data distributioncited by 0
  18. 2026Efficient and Uncertainty-Aware Diffusion Framework for Offline-to-Online Reinforcement Learningcited by 0
  19. 2026Structure-preserving uncertainty quantification for GENERIC dynamicscited by 0