mlsanityData to 7 Oct 2026

Wasserstein Actor-Critic: Directed Exploration via Optimism for Continuous-Actions Control

arXiv 2303.02378 ↗First posted 4 Mar 2023cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Uncertainty quantification has been extensively used as a means to achieve efficient directed exploration in Reinforcement Learning (RL). However, state-of-the-art methods for continuous actions still suffer from high sample complexity requirements. Indeed, they either completely lack strategies for propagating the epistemic uncertainty throughout the updates, or they mix it with aleatoric uncertainty while learning the full return distribution (e.g., distributional RL). In this paper, we propose Wasserstein Actor-Critic (WAC), an actor-critic architecture inspired by the recent Wasserstein Q-Learning (WQL) citepwql, that employs approximate Q-posteriors to represent the epistemic uncertainty and Wasserstein barycenters for uncertainty propagation across the state-action space. WAC enforces exploration in a principled way by guiding the policy learning process with the optimization of an upper bound of the Q-value estimates. Furthermore, we study some peculiar issues that arise when using function approximation, coupled with the uncertainty estimation, and propose a regularized loss for the uncertainty estimation. Finally, we evaluate our algorithm on standard MujoCo tasks as well as suite of continuous-actions domains, where exploration is crucial, in comparison with state-of-the-art baselines.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 13 of its 30 references that are in the map. First posted on arXiv 4 Mar 2023.

Builds on

13 of 30 references.

References · 13

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  2. 2015Trust Region Policy Optimizationcited by 2,503
  3. 2017A Distributional Perspective on Reinforcement Learningcited by 743
  4. 2018Is Q-learning Provably Efficient?cited by 485
  5. 2017Distributional Reinforcement Learning with Quantile Regressioncited by 464
  6. 2021Randomized Ensembled Double Q-Learning: Learning Fast Without a Modelcited by 278
  7. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  8. 2020SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learningcited by 150
  9. 2019Better Exploration with Optimistic Actor-Criticcited by 88
  10. 2017The Uncertainty Bellman Equation and Explorationcited by 81
  11. 2019Distributional Reinforcement Learning for Efficient Explorationcited by 59
  12. 2021Tactical Optimism and Pessimism for Deep Reinforcement Learningcited by 55
1 more
  1. 2021MADE: Exploration via Maximizing Deviation from Explored Regionscited by 40

Built on by

Cited by year (2026 to 7 Oct)

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

5 papers.