En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK
1

Reinforcement learning - lecture 2

Bookmarks Report an error
Virtualconference
Authors : Lazaric, Allesandro (Author of the conference)
CIRM (Publisher )

Loading the player...

Abstract : Reinforcement learning (RL) studies the problem of learning how to optimally controlling a dynamical and stochastic environment. Unlike in supervised learning, a RL agent does not receive a direct supervision on which actions to take in order to maximize the longterm reward, and it needs to learn from the samples collected through direct interaction with the environment. RL algorithms combined with deep learning tools recently achieved impressive results in a variety of problems ranging from recommendation systems to computer games, often reaching human-competitive performance (e.g., in the Go game). In this course, we will review the mathematical foundations of RL and the most popular algorithmic strategies. In particular, we will build around the model of Markov decision processes (MDPs) to formalize the agent-environment interaction and ground RL algorithms into popular dynamic programming algorithms, such as value and policy iteration. We will study how such algorithms can be made online, incremental and how to integrate approximation techniques from the deep learning literature. Finally, we will discuss the problem of the exploration-exploitation dilemma in the simpler bandit scenario as well as in the full RL case. Across the course, we will try to identify the main current limitations of RL algorithms and the main open questions in the field.

Theoretical part
- Introduction to reinforcement learning (recent advances and current limitations)
- How to model a RL problem: Markov decision processes (MDPs)
- How to solve an MDP: Dynamic programming methods (value and policy iteration)
- How to solve an MDP from direct interaction: RL algorithms (Monte-Carlo, temporal difference, SARSA, Q-learning)
- How to solve an MDP with approximation (aka deep RL): value-based (e.g., DQN) and policy gradient methods (e.g., Reinforce, TRPO)
- How to efficiently explore an MDP: from bandit to RL

Practical part
- Simple example of value iteration and Q-learning
- More advanced example with policy gradient
- Simple bandit example for exploration
- More advanced example for exploration in RL

MSC Codes :
62C05 - General considerations
68T05 - Learning and adaptive systems
90C15 - Stochastic programming
68Q87 - Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
93B47 - Iterative learning control

    Information on the Video

    Film maker : Hennenfent, Guillaume
    Language : English
    Available date : 22/02/2021
    Conference Date : 28/01/2021
    Subseries : Research School
    arXiv category : Machine Learning ; Artificial Intelligence
    Mathematical Area(s) : Control Theory & Optimization ; Probability & Statistics
    Format : MP4 (.mp4) - HD
    Video Time : 01:35:45
    Targeted Audience : Researchers
    Download : https://videos.cirm-math.fr/2021-01-28_Lazaric_2.mp4

Information on the Event

Event Title : Mathematics, Signal Processing and Learning / Mathématiques, traitement du signal et apprentissage
Event Organizers : Anthoine, Sandrine ; Chaux, Caroline ; Mélot, Clothilde ; Richard, Frédéric
Dates : 25/01/2021 - 29/01/2021
Event Year : 2021
Event URL : https://conferences.cirm-math.fr/2472.html

Citation Data

DOI : 10.24350/CIRM.V.19705003
Cite this video as: Lazaric, Allesandro (2021). Reinforcement learning - lecture 2. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.19705003
URI : http://dx.doi.org/10.24350/CIRM.V.19705003

See Also

Bibliography



Bookmarks Report an error