Q-learning
Topic history | v1 (current) | created by janarez
Details
Q-learning
see v1 | created by janarez | Add topic "Q-learning"
- Title
- Q-learning
- Description
- Q-learning is a model-free reinforcement learning algorithm to learn the value of an action in a particular state. It does not require a model of the environment (hence "model-free"), and it can handle problems with stochastic transitions and rewards without requiring adaptations. For any finite Markov decision process (FMDP), Q-learning finds an optimal policy in the sense of maximizing the expected value of the total reward over any and all successive steps, starting from the current state. Q-learning can identify an optimal action-selection policy for any given FMDP, given infinite exploration time and a partly-random policy. "Q" refers to the function that the algorithm computes - the expected rewards for an action taken in a given state.
- Link
- https://en.wikipedia.org/?curid=1281850
resources
treated in Intro to Q-learning in RL
authors
This topic has no history of related authors.