cs.LGSep 28, 2026

Deep Weighted Bellman Residual Minimization for Q∗Q^* Estimation

Authors: Lican Kang, Jerry Zhijian Yang, Cheng Yuan, Chen Zhong

Organizations: Institute for Math and AI, Wuhan University, Wuhan, 430072, China · Hubei Key Laboratory of Computational Science, Wuhan University, Wuhan, 430072, China · School of Artificial Intelligence, Wuhan University, Wuhan, 430072, China · School of Mathematics and Statistics, Wuhan University, Wuhan, 430072, China

Abstract

Off-policy evaluation is a foundational component of offline reinforcement learning, aiming to assess and optimize policy performance using pre-collected datasets. However, such datasets often suffer from pronounced challenges, including distribution shift, QQ-value overestimation, and low sample utilization efficiency. To address these issues, this paper introduces a weighted Bellman residual minimization framework that incorporates density ratio weighting by effectively integrating expert demonstrations with behavioral data. The proposed weighting scheme departs from the conventional completeness assumption commonly imposed in the theoretical analysis of deep reinforcement learning. We establish a sharp convergence rate for density ratio estimation and derive the convergence rate for the excess risk of resulting deep Q∗Q^* estimator. Extensive empirical evaluations demonstrate that, compared to existing methods, our method achieves significant improvements in numerical performance and policy generalization, providing specific guidance for the rational utilization of expert demonstrations.

Figures & tables

Explore similar work

CardsList
  1. Distributional Off-Policy Evaluation with Deep Quantile Process Regression

    Apr 20, 2026Qi Kuang, Chao Wang, Yuling Jiao +1Distributional Reinforcement LearningOff-Policy Learning

  2. Fitted Occupancy-Ratio Evaluation without Bellman Completeness

    Jul 6, 2026Lars van der Laan, Nathan KallusBellman EquationOccupancy