mlsanityData to 7 Oct 2026

State-Aware Variational Thompson Sampling for Deep Q-Networks

arXiv 2102.03719 ↗First posted 7 Feb 2021cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Thompson sampling is a well-known approach for balancing exploration and exploitation in reinforcement learning. It requires the posterior distribution of value-action functions to be maintained; this is generally intractable for tasks that have a high dimensional state-action space. We derive a variational Thompson sampling approximation for DQNs which uses a deep network whose parameters are perturbed by a learned variational noise distribution. We interpret the successful NoisyNets method citefortunato2018noisy as an approximation to the variational Thompson sampling method that we derive. Further, we propose State Aware Noisy Exploration (SANE) which seeks to improve on NoisyNets by allowing a non-uniform perturbation, where the amount of parameter perturbation is conditioned on the state of the agent. This is done with the help of an auxiliary perturbation module, whose output is state dependent and is learnt end to end with gradient descent. We hypothesize that such state-aware noisy exploration is particularly useful in problems where exploration in certain textithigh risk states may result in the agent failing badly. We demonstrate the effectiveness of the state-aware exploration method in the off-policy setting by augmenting DQNs with the auxiliary perturbation module.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 19 of its 34 references that are in the map. First posted on arXiv 7 Feb 2021.

Builds on

19 of 34 references.

References · 19

  1. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  2. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  3. 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
  4. 2016Deep Exploration via Bootstrapped DQNcited by 518
  5. 2016Deep Reinforcement Learning for Robotic Manipulation with Asynchronous Off-Policy Updatescited by 342
  6. 2017Noisy Networks for Explorationcited by 262
  7. 2017Count-Based Exploration with Neural Density Modelscited by 255
  8. 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 218
  9. 2017Parameter Space Noise for Explorationcited by 158
  10. 2015Incentivizing Exploration In Reinforcement Learning With Deep Predictive Modelscited by 154
  11. 2017Stochastic Neural Networks for Hierarchical Reinforcement Learningcited by 124
  12. 2016Why is Posterior Sampling Better than Optimism for Reinforcement Learning?cited by 116
7 more
  1. 2014Generalization and Exploration via Randomized Value Functionscited by 112
  2. 2017Surprise-Based Intrinsic Motivation for Deep Reinforcement Learningcited by 83
  3. 2018Efficient Exploration through Bayesian Deep Q-Networkscited by 67
  4. 2015Bootstrapped Thompson Sampling and Deep Explorationcited by 40
  5. 2017Deep Variation-structured Reinforcement Learning for Visual Relationship and Attribute Detectioncited by 28
  6. 2019Prioritized Sequence Experience Replaycited by 20
  7. 2018NADPEx: An on-policy temporally consistent exploration method for deep reinforcement learningcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 0; 2024: 1; 2025: 1; 2026: 1.

5 papers.