paper-with-me

Papers

Wasserstein Barycenter Soft Actor-Critic

2025-06-11 · Zahra Shahrooei, Ali Baheri

Deep off-policy actor-critic algorithms have emerged as the leading framework for reinforcement learning in continuous control domains. However, most of these algorithms suffer from poor sample efficiency, especially in environments with sparse rewards. In this paper, we take a step towards addressing this issue by providing a principled directed exploration strategy. We propose Wasserstein Barycenter Soft Actor-Critic (WBSAC) algorithm, which benefits from a pessimistic actor for temporal difference learning and an optimistic actor to promote exploration. This is achieved by using the Wasserstein barycenter of the pessimistic and optimistic policies as the exploration policy and adjusting the degree of exploration throughout the learning process. We compare WBSAC with state-of-the-art off-policy actor-critic algorithms and show that WBSAC is more sample-efficient on MuJoCo continuous control tasks.

📄 PDF Abstract BibTeX arXiv:2506.10167

Code (0)

등록된 구현이 없습니다.

Tasks

continuous-controlContinuous ControlMuJoCo

Similar Papers 제목 키워드 기반

A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters

2018-09-12 · Lei Yang, Jia Li, Defeng Sun, Kim-Chuan Toh

We consider the problem of computing a Wasserstein barycenter for a set of discrete probability distributions with finite supports, which finds many applications in areas such as statistics, machine learning and image pr…

Learning to Generate Wasserstein Barycenters

2021-02-24 · Julien Lacombe, Julie Digne, Nicolas Courty, Nicolas Bonneel

Optimal transport is a notoriously difficult problem to solve numerically, with current approaches often remaining intractable for very large scale applications such as those encountered in machine learning. Wasserstein …

GPU

Solving Soft Clustering Ensemble via $k$-Sparse Discrete Wasserstein Barycenter

2021-12-01 · NeurIPS 2021 12 · Ruizhe Qin, Mengying Li, Hu Ding

Clustering ensemble is one of the most important problems in ensemble learning. Though it has been extensively studied in the past decades, the existing methods often suffer from the issues like high computational compl…

ClusteringClustering EnsembleEnsemble Learning

Dimensionality Reduction for Wasserstein Barycenter

2021-10-18 · NeurIPS 2021 12 · Zachary Izzo, Sandeep Silwal, Samson Zhou

The Wasserstein barycenter is a geometric construct which captures the notion of centrality among probability distributions, and which has found many applications in machine learning. However, most algorithms for finding…

Dimensionality Reduction

Fixed Support Tree-Sliced Wasserstein Barycenter

2021-09-08 · Yuki Takezawa, Ryoma Sato, Zornitsa Kozareva, Sujith Ravi 외

The Wasserstein barycenter has been widely studied in various fields, including natural language processing, and computer vision. However, it requires a high computational cost to solve the Wasserstein barycenter problem…