Sutton, Richard S., and Andrew G. Barto. Reinforcement learning: An introduction. Vol. 1. No. 1. Cambridge: MIT press, 1998Q-Learning: All that is required for correct convergence is that all pairs continue to be updated. This is a minimal requirement in the sense that any method guaranteed to find optimal behavior in the general case must require it.How one can mathematically show that all the states are visited and continue to be visited? Is it enough to show that all the state-action pairs have a chance to be selected to show that QL converges?
Reinforcement Learning: How to formally show that all action-state pairs are visited?
machine learning;reinforcement learning