A Unifying View of Optimism in Episodic Reinforcement Learning
summary
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
chapters (14)
- 0:00Intro
- 0:47Episodic RL
- 1:37Regret in Reinforcement Learning
- 2:12Finding the optimal Policy - known MDP
- 4:35Optimism in Bandits
- 5:12Optimism in Reinforcement Learning
- 7:37Main result
- 10:12Corollaries
- 11:31Framework
- 14:17Summary
- 15:22Examples
- 17:39Factored Linear MDPS
- 18:54Incorporating Uncertainty
- 24:43Conclusions
related talks
47mReinforcement Learning via an Optimization Lens
11mLinear Predictors in Reinforcement Learning: ...
01h 17mOnline Reinforcement Learning and Regret
34mOffline Reinforcement Learning and Model-Based Optimization
53mOff-policy Policy Optimization
33mA Few Connections Between Optimization and Probability
44mBeyond Worst-Case: Instance-Dependent Optimality in Reinforcement Learning
54mGeneralization and Robustness in Offline Reinforcement Learning
