cs.LGNov 12, 2026

Offline KL-Regularized Reinforcement Learning with Stochastic Transitions

Authors: Andrew Liu

Abstract

KL-regularized reinforcement learning is the objective behind RL fine-tuning of language models, and its data are often collected by the reference policy itself. However, beyond bandits and deterministic transitions, little is known about how much offline data it needs. In this work, we study finite discounted Markov decision processes with unknown stochastic transitions, KK state-action pairs and effective horizon HH. For data that cover the regularized optimum with concentrability C≥4C\geq 4, every estimator needs Ω(KCH3/(εmax⁡{ε,β}))Ω(KCH^3/(ε\max\{ε,β\})) samples on some instances when εε is small, where ββ is the temperature. Under a fixed design, pessimistic soft value iteration with a variance-aware penalty attains this rate with high probability, up to logarithmic factors, when β≥1.4Hβ\geq 1.4H. When the data come from the reference policy itself, we show that it covers the optimum up to a power law whose exponent grows as H/βH/β; in the same temperature range, this power law alone gives the estimator a sample complexity polynomial in 1/ε1/ε, with no coverage assumption. For β≥Hβ\geq H the power can also increase the sample size needed by a factor polynomial in 1/ε1/ε. Finally, the plug-in estimator, which is minimax optimal with a generative model, can fail on reference data at small temperatures when many actions are rarely seen, while the pessimistic estimator does not.

Figures & tables

Appendix figures & tables3 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

    May 4, 2026Kaixuan Ji, Qiwei Di, Heyang Zhao +2Multi-Armed BanditsSample Complexity