Toward Computationally Efficient Inverse Reinforcement Learning via Reward Shaping
Lauren H. Cooke · Harvey Klyne · David Bell · Cassidy Laidlaw · Milind Tambe · Finale Doshi-Velez
2024 Poster
in
Affinity Event: Tiny Papers Poster Session 6
in
Affinity Event: Tiny Papers Poster Session 6
Abstract
Inverse reinforcement learning (IRL) is computationally challenging, with common approaches requiring the solution of multiple reinforcement learning (RL) sub-problems. This work motivates the use of potential-based reward shaping to reduce the computational burden of each RL sub-problem. This work serves as a proof-of-concept and we hope will inspire future developments towards computationally efficient IRL.
Video
Chat is not available.
Successful Page Load