~/talk

Multi-Agent Reinforcement Learning In Stochastic Games: From Alphago To Robust Control

Talkat Meet the Fellows Welcome Event · 2021-09-08..09-09· [machine-learning]
links:none on file
slides:none on file

Shows that a simple model-based multi-agent RL plug-in estimator achieves nearly minimax sample complexity scaling with state count S, action counts a1+a2, discount factor and error ε, and matches a lower bound up to constants. Constructs a fully decentralized Q-learning algorithm with two-time-scale updates that provably converges to Nash in two-player zero-sum stochastic games and is rational against stationary opponents. Analyzes linear quadratic games where policy optimization with a two-loop scheme attains global convergence, preserves robustness via implicit regularization, and can beat LMI/SDP solvers in practice.

AI-written summary · about

  1. 0:00Intro
  2. 0:23Background
  3. 0:39Prelude
  4. 2:42Motivation
  5. 3:25Our Answer
  6. 5:11Recall: Why is Multi-agent RL Challenging?
  7. 6:02Why is Decentralized Learning Important?
  8. 7:20Decentralized Q-Learning Dynamics
  9. 8:04Features of the Learning Dynamics
  10. 9:24Another Fundamental Class of Stochastic Games
  11. 10:19A Unified Model for Robust/Risk-sensitive Control
  12. 10:51Landscape & Algorithm
  13. 11:15Landscape Cont'd
  14. 11:45Implicit Regularization
  15. 13:08Concluding Remarks
~/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.