The Interpretability of Codebooks in Model-Based Reinforcement Learning is Limited
원문 초록
Interpretability of deep reinforcement learning systems could assist operators with understanding how they interact with their environment. Vector quantization methods -- also called codebook methods -- discretize a neural network's latent space that is often suggested to yield emergent interpretability. We investigate whether vector quantization in fact provides interpretability in model-based reinforcement learning. Our experiments, conducted in the reinforcement learning environment Crafter, show that the codes of vector quantization models are inconsistent, have no guarantee of uniqueness, and have a limited impact on concept disentanglement, all of which are necessary traits for interpretability. We share insights on why vector quantization may be fundamentally insufficient for model interpretability.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Relative Entropy Regularized Reinforcement Learning for Efficient Encrypted Policy Synthesis
Deep Reinforcement Learning with Gradient Eligibility Traces
Generalized Adaptive Transfer Network: Enhancing Transfer Learning in Reinforcement Learning Across Domains
TransDreamerV3: Implanting Transformer In DreamerV3
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty
토론
이 논문과 연결된 포럼 글이 아직 없습니다.