YoVDO

Provably Efficient Adversarial Imitation Learning with Unknown Transitions - Oral Session 4

Offered By: Uncertainty in Artificial Intelligence via YouTube

Tags

Reinforcement Learning Courses Markov Decision Processes Courses Function Approximation Courses Sample Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 27-minute conference talk from the Uncertainty in Artificial Intelligence (UAI) 2023 Oral Session 4 that delves into the theoretical foundations of Adversarial Imitation Learning (AIL) in environments with unknown transitions. Learn about the challenges posed by stochastic and uncertain environment transitions in AIL and discover the innovative MB-TAIL algorithm, which achieves minimax optimal expert sample complexity and interaction complexity. Understand how this research connects reward-free exploration with AIL and extends to function approximation settings, advancing the field of imitation learning. Gain insights from the presented slides and the abstract of the paper "Provably Efficient Adversarial Imitation Learning with Unknown Transitions" by Tian Xu, Ziniu Li, Yang Yu, and Zhi-Quan Luo.

Syllabus

UAI 2023 Oral Session 4: Provably Efficient Adversarial Imitation Learning with Unknown Transitions


Taught by

Uncertainty in Artificial Intelligence

Related Courses

Beyond Worst-Case Analysis - Panel Discussion
Simons Institute via YouTube
Reinforcement Learning - Part I
Simons Institute via YouTube
Reinforcement Learning in Feature Space: Complexity and Regret
Simons Institute via YouTube
Exploration with Limited Memory - Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
Association for Computing Machinery (ACM) via YouTube
Optimal Transport for Machine Learning - Gabriel Peyre, Ecole Normale Superieure
Alan Turing Institute via YouTube