A concentration bound for contractive stochastic approximation

摘要

We derive a 'high probability' concentration bound for stochastic approximation schemes for finding the fixed point of a contraction map, and illustrate its applications in reinforcement learning for approximate dynamic programming. (C) 2021 Elsevier B.V. All rights reserved.