Efficient Anti-exploration via VQVAE and Fuzzy Clustering in Offline Reinforcement Learning
On the map: Offline RL and imitation learning from data → Offline RL algorithms
Abstract (arXiv)
Pseudo-count is an effective anti-exploration method in offline reinforcement learning (RL) by counting state-action pairs and imposing a large penalty on rare or unseen state-action pair data. Existing anti-exploration methods count continuous state-action pairs by discretizing these data, but often suffer from the issues of dimension disaster and information loss in the discretization process, leading to efficiency and performance reduction, and even failure of policy learning. In this paper, a novel anti-exploration method based on Vector Quantized Variational Autoencoder (VQVAE) and fuzzy clustering in offline RL is proposed. We first propose an efficient pseudo-count method based on the multi-codebook VQVAE to discretize state-action pairs, and design an offline RL anti-exploitation method based on the proposed pseudo-count method to handle the dimension disaster issue and improve the learning efficiency. In addition, a codebook update mechanism based on fuzzy C-means (FCM) clustering is developed to improve the use rate of vectors in codebooks, addressing the information loss issue in the discretization process. The proposed method is evaluated on the benchmark of Datasets for Deep Data-Driven Reinforcement Learning (D4RL), and experimental results show that the proposed method performs better and requires less computing cost in multiple complex tasks compared to state-of-the-art (SOTA) methods.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. Builds on 27 of its 42 references that are in the map. First posted on arXiv 8 Feb 2026.
Builds on
27 of 42 references.
Closest ancestors · 14
Same direction, newest first
- 2024Doubly Mild Generalization for Offline Reinforcement Learning12 Nov
- 2024Grid-Mapping Pseudo-Count Constraint for Offline Reinforcement Learning3 Apr
- 2024ODICE: Revealing the Mystery of Distribution Correction Estimation via Orthogonal-gradient Update1 Feb
- 2023Model-based Offline Reinforcement Learning with Count-based Conservatism21 Jul
- 2023Anti-Exploration by Random Network Distillation31 Jan
- 2022Mildly Conservative Q-Learning for Offline Reinforcement Learning9 Jun
- 2022A Survey on Offline Reinforcement Learning: Taxonomy, Review, and Open Problems2 Mar
- 2022The Challenges of Exploration for Offline Reinforcement Learning27 Jan
- 2021Offline Reinforcement Learning with Implicit Q-Learning12 Oct
- 2021Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble4 Oct
- 2021A Minimalist Approach to Offline Reinforcement Learning12 Jun
- 2021Offline Reinforcement Learning as Anti-Exploration11 Jun
2 more
Other references · 13
- 2017Neural Discrete Representation Learningcited by 4,650
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 833
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
- 2017Count-Based Exploration with Neural Density Modelscited by 255
- 2018Count-Based Exploration with the Successor Representationcited by 112
- 2023Online Clustered Codebookcited by 55
- 2021Vector Quantized Models for Planningcited by 47
- 2021MADE: Exploration via Maximizing Deviation from Explored Regionscited by 40
- 2023HQ-VAE: Hierarchical Discrete Representation Learning with Variational Bayescited by 27
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Policy-Based Trajectory Clustering in Offline Reinforcement Learning
- 2021Interpretable performance analysis towards offline reinforcement learning: A dataset perspective
- 2021False Correlation Reduction for Offline Reinforcement Learning
- 2021A Dataset Perspective on Offline Reinforcement Learning
- 2024On Sample-Efficient Offline Reinforcement Learning: Data Diversity, Posterior Sampling, and Beyond
- 2023Offline Reinforcement Learning with Imbalanced Datasets
- 2023Towards Robust Offline Reinforcement Learning under Diverse Data Corruption
- 2024CDSA: Conservative Denoising Score-based Algorithm for Offline Reinforcement Learning