REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs
Machine Learning
2012-05-14 v1
Abstract
We provide an algorithm that achieves the optimal regret rate in an unknown weakly communicating Markov Decision Process (MDP). The algorithm proceeds in episodes where, in each episode, it picks a policy using regularization based on the span of the optimal bias vector. For an MDP with S states and A actions whose optimal bias vector has span bounded by H, we show a regret bound of ~O(HSpAT). We also relate the span to various diameter-like quantities associated with the MDP, demonstrating how our results improve on previous regret bounds.
Cite
@article{arxiv.1205.2661,
title = {REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs},
author = {Peter L. Bartlett and Ambuj Tewari},
journal= {arXiv preprint arXiv:1205.2661},
year = {2012}
}
Comments
Appears in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI2009)