Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This lecture covers the combination of policy-gradient learning and actor-critic architectures with eligibility traces, leading to an elegant online learning rule. It explains how the actor learns through policy gradient while the critic learns via TD-learning, updating eligibility traces and weights accordingly. The lecture also reviews the concept of eligibility traces, their decay over time, and their role in updating Q-values. Furthermore, it explores the use of eligibility traces in policy gradient, keeping memory of previous candidate updates and updating parameters of the 'actor' network. The schematics of Actor-Critic with Eligibility Traces are presented, illustrating the parameters and actions involved. The lecture concludes with an algorithm for estimating values using differentiable policy and state-value function parameterizations.
Network: Computation in Neural Systems', Journal of Computational Neuroscience', and `Science'.