~/talk

A Unifying View of Optimism in Episodic Reinforcement Learning

links:none on file
slides:none on file

Claim: the optimization solved by model‑optimistic RL (optimize p in a confidence set) is the Lagrangian dual of a value‑optimistic dynamic program, so every model‑optimistic algorithm has an equivalent value‑optimistic implementation that just runs backwards recursion with an added uncertainty bonus equal to the conjugate distance d . Proof uses occupancy‑measure LPs, reparameterization, Lagrangian duality and martingale concentration. Consequence: recover UCRL2’s √T regret via the bonus, extend to factored linear MDPs (recovers LSVI‑UCB/Eluder‑style bounds), but an extra √S gap in tabular dependence remains.

AI-written summary · about

  1. 0:00Intro
  2. 0:47Episodic RL
  3. 1:37Regret in Reinforcement Learning
  4. 2:12Finding the optimal Policy - known MDP
  5. 4:35Optimism in Bandits
  6. 5:12Optimism in Reinforcement Learning
  7. 7:37Main result
  8. 10:12Corollaries
  9. 11:31Framework
  10. 14:17Summary
  11. 15:22Examples
  12. 17:39Factored Linear MDPS
  13. 18:54Incorporating Uncertainty
  14. 24:43Conclusions
~/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.