mlsanityData to 14 Oct 2026

Unsupervised Reinforcement Learning for Transferable Manipulation Skill Discovery

arXiv 2204.13906 ↗First posted 29 Apr 2022cs.RO cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Current reinforcement learning (RL) in robotics often experiences difficulty in generalizing to new downstream tasks due to the innate task-specific training paradigm. To alleviate it, unsupervised RL, a framework that pre-trains the agent in a task-agnostic manner without access to the task-specific reward, leverages active exploration for distilling diverse experience into essential skills or reusable knowledge. For exploiting such benefits also in robotic manipulation, we propose an unsupervised method for transferable manipulation skill discovery that ties structured exploration toward interacting behavior and transferable skill learning. It not only enables the agent to learn interaction behavior, the key aspect of the robotic manipulation learning, without access to the environment reward, but also to generalize to arbitrary downstream manipulation tasks with the learned task-agnostic skills. Through comparative experiments, we show that our approach achieves the most diverse interacting behavior and significantly improves sample efficiency in downstream tasks including the extension to multi-object, multitask problems.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 28 of its 28 references that are in the map. First posted on arXiv 29 Apr 2022.

Builds on

28 of 28 references.

References · 28

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  3. 2016Progressive Neural Networkscited by 1,361
  4. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  5. 2019Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learningcited by 1,204
  6. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
  7. 2017Hindsight Experience Replaycited by 1,136
  8. 2018Exploration by Random Network Distillationcited by 993
  9. 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 752
  10. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
  11. 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 506
  12. 2016Deep Reinforcement Learning for Robotic Manipulation with Asynchronous Off-Policy Updatescited by 353
16 more
  1. 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 313
  2. 2019Stabilizing Transformers for Reinforcement Learningcited by 270
  3. 2019Self-Supervised Exploration via Disagreementcited by 265
  4. 2017Count-Based Exploration with Neural Density Modelscited by 257
  5. 2020Multi-Task Reinforcement Learning with Soft Modularizationcited by 143
  6. 2016Learning Modular Neural Network Policies for Multi-Task and Multi-Robot Transfercited by 127
  7. 2017A Laplacian Framework for Option Discovery in Reinforcement Learningcited by 110
  8. 2019MCP: Learning Composable Hierarchical Control with Multiplicative Compositional Policiescited by 108
  9. 2018Unsupervised Control Through Non-Parametric Discriminative Rewardscited by 102
  10. 2019Regularizing Deep Multi-Task Networks using Orthogonal Gradientscited by 36
  11. 2020Emergent Real-World Robotic Skills via Unsupervised Off-Policy Reinforcement Learningcited by 31
  12. 2021Self-supervised Representation Learning with Relative Predictive Codingcited by 28
  13. 2020Motion Planner Augmented Reinforcement Learning for Robot Manipulation in Obstructed Environmentscited by 23
  14. 2020Neural Methods for Point-wise Dependency Estimationcited by 22
  15. 2019Composing Task-Agnostic Policies with Deep Reinforcement Learningcited by 20
  16. 2020Mutual Information-based State-Control for Intrinsically Motivated Reinforcement Learningcited by 2

Built on by

Cited by year (2026 to 14 Oct)

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

5 papers.