Learning to Control Unknown Systems
summary
Proposes a concrete algorithm that applies posterior sampling to unknown finite MDPs and to linear stochastic systems: maintain a Bayesian posterior over transition/A,B parameters, sample θ at episode start, solve the MDP or LQR via dynamic programming, execute that policy until either every episode length increases by one or some state-action visit count doubles (or covariance halves for linear systems). Proves expected regret Õ(√T) (constants explicit, linear in |S|, √ in |A|), shows sublinear regret empirically on benchmark tasks but requires a closed-loop stability assumption for the proofs.
AI-written summary · about
chapters (16)
- 0:00Intro
- 1:03A Markov Decision Process
- 1:38Dynamic Programming
- 2:24Unknown Model
- 4:04Bandit Models and Online Learning
- 9:26The (Thompson) Posterior Sampling Algorithm
- 11:35Learning an Unknown MDP
- 15:38The PSDE Algorithm: Posterior Sampling with Dynamic Episodes
- 16:32Non-asymptotic Regret bound for PSDE
- 17:54Numerical Performance
- 18:56Proof Outline
- 22:54Unknown Stochastic Linear System
- 23:50Stochastic Adaptive Control
- 24:55The Posterior Sampling with Dynamic Episodes (PSDE) Learning Algorithm
- 25:43VT-Regret of PSDE Algorithm
- 26:54Conclusions
related talks
31mStable Reinforcement Learning with Unbounded State Space
15mMulti-Agent Reinforcement Learning In Stochastic Games: From Alphago To Robust Control
01h 05mFoundations of RL
46mDynamic Regret Minimization for Bandits without Prior Knowledge
56mA Tutorial on Reinforcement Learning II
42mReinforcement Learning using Generative Models for Continuous State and Action Space Systems
01h 01mA Tutorial on Reinforcement Learning I
01h 17mOnline Reinforcement Learning and Regret
