paper-with-me

Papers

ComSD: Balancing Behavioral Quality and Diversity in Unsupervised Skill Discovery

2023-09-29 · Xin Liu, Yaran Chen, Dongbin Zhao

This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. Unsupervised skill discovery seeks to acquire different useful skills without extrinsic reward via unsupervised Reinforcement Learning (RL), with the discovered skills efficiently adapting to multiple downstream tasks in various ways. However, recent advanced skill discovery methods struggle to well balance state exploration and skill diversity, particularly when the potential skills are rich and hard to discern. In this paper, we propose \textbf{Co}ntrastive dyna\textbf{m}ic \textbf{S}kill \textbf{D}iscovery \textbf{(ComSD)}\footnote{Code and videos: https://github.com/liuxin0824/ComSD} which generates diverse and exploratory unsupervised skills through a novel intrinsic incentive, named contrastive dynamic reward. It contains a particle-based exploration reward to make agents access far-reaching states for exploratory skill acquisition, and a novel contrastive diversity reward to promote the discriminability between different skills. Moreover, a novel dynamic weighting mechanism between the above two rewards is proposed to balance state exploration and skill diversity, which further enhances the quality of the discovered skills. Extensive experiments and analysis demonstrate that ComSD can generate diverse behaviors at different exploratory levels for multi-joint robots, enabling state-of-the-art adaptation performance on challenging downstream tasks. It can also discover distinguishable and far-reaching exploration skills in the challenging tree-like 2D maze.

📄 PDF Abstract BibTeX arXiv:2309.17203

Code (1)

liuxin0824/comsd 공식 구현 pytorch

Tasks

Contrastive LearningDiversityReinforcement Learning (RL)Unsupervised Reinforcement Learning

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음

Similar Papers 제목 키워드 기반

Vector Quantized-Elites: Unsupervised and Problem-Agnostic Quality-Diversity Optimization

2025-04-10 · Constantinos Tsakonas, Konstantinos Chatzilygeroudis

Quality-Diversity algorithms have transformed optimization by prioritizing the discovery of diverse, high-performing solutions over a single optimal result. However, traditional Quality-Diversity methods, such as MAP-Eli…

Diversity

Autonomous skill discovery with Quality-Diversity and Unsupervised Descriptors

2019-05-28 · Antoine Cully

Quality-Diversity optimization is a new family of optimization algorithms that, instead of searching for a single optimal solution to solving a task, searches for a large collection of solutions that all solve the task i…

Dimensionality ReductionDiversity

AutoQD: Automatic Discovery of Diverse Behaviors with Quality-Diversity Optimization

2025-06-05 · Saeed Hedayatian, Stefanos Nikolaidis

Quality-Diversity (QD) algorithms have shown remarkable success in discovering diverse, high-performing solutions, but rely heavily on hand-crafted behavioral descriptors that constrain exploration to predefined notions …

continuous-controlContinuous ControlDiversitySequential Decision Making+1

The Essence of Balance for Self-Improving Agents in Vision-and-Language Navigation

2026-04-21 · Zhen Liu, Yuhan Liu, Jinjun Wang, Jianyi Liu 외 arxiv

In vision-and-language navigation (VLN), self-improvement from policy-induced experience, using only standard VLN action supervision, critically depends on balancing behavioral diversity and learning stability, which gov…

Mapping Hearthstone Deck Spaces through MAP-Elites with Sliding Boundaries

2019-04-24 · Matthew C. Fontaine, Scott Lee, L. B. Soros, Fernando De Mesentier Silva 외

Quality diversity (QD) algorithms such as MAP-Elites have emerged as a powerful alternative to traditional single-objective optimization methods. They were initially applied to evolutionary robotics problems such as loco…

Diversity