mlsanityData to 14 Oct 2026

Efficient exploration with Double Uncertain Value Networks

arXiv 1711.10789 ↗First posted 29 Nov 2017cs.LG cs.AI stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

This paper studies directed exploration for reinforcement learning agents by tracking uncertainty about the value of each available action. We identify two sources of uncertainty that are relevant for exploration. The first originates from limited data (parametric uncertainty), while the second originates from the distribution of the returns (return uncertainty). We identify methods to learn these distributions with deep neural networks, where we estimate parametric uncertainty with Bayesian drop-out, while return uncertainty is propagated through the Bellman equation as a Gaussian distribution. Then, we identify that both can be jointly estimated in one network, which we call the Double Uncertain Value Network. The policy is directly derived from the learned distributions based on Thompson sampling. Experimental results show that both types of uncertainty may vastly improve learning in domains with a strong exploration challenge.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Nov 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 3; 2022: 4; 2023: 2; 2024: 4; 2025: 1; 2026: 2.

16 papers.

Sort:

By area: