Optimistic Exploration in Reinforcement Learning Using Symbolic Model Estimates
Sarath Sreedharan, Michael Katz
摘要
There has been an increasing interest in using symbolic models along with reinforcement learning (RL) problems, where these coarser abstract models are used as a way to provide RL agents with higher level guidance. However, most of these works are inherently limited by their assumption of having an access to a symbolic approximation of the underlying problem. To address this issue, we introduce a new method for learning optimistic symbolic approximations of the underlying world model. We will see how these representations, coupled with fast diverse planners developed by the automated planning community, provide us with a new paradigm for optimistic exploration in sparse reward settings. We investigate the possibility of speeding up the learning process by generalizing learned model dynamics across similar actions with minimal human input. Finally, we evaluate the method, by testing it on multiple benchmark domains and compare it with other RL strategies.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- Reshaping Diverse PlanningMichael Katz, Shirin SohrabiAAAI 2020 · 被引用 55 次
- Bridging the Gap: Providing Post-Hoc Symbolic Explanations for Sequential Decision-Making Problems with Inscrutable RepresentationsSarath Sreedharan, Utkarsh Soni, Mudit Verma, Siddharth Srivastava 等ICLR 2022 · 被引用 39 次
- Learning Probably Approximately Complete and Safe Action Models for Stochastic WorldsBrendan Juba, Roni SternAAAI 2022 · 被引用 18 次
相关 Paper
- Leveraging Approximate Symbolic Models for Reinforcement Learning via Skill DiversityLin Guan, Sarath Sreedharan, Subbarao KambhampatiICML 2022 · 被引用 31 次
- Accelerating Exploration with Unlabeled Prior DataQiyang Li, Jason Zhang, Dibya Ghosh, Amy Zhang 等NeurIPS 2023 · 被引用 21 次
- Integrating Planning and Deep Reinforcement Learning via Automatic Induction of Task SubstructuresJung-Chun Liu, Chi-Hsien Chang, Shao-Hua Sun, Tian-Li YuICLR 2024 · 被引用 6 次
- Discovering symbolic policies with deep reinforcement learningMikel Landajuela, Brenden K. Petersen, Sookyung Kim, Cláudio P. Santiago 等ICML 2021 · 被引用 118 次
- Efficient Model-Based Reinforcement Learning Through Optimistic Thompson SamplingJasmine Bayrooti, Carl Henrik Ek, Amanda ProrokICLR 2025
