Efficient Inference For Inverse Reinforcement Learning And Dynamic Discrete Choice Models

Abstract

Inverse reinforcement learning (IRL) and dynamic discrete choice (DDC) models explain sequential decision-making by recovering reward functions that rationalize observed behavior. Flexible IRL methods typically rely on machine learning but provide no guarantees for valid inference, while classical DDC approaches impose restrictive parametric specifications and often require repeated dynamic programming. We develop a semiparametric framework for debiased inverse reinforcement learning that yields statistically efficient inference for a broad class of reward-dependent functionals in maximum entropy IRL and Gumbel-shock DDC models. We show that the log-behavior policy acts as a pseudo-reward that point-identifies policy value differences and, under a simple normalization, the reward itself. We then formalize these targets, including policy values under known and counterfactual softmax policies and functionals of the normalized reward, as smooth functionals of the behavior policy and trans

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyvanderlaan2025efficient

Related papers

• Inverse Reinforcement Learning With Explicit Policy Estimates (2021)2.26
• Distributional Inverse Reinforcement Learning (2025)0.00
• Inverse Reinforcement Learning With Simultaneous Estimation Of Rewards And Dynamics (2016)0.00
• Misspecification In Inverse Reinforcement Learning (2022)5.24
• Inverse Reinforcement Learning Using Just Classification And A Few Regressions (2025)0.00
• Inverse Reinforcement Learning Using Revealed Preferences And Passive Stochastic Optimization (2025)0.00
• Modeling And Interpreting Real-world Human Risk Decision Making With Inverse Reinforcement Learning (2019)0.00
• Partial Identifiability And Misspecification In Inverse Reinforcement Learning (2024)0.00