A Concentration Bound for LSPE()
Abstract
The popular LSPE() algorithm for policy evaluation is revisited to derive a concentration bound that gives high probability performance guarantees from some time on.
View on arXivComments on this paper
The popular LSPE() algorithm for policy evaluation is revisited to derive a concentration bound that gives high probability performance guarantees from some time on.
View on arXiv