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 arXivWe use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.