Bayesian Nonparametrics for Offline Skill Discovery
On the map: Offline RL and imitation learning from data → Offline RL algorithms
Abstract (arXiv)
Skills or low-level policies in reinforcement learning are temporally extended actions that can speed up learning and enable complex behaviours. Recent work in offline reinforcement learning and imitation learning has proposed several techniques for skill discovery from a set of expert trajectories. While these methods are promising, the number K of skills to discover is always a fixed hyperparameter, which requires either prior knowledge about the environment or an additional parameter search to tune it. We first propose a method for offline learning of options (a particular skill framework) exploiting advances in variational inference and continuous relaxations. We then highlight an unexplored connection between Bayesian nonparametrics and offline skill discovery, and show how to obtain a nonparametric version of our model. This version is tractable thanks to a carefully structured approximate posterior with a dynamically-changing number of options, removing the need to specify K. We also show how our nonparametric extension can be applied in other skill frameworks, and empirically demonstrate that our method can outperform state-of-the-art offline skill learning algorithms across a variety of environments. Our code is available at https://github.com/layer6ai-labs/BNPO .
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. Builds on 30 of its 70 references that are in the map. First posted on arXiv 9 Feb 2022.
Builds on
30 of 70 references.
Closest ancestors · 1
Same direction, newest first
Other references · 29
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016OpenAI Gymcited by 1,736
- 2016Generative Adversarial Imitation Learningcited by 1,597
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 752
- 2015Importance Weighted Autoencoderscited by 456
- 2016The Option-Critic Architecturecited by 448
- 2017FeUdal Networks for Hierarchical Reinforcement Learningcited by 337
17 more
- 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 313
- 2018Distributed Prioritized Experience Replaycited by 269
- 2016Variational Intrinsic Controlcited by 267
- 2017Stochastic Neural Networks for Hierarchical Reinforcement Learningcited by 124
- 2018Variational Option Discovery Algorithmscited by 122
- 2017Sticking the Landing: Simple, Lower-Variance Gradient Estimators for Variational Inferencecited by 98
- 2018TACO: Learning Task Decomposition via Temporal Alignment for Controlcited by 62
- 2020Learning Robot Skills with Temporal Variational Inferencecited by 54
- 2017Multi-Level Discovery of Deep Optionscited by 51
- 2016Stick-Breaking Variational Autoencoderscited by 44
- 2018Directed-Info GAIL: Learning Hierarchical Policies from Unsegmented Demonstrations using Directed Informationcited by 41
- 2020Rao-Blackwellizing the Straight-Through Gumbel-Softmax Gradient Estimatorcited by 37
- 2020Estimating Gradients for Discrete Random Variables by Sampling without Replacementcited by 31
- 2020Options of Interest: Temporal Abstraction with Interest Functionscited by 30
- 2019Invertible Gaussian Reparameterization: Revisiting the Gumbel-Softmaxcited by 18
- 2018An Atari Model Zoo for Analyzing, Visualizing, and Comparing Deep Reinforcement Learning Agentscited by 15
- 2019A New Distribution on the Simplex with Auto-Encoding Applicationscited by 3
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 2.
5 papers.
- 2022Verifying the Union of Manifolds Hypothesis for Image Datacited by 64
- 2023Efficient Planning with Latent Diffusioncited by 12
- 2022Beyond Rewards: a Hierarchical Perspective on Offline Multiagent Behavioral Analysiscited by 3
- 2025Structural Information-based Hierarchical Diffusion for Offline Reinforcement Learningcited by 3
- 2025Behaviour Discovery and Attribution for Explainable Reinforcement Learningcited by 2
- 2025Structural Information-based Hierarchical Diffusion for Offline Reinforcement Learning26 Sep 2025
- 2025Behaviour Discovery and Attribution for Explainable Reinforcement Learning19 Mar 2025
- 2023Efficient Planning with Latent Diffusion30 Sep 2023
- 2022Verifying the Union of Manifolds Hypothesis for Image Data6 Jul 2022
- 2022Beyond Rewards: a Hierarchical Perspective on Offline Multiagent Behavioral Analysis17 Jun 2022
Similar, not cited
Close in wording, no citation either way
- 2023Offline Diversity Maximization Under Imitation Constraints
- 2025Robotic Long-Horizon Manipulation with Bayesian Non-parametric Skill Priors
- 2024Robust Policy Learning via Offline Skill Diffusion
- 2025Efficient Reinforcement Learning by Guiding World Models with Non-Curated Data
- 2021Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism
- 2025Using Non-Expert Data to Robustify Imitation Learning via Offline Reinforcement Learning
- 2025Beyond Non-Expert Demonstrations: Outcome-Driven Action Constraint for Offline Reinforcement Learning
- 2023Fighting Uncertainty with Gradients: Offline Reinforcement Learning via Diffusion Score Matching