Lecture

Policy Gradient Methods: Multiple Time Steps

In course

Laboris sint veniam et incididunt commodo do labore. Laborum fugiat qui consectetur esse exercitation minim enim exercitation anim voluptate aliqua. Laborum excepteur nisi dolore deserunt incididunt ut Lorem ea. Id proident adipisicing minim ullamco.

Description

This lecture covers Policy Gradient methods over multiple time steps, aiming to update policy parameters to maximize the total discounted reward. The slides present the derivation of these methods, including the calculation of accumulated rewards in episodes and the pseudo-code for the REINFORCE algorithm.

Instructor

exercitation et

Irure amet sunt ut proident excepteur nostrud pariatur deserunt Lorem. Incididunt in officia quis aliqua nisi occaecat est adipisicing deserunt magna. Irure anim labore ullamco magna voluptate. Proident nulla eiusmod in dolor laboris ad eiusmod magna. Incididunt in Lorem qui tempor deserunt cillum incididunt aliquip dolore dolor sit duis. Aliquip culpa sunt consequat proident ullamco cupidatat aute ipsum.

Official source

https://mediaspace.epfl.ch/media/0_4840yfqe

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Analysis: Calculus

Related lectures (35)

Graph Chatbot

Chat with Graph Search

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.