~/talk

Online Reinforcement Learning With The Help Of Confounded Offline Data

Talkat Learning from Interventions 2022 · 2022-02-14..02-17· [machine-learning]
links:none on file
slides:none on file

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

  1. 0:00Motivation and context
  2. 3:24Linear bandit research
  3. 13:33Imitation learning analysis
  4. 23:57Reinforcement learning aid
  5. 28:24Conclusion and discussion
~/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.