Learning Discrete State Abstractions With Deep Variational Inference
원문 초록
Abstraction is crucial for effective sequential decision making in domains with large state spaces. In this work, we propose an information bottleneck method for learning approximate bisimulations, a type of state abstraction. We use a deep neural encoder to map states onto continuous embeddings. We map these embeddings onto a discrete representation using an action-conditioned hidden Markov model, which is trained end-to-end with the neural network. Our method is suited for environments with high-dimensional states and learns from a stream of experience collected by an agent acting in a Markov decision process. Through this learned discrete abstract model, we can efficiently plan for unseen goals in a multi-goal Reinforcement Learning setting. We test our method in simplified robotic manipulation domains with image states. We also compare it against previous model-based approaches to finding bisimulations in discrete grid-world-like environments. Source code is available at https://github.com/ondrejba/discrete_abstractions.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
A Survey of Continual Reinforcement Learning
Actor-Critic Deep Reinforcement Learning for Solving Job Shop Scheduling Problems
TransDreamerV3: Implanting Transformer In DreamerV3
UProp: Investigating the Uncertainty Propagation of LLMs in Multi-Step Agentic Decision-Making
LLM-Stackelberg Games: Conjectural Reasoning Equilibria and Their Applications to Spearphishing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.