Deep PQR: Solving Inverse Reinforcement Learning using Anchor Actions
Sinong Geng, Houssam Nassif, Carlos A. Manzanares, A. Max Reppen, Ronnie Sircar
Abstract
We propose a reward function estimation framework for inverse reinforcement learning with deep energy-based policies. We name our method PQR, as it sequentially estimates the Policy, the -function, and the Reward function by deep learning. PQR does not assume that the reward solely depends on the state, instead it allows for a dependency on the choice of action. Moreover, PQR allows for stochastic state transitions. To accomplish this, we assume the existence of one anchor action whose reward is known, typically the action of doing nothing, yielding no reward. We present both estimators and algorithms for the PQR method. When the environment transition is known, we prove that the PQR reward estimator uniquely recovers the true reward. With unknown transitions, we bound the estimation error of PQR. Finally, the performance of PQR is demonstrated by synthetic and real-world datasets.
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 e470e67c-f72c-416f-b04d-0f82be43604fCited by top-tier papers3
- Reward Identification in Inverse Reinforcement LearningKuno Kim, Shivam Garg, Kirankumar Shiragur, Stefano ErmonICML 2021 · 43 citations
- Reward-Consistent Dynamics Models are Strongly Generalizable for Offline Reinforcement LearningFan-Ming Luo, Tian Xu, Xingchen Cao, Yang YuICLR 2024 · 16 citations
- Improving Offline RL by Blending HeuristicsSinong Geng, Aldo Pacchiano, Andrey Kolobov, Ching-An ChengICLR 2024 · 12 citations
Related papers
- Inverse Reinforcement Learning from a Gradient-based LearnerGiorgia Ramponi, Gianluca Drappo, Marcello RestelliNeurIPS 2020 · 16 citations
- Identifiability in inverse reinforcement learningHaoyang Cao, Samuel N. Cohen, Lukasz SzpruchNeurIPS 2021 · 72 citations
- Decoding Rewards in Competitive Games: Inverse Game Theory with Entropy RegularizationJunyi Liao, Zihan Zhu, Ethan X. Fang, Zhuoran Yang et al.ICML 2025
- Deep Inverse Q-learning with ConstraintsGabriel Kalweit, Maria Hügle, Moritz Werling, Joschka BoedeckerNeurIPS 2020 · 39 citations
- Maximum-Likelihood Inverse Reinforcement Learning with Finite-Time GuaranteesSiliang Zeng, Chenliang Li, Alfredo García, Mingyi HongNeurIPS 2022 · 60 citations
