~/talk

Offline Reinforcement Learning With Only Realizability

name:Jason Lee
links:none on file
slides:none on file

Proposes solving offline RL by solving a regularized primal-dual LP (density-regularized DICE-style objective) to recover an importance weight w and extract a policy, requiring only realizability for value and density ratio plus a single-policy concentrability on the regularized occupancy. Shows unbiased sample estimates, uniform-convergence bounds giving sample rates that scale with log |function classes| and polynomially in 1/ε (a provable ε^-6 bound with an ε^-4 asymptotic improvement), and handles agnostic misspecification and policy extraction via behavior cloning.

AI-written summary · about

  1. 0:00Introduction
  2. 5:00Linear Kernel
  3. 9:00Offline vs Online
  4. 13:40What should F approximate
  5. 15:36What is completeness
  6. 17:48Common justification for completeness
  7. 19:24Classical pessimism
  8. 25:02Linear pessimism
  9. 29:28Density regularization
  10. 32:18Policy extraction
  11. 33:24Realizability
  12. 40:30Proof
  13. 41:40Other Results
  14. 43:45Conclusion
~/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.