~/talk

Generalization and Robustness in Offline Reinforcement Learning

name:Wen Sun
links:none on file
slides:none on file

Proposes a model-based offline RL pipeline that fits a transition model by MLE then pessimism (constrain models near the MLE and plan against the worst-case model) and proves it competes with the best covered policy whenever a realizable model class and coverage measure hold, with sample complexity polynomial in function-class complexity (e.g. log |F|) rather than number of states. Extends to kernels and low-rank MDPs (bounds scale with rank d), and for imitation uses a learned model plus model uncertainty penalty to combine few expert demos with large offline logs — succeeds on a simulated humanoid where behavior cloning fails.

AI-written summary · about

  1. 0:00Intro
  2. 0:43Empirical RL for large-scale problems
  3. 1:32Traditional Online RL paradigm
  4. 2:57offline RL paradigm
  5. 4:12Potential Applications of Offline RL
  6. 6:01Why offline RL is challenging?
  7. 8:44Finite Horizon MDPs
  8. 9:32Offline Data Collection
  9. 12:24Offline Data Coverage
  10. 13:48Learning goal in Offline RL: Robustness
  11. 15:14Learning goal in Offline RL: Generalization
  12. 17:25A Model-based Approach
  13. 19:02A Naive Model-based Approach
  14. 25:46Formal Theoretical Guarantee for CPPO
  15. 39:40Traditional Imitation Learning
  16. 40:20Covariate shift in Imitation
  17. 40:50Offline Imitation Learning
  18. 44:06Explanation of MILO
  19. 45:00Experiments of MILO
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.