Online Reinforcement Learning With The Help Of Confounded Offline Data
summary
Two linked papers claim offline, confounded logs can speed online learning under concrete assumptions. For linear contextual bandits the method estimates linear constraints from logged context–action–reward triplets and, if allowed to query the logging policy, provably reduces regret from O(d sqrt(T)) to O((d−l) sqrt(T)) by effectively removing observed-context dimensions; the bound degrades if ROH is hard to estimate. For RL the authors derive an unbiased, GAN‑like objective and two algorithms (a slow provable one and a practical gradient version) and test on Assistive Gym, showing faster learning under moderate context shift but failure under large shifts and no proven general acceleration yet.
AI-written summary · about
chapters (5)
- 0:00Motivation and context
- 3:24Linear bandit research
- 13:33Imitation learning analysis
- 23:57Reinforcement learning aid
- 28:24Conclusion and discussion
related talks
35mOnline Learning with A Lot of Batch Data
54mGeneralization and Robustness in Offline Reinforcement Learning
43mContextual Inverse Optimization: Offline and Online Learning
34mUniform Offline Policy Evaluation (OPE) and Offline Learning in Tabular RL
43mOnline Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
41mBetter Learning from the Past: Counterfactual / Batch RL
01h 17mOnline Reinforcement Learning and Regret
48mOffline Reinforcement Learning With Only Realizability
