Optimistic Exploration in Reinforcement Learning Using Symbolic Model Estimates
Sarath Sreedharan, Michael Katz
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 45c65d0b-e371-4739-8633-799d24244353Builds on3
- Reshaping Diverse PlanningMichael Katz, Shirin SohrabiAAAI 2020 · 55 citations
- Bridging the Gap: Providing Post-Hoc Symbolic Explanations for Sequential Decision-Making Problems with Inscrutable RepresentationsSarath Sreedharan, Utkarsh Soni, Mudit Verma, Siddharth Srivastava et al.ICLR 2022 · 39 citations
- Learning Probably Approximately Complete and Safe Action Models for Stochastic WorldsBrendan Juba, Roni SternAAAI 2022 · 18 citations
Related papers
- Leveraging Approximate Symbolic Models for Reinforcement Learning via Skill DiversityLin Guan, Sarath Sreedharan, Subbarao KambhampatiICML 2022 · 31 citations
- Accelerating Exploration with Unlabeled Prior DataQiyang Li, Jason Zhang, Dibya Ghosh, Amy Zhang et al.NeurIPS 2023 · 21 citations
- 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 citations
- Discovering symbolic policies with deep reinforcement learningMikel Landajuela, Brenden K. Petersen, Sookyung Kim, Cláudio P. Santiago et al.ICML 2021 · 118 citations
- Efficient Model-Based Reinforcement Learning Through Optimistic Thompson SamplingJasmine Bayrooti, Carl Henrik Ek, Amanda ProrokICLR 2025
