Abstract

We present a continuous-time master-equation formulation of reinforcement learning. Both non-associative (stochastic learning automaton) and associative (neural network) cases are considered. A Fokker–Planck equation for the stochastic dynamics of the learning process is derived using a small-fluctuation expansion of the master equation. We then show how the Fokker–Planck approximation can be used to determine the global asymptotic behaviour of ergodic learning schemes such as linear reward–penalty (LR−P) and associative reward–penalty (LR−P), in the limit of small learning rates. A simple example of reinforcement learning in a non-stationary environment is studied.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.