Fast Rates for Offline Q-Learning with KL Regularization
This paper investigates offline Q-learning for finite-horizon Markov decision processes with Kullback-Leibler (KL) regularization. Recent studies have shown that KL regularization can yield fast rates in offline decision-making problems. However, it remains unclear whether Q-learning, which adopts incremental stochastic approximation updates, can achieve such fast rates in the offline setting. We…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
