Semiparametric Double Reinforcement Learning with Applications to Long-Term Causal Inference
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
Double reinforcement learning (DRL) provides efficient off-policy inference for policy values in nonparametric Markov decision processes (MDPs), but fully nonparametric estimators can be unstable when intertemporal overlap is weak and occupancy ratios are high-dimensional. This limitation is especially relevant for long-term causal inference from randomized experiments: randomization ensures overlap in treatment assignment, but not over future state trajectories induced by continued intervention use. We develop semiparametric DRL for continuous linear functionals of the infinite-horizon Q-function. Rather than impose linear MDP structure on the reward and transition laws, we place working semiparametric restrictions on the Q-function itself, the solution of the discounted Bellman equation. When correct, these restrictions can improve efficiency relative to unrestricted DRL while allowing rich, possibly infinite-dimensional models. To avoid relying on correct specification, we define the estimand through weighted Bellman-residual minimization. The resulting projection target remains meaningful under misspecification and recovers the original functional under correct specification. For this class of parameters, we derive efficient influence functions and efficiency bounds, construct model-robust automatically debiased estimators, and develop minimax criteria for estimating the Q- and Riesz functions. Under correct specification, optimally weighted versions attain the semiparametric efficiency bound in the restricted model.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. First posted on arXiv 12 Jan 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 4; 2026: 3.
7 papers.
- 2026Calibeating Prediction-Powered Inferencecited by 4
- 2025Bellman Calibration for V-Learning in Offline Reinforcement Learningcited by 3
- 2025Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Modelscited by 3
- 2025Fitted Q-Evaluation without Bellman Completeness via Occupancy Weightingcited by 2
- 2026Fitted Occupancy-Ratio Evaluation without Bellman Completenesscited by 1
- 2025An Orthogonal Learner for Individualized Outcomes in Markov Decision Processescited by 0
- 2026Bellman Calibration for Marginalized Importance Weighting in Offline Reinforcement Learningcited by 0
- 2026Bellman Calibration for Marginalized Importance Weighting in Offline Reinforcement Learning25 Aug 2026
- 2026Fitted Occupancy-Ratio Evaluation without Bellman Completeness6 Jul 2026
- 2026Calibeating Prediction-Powered Inference23 Apr 2026
- 2025Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Models30 Dec 2025
- 2025Fitted Q-Evaluation without Bellman Completeness via Occupancy Weighting29 Dec 2025
- 2025Bellman Calibration for V-Learning in Offline Reinforcement Learning29 Dec 2025
- 2025An Orthogonal Learner for Individualized Outcomes in Markov Decision Processes30 Sep 2025
Similar, not cited
Close in wording, no citation either way
- 2021Proximal Reinforcement Learning: Efficient Off-Policy Evaluation in Partially Observed Markov Decision Processes
- 2021Near-Optimal Offline Reinforcement Learning via Double Variance Reduction
- 2023Offline Primal-Dual Reinforcement Learning for Linear MDPs
- 2024Rethinking State Disentanglement in Causal Reinforcement Learning
- 2026Mathematical methods of reinforcement learning
- 2025Reinforcement Learning with Imperfect Transition Predictions: A Bellman-Jensen Approach
- 2022Pessimism in the Face of Confounders: Provably Efficient Offline Reinforcement Learning in Partially Observable Markov Decision Processes
- 2026Residuals-based Offline Reinforcement Learning