On Gap-dependent Bounds for Offline Reinforcement Learning
share
This paper presents a systematic study on gap-dependent sample complexity in offline reinforcement learning. Prior work showed when the density ratio between an optimal policy and the behavior policy is upper bounded (the optimal policy coverage assumption), then the agent can achieve an O(1/ϵ^2) rate, which is also minimax optimal. We show under the optimal policy coverage assumption, the rate can be improved to O(1/ϵ) when there is a positive sub-optimality gap in the optimal Q-function. Furthermore, we show when the visitation probabilities of the behavior policy are uniformly lower bounded for states where an optimal policy's visitation probabilities are positive (the uniform optimal policy coverage assumption), the sample complexity of identifying an optimal policy is independent of 1/ϵ. Lastly, we present nearly-matching lower bounds to complement our gap-dependent upper bounds.
READ FULL TEXT
