Lecture

N-step TD Methods: SARSA and Expected SARSA

In course

Proident ea laboris magna deserunt sunt pariatur ullamco nostrud voluptate laborum nostrud. Eu esse elit exercitation nisi sit sit. Amet labore qui enim ullamco adipisicing ex aute ut duis velit ad.

Description

This lecture discusses the scaling problem of Temporal Difference (TD) algorithms and introduces n-step TD methods as a solution. It covers the concept of n-step SARSA and n-step expected SARSA, explaining how they improve the flow of information in reinforcement learning. The lecture also explores the use of n-step TD methods for estimating both action values and state values, providing a comprehensive overview of their implementation and benefits.

Instructor

quis eiusmod

Enim tempor Lorem irure qui ullamco deserunt aliquip in nostrud qui adipisicing in eu. Ipsum nisi laboris eu eiusmod anim quis. Id culpa deserunt enim laborum velit nulla eiusmod ipsum duis laboris Lorem commodo. Ullamco deserunt ea aliqua commodo tempor exercitation. Reprehenderit mollit do quis minim culpa velit nisi amet commodo aliquip reprehenderit aute ex eu.

Official source

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

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.

Related lectures (32)

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.