Adaptive Agent Design
It is shown that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and what separates the resulting policy from an optimal one.
R. K. Velicheti, Subhonmesh Bose, Tamer Başar
· 0 citations