Organizations: Department of Economics, Yale University, New Haven, 06511, USA. · School of Artificial Intelligence, and Hubei Key Laboratory of Computational Science, Wuhan University, Wuhan, 430072, China. · Institute for Math and AI, Hubei Key Laboratory of Computational Science, and School of Artificial Intelligence, Wuhan University, Wuhan, 430072, China. · School of Mathematics and Statistics, and Hubei Key Laboratory of Computational Science, Wuhan University, Wuhan, 430072, China. · School of Mathematics and Statistics, Wuhan University, Wuhan, 430072, China.
In offline RL, estimating the optimal action-value function Q∗ can be formulated as solving the optimal Bellman equation based solely on offline observations. A fundamental challenge is that the reward function and transition kernel are unknown, so the optimal Bellman operator is not directly observable from data. To address this issue, we propose a novel framework that decouples operator estimation from value function learning. In this approach, we first formulate conditional diffusion models to estimate the reward law and transition kernel, which induces a data-driven approximation of the optimal Bellman operator. We then plug these estimators into the Bellman equation and obtain a deep estimator of Q∗ by minimizing the empirical Bellman residual over a neural network function class. Theoretically, we first establish sharp nonasymptotic convergence rates for learning the optimal Bellman operator through an end-to-end analysis of conditional diffusion estimation in total variation distance. We then establish the oracle value-stage rate O(n−dx+da+2β2β) for the excess Bellman residual risk. Finally, under a concentrability condition, we translate this residual bound into an L2 convergence rate of O(n−dx+da+2ββ) for the resulting deep estimator of Q∗, where dx and da denote the dimensions of the state and action spaces, respectively, and β denotes the Hölder smoothness index of Q∗. Importantly, our theoretical analysis does not rely on completeness assumptions commonly used in deep RL theory. Extensive numerical experiments demonstrate the effectiveness of the proposed method and its strong empirical performance.
Figures & tables
Figure 1: Illustrations of the benchmark environments: Pendulum (Left) and Swimmer (Right).
Figure 2: Performance comparison on the Gymnasium Pendulum task. Left: training reward over 300 epochs, where the solid line is the mean over three seeds and the shaded region is the min-max range. Right: box plot of evaluation rewards over 150 returns.
Figure 3: Performance comparison on the Gymnasium Swimmer task. Left: training reward over 300 epochs, where the solid line is the mean over three seeds and the shaded region is the min-max range. Right: box plot of evaluation rewards over 150 returns.
Task
DFQI
MABO
MOPO
Ours
Pendulum
-212.92
-206.39
-232.40
-177.06
Swimmer
30.93
39.33
34.98
71.90
Table 1: Evaluation results on the Gymnasium environment tasks.
Figure 4: Performance comparison on the MIMIC-III sepsis treatment task. Left: training reward over 300 epochs, where the solid line is the mean over three seeds and the shaded region is the min-max range. Right: box plot of evaluation rewards over 150 returns.
Method
Clinician
MABO
MOPO
DFQI
Ours
Reward
-5.59
-5.92
-5.88
-6.69
-5.33
Table 2: Evaluation results on the MIMIC-III sepsis treatment task.
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, Q-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∗ 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.
Lican Kang, Jerry Zhijian Yang, Cheng Yuan +1
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 +1
We propose a model-free offline multi-step reinforcement learning (RL) algorithm, Conservative Peng's Q(λ) (CPQL). Our algorithm adapts the Peng's Q(λ) (PQL) operator for conservative value estimation as an alternative to the Bellman operator. To the best of our knowledge, this is the first work in offline RL to theoretically and empirically demonstrate the effectiveness of conservative value estimation with a multi-step operator by fully leveraging offline trajectories. The fixed point of the PQL operator in offline RL lies closer to the value function of the behavior policy, thereby naturally inducing implicit behavior regularization. CPQL simultaneously mitigates over-pessimistic value estimation, achieves performance greater than (or equal to) that of the behavior policy, and provides near-optimal performance guarantees -- a milestone that previous conservative approaches could not achieve. Extensive numerical experiments on the D4RL benchmark demonstrate that CPQL consistently and significantly outperforms existing offline single-step baselines. In addition to the contributions of CPQL in offline RL, our proposed method also contributes to the offline-to-online learning framework. Using the Q-function pre-trained by CPQL in offline settings enables the online PQL agent to avoid the performance drop typically observed at the start of fine-tuning and to attain robust performance improvements. Our code is available at https://github.com/oh-lab/CPQL.
Offline reinforcement learning (RL) has received increasing attention for learning policies from previously collected data without interaction with the real environment, which is particularly important in high-stakes applications. While a growing body of work has developed offline RL algorithms, these methods often rely on restrictive assumptions about data coverage and suffer from distribution shift. In this paper, we propose a residuals-based offline RL framework for general state and action spaces. Specifically, we define a residuals-based Bellman optimality operator that explicitly incorporates estimation error in learning transition dynamics into policy optimization by leveraging empirical residuals. We show that this Bellman operator is a contraction mapping and identify conditions under which its fixed point is asymptotically optimal and possesses finite-sample guarantees. We further develop a residuals-based offline deep Q-learning (DQN) algorithm. Using a stochastic CartPole environment, we demonstrate the effectiveness of our residuals-based offline DQN algorithm.
Qing Zhu, Xian Yu
Department of Integrated Systems Engineering, The Ohio State University, Columbus, OH, USA