Reinforcement Learning by Value Gradients
| dc.creator | Fairbank, Michael | |
| dc.date | 2008-03-25 | |
| dc.date.accessioned | 2026-07-07T09:28:17Z | |
| dc.date.available | 2026-07-07T09:28:17Z | |
| dc.description | The concept of the value-gradient is introduced and developed in the context of reinforcement learning. It is shown that by learning the value-gradients exploration or stochastic behaviour is no longer needed to find locally optimal trajectories. This is the main motivation for using value-gradients, and it is argued that learning value-gradients is the actual objective of any value-function learning algorithm for control problems. It is also argued that learning value-gradients is significantly more efficient than learning just the values, and this argument is supported in experiments by efficiency gains of several orders of magnitude, in several problem domains. Once value-gradients are introduced into learning, several analyses become possible. For example, a surprising equivalence between a value-gradient learning algorithm and a policy-gradient learning algorithm is proven, and this provides a robust convergence proof for control problems using a value function with a general function approximator. | |
| dc.identifier | https://arxiv.org/abs/0803.3539 | |
| dc.identifier | http://arxiv.org/abs/0803.3539 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157402 | |
| dc.subject | Neural and Evolutionary Computing | |
| dc.subject | Artificial Intelligence | |
| dc.title | Reinforcement Learning by Value Gradients | |
| dc.type | text |